TSTP Solution File: GEO214+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO214+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 22:47:09 EDT 2023
% Result : Theorem 0.17s 0.54s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 34 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 59 ( 21 ~; 27 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 9 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
distinct_points: ( $i * $i ) > $o ).
tff(decl_23,type,
distinct_lines: ( $i * $i ) > $o ).
tff(decl_24,type,
convergent_lines: ( $i * $i ) > $o ).
tff(decl_25,type,
line_connecting: ( $i * $i ) > $i ).
tff(decl_26,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(decl_27,type,
intersection_point: ( $i * $i ) > $i ).
tff(decl_28,type,
parallel_through_point: ( $i * $i ) > $i ).
tff(decl_29,type,
unorthogonal_lines: ( $i * $i ) > $o ).
tff(decl_30,type,
orthogonal_through_point: ( $i * $i ) > $i ).
tff(decl_31,type,
esk1_0: $i ).
tff(decl_32,type,
esk2_0: $i ).
fof(con,conjecture,
! [X6,X7] :
( unorthogonal_lines(X6,X7)
=> unorthogonal_lines(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(oac1,axiom,
! [X6,X7,X8] :
( ( convergent_lines(X6,X7)
& unorthogonal_lines(X6,X7) )
=> ( ( convergent_lines(X6,X8)
& unorthogonal_lines(X6,X8) )
| ( convergent_lines(X7,X8)
& unorthogonal_lines(X7,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',oac1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X7] :
( unorthogonal_lines(X6,X7)
=> unorthogonal_lines(X7,X6) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,plain,
! [X49,X50,X51] :
( ( convergent_lines(X50,X51)
| convergent_lines(X49,X51)
| ~ convergent_lines(X49,X50)
| ~ unorthogonal_lines(X49,X50) )
& ( unorthogonal_lines(X50,X51)
| convergent_lines(X49,X51)
| ~ convergent_lines(X49,X50)
| ~ unorthogonal_lines(X49,X50) )
& ( convergent_lines(X50,X51)
| unorthogonal_lines(X49,X51)
| ~ convergent_lines(X49,X50)
| ~ unorthogonal_lines(X49,X50) )
& ( unorthogonal_lines(X50,X51)
| unorthogonal_lines(X49,X51)
| ~ convergent_lines(X49,X50)
| ~ unorthogonal_lines(X49,X50) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oac1])])]) ).
fof(c_0_7,negated_conjecture,
( unorthogonal_lines(esk1_0,esk2_0)
& ~ unorthogonal_lines(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_9,plain,
! [X47,X48] :
( convergent_lines(X47,X48)
| unorthogonal_lines(X47,X48) ),
inference(variable_rename,[status(thm)],[occu1]) ).
cnf(c_0_10,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1)
| ~ unorthogonal_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X12] : ~ convergent_lines(X12,X12),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X19,X20,X21] :
( ~ convergent_lines(X19,X20)
| convergent_lines(X19,X21)
| convergent_lines(X20,X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])]) ).
cnf(c_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( unorthogonal_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1)
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO214+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Aug 29 18:55:43 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.52 start to proof: theBenchmark
% 0.17/0.54 % Version : CSE_E---1.5
% 0.17/0.54 % Problem : theBenchmark.p
% 0.17/0.54 % Proof found
% 0.17/0.54 % SZS status Theorem for theBenchmark.p
% 0.17/0.54 % SZS output start Proof
% See solution above
% 0.17/0.54 % Total time : 0.007000 s
% 0.17/0.54 % SZS output end Proof
% 0.17/0.54 % Total time : 0.010000 s
%------------------------------------------------------------------------------