TSTP Solution File: GEO233+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO233+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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:20 EDT 2023
% Result : Theorem 0.53s 0.59s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 40 ( 13 unt; 17 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 15 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 16 >; 17 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 30 ( 2 sgn; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(decl_23,type,
left_apart_point: ( $i * $i ) > $o ).
tff(decl_24,type,
reverse_line: $i > $i ).
tff(decl_25,type,
convergent_lines: ( $i * $i ) > $o ).
tff(decl_26,type,
unequally_directed_lines: ( $i * $i ) > $o ).
tff(decl_27,type,
divides_points: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
before_on_line: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
distinct_points: ( $i * $i ) > $o ).
tff(decl_30,type,
line_connecting: ( $i * $i ) > $i ).
tff(decl_31,type,
between_on_line: ( $i * $i * $i * $i ) > $o ).
tff(decl_32,type,
distinct_lines: ( $i * $i ) > $o ).
tff(decl_33,type,
line: $i > $o ).
tff(decl_34,type,
left_convergent_lines: ( $i * $i ) > $o ).
tff(decl_35,type,
point: $i > $o ).
tff(decl_36,type,
intersection_point: ( $i * $i ) > $i ).
tff(decl_37,type,
parallel_through_point: ( $i * $i ) > $i ).
tff(decl_38,type,
esk1_0: $i ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) )
=> ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(con,conjecture,
! [X2] : ~ unequally_directed_lines(reverse_line(reverse_line(X2)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(oag6,axiom,
! [X2,X3,X6] :
( unequally_directed_lines(X2,X3)
=> ( unequally_directed_lines(X2,X6)
| unequally_directed_lines(X3,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag6) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag5) ).
fof(c_0_5,plain,
! [X38,X39] :
( ~ unequally_directed_lines(X38,X39)
| ~ unequally_directed_lines(X38,reverse_line(X39))
| left_convergent_lines(X38,X39)
| left_convergent_lines(X38,reverse_line(X39)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).
fof(c_0_6,plain,
! [X42,X43] :
( ~ left_convergent_lines(X42,X43)
& ~ left_convergent_lines(X42,reverse_line(X43)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X2] : ~ unequally_directed_lines(reverse_line(reverse_line(X2)),X2),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
cnf(c_0_8,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X30,X31,X32] :
( ~ unequally_directed_lines(X30,X31)
| unequally_directed_lines(X30,X32)
| unequally_directed_lines(X31,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])]) ).
cnf(c_0_12,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( unequally_directed_lines(X1,X3)
| unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_16,negated_conjecture,
~ unequally_directed_lines(reverse_line(reverse_line(esk1_0)),reverse_line(esk1_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
fof(c_0_18,plain,
! [X29] : ~ unequally_directed_lines(X29,X29),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0))),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO233+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 23:27:27 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 0.53/0.59 % Version : CSE_E---1.5
% 0.53/0.59 % Problem : theBenchmark.p
% 0.53/0.59 % Proof found
% 0.53/0.59 % SZS status Theorem for theBenchmark.p
% 0.53/0.59 % SZS output start Proof
% See solution above
% 0.54/0.60 % Total time : 0.009000 s
% 0.54/0.60 % SZS output end Proof
% 0.54/0.60 % Total time : 0.012000 s
%------------------------------------------------------------------------------