%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO231+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:27:54 PM UTC 2026
% Result : Theorem 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 34 ~; 30 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 52 ( 3 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X3,X6] :
( ( ~ unequally_directed_lines(X2,X6)
& ~ unequally_directed_lines(X2,reverse_line(X3)) )
=> ~ unequally_directed_lines(X3,reverse_line(X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(oag6,axiom,
! [X2,X3,X6] :
( unequally_directed_lines(X2,X3)
=> ( unequally_directed_lines(X3,X6)
| unequally_directed_lines(X2,X6) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag6) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,reverse_line(X3))
& unequally_directed_lines(X2,X3) )
=> ( left_convergent_lines(X2,reverse_line(X3))
| left_convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,reverse_line(X3))
| left_convergent_lines(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag5) ).
fof(c_0_5,negated_conjecture,
~ ! [X2,X3,X6] :
( ( ~ unequally_directed_lines(X2,X6)
& ~ unequally_directed_lines(X2,reverse_line(X3)) )
=> ~ unequally_directed_lines(X3,reverse_line(X6)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X3,X6] :
( ( ~ unequally_directed_lines(X2,X6)
& ~ unequally_directed_lines(X2,reverse_line(X3)) )
=> ~ unequally_directed_lines(X3,reverse_line(X6)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X30,X31,X32] :
( unequally_directed_lines(X31,X32)
| unequally_directed_lines(X30,X32)
| ~ unequally_directed_lines(X30,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])])]) ).
fof(c_0_8,negated_conjecture,
( unequally_directed_lines(esk2_0,reverse_line(esk3_0))
& ~ unequally_directed_lines(esk1_0,esk3_0)
& ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,plain,
( ~ unequally_directed_lines(X1,X2)
| unequally_directed_lines(X2,X3)
| unequally_directed_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X38,X39] :
( left_convergent_lines(X38,reverse_line(X39))
| left_convergent_lines(X38,X39)
| ~ unequally_directed_lines(X38,reverse_line(X39))
| ~ unequally_directed_lines(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])])]) ).
fof(c_0_12,plain,
! [X42,X43] :
( ~ left_convergent_lines(X42,reverse_line(X43))
& ~ left_convergent_lines(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])]) ).
cnf(c_0_13,negated_conjecture,
( unequally_directed_lines(esk2_0,X1)
| unequally_directed_lines(reverse_line(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_14,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_15,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( unequally_directed_lines(X2,X1)
| unequally_directed_lines(esk2_0,X2)
| unequally_directed_lines(reverse_line(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
fof(c_0_18,plain,
! [X29] : ~ unequally_directed_lines(X29,X29),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_19,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( unequally_directed_lines(X2,X3)
| unequally_directed_lines(X1,X3)
| unequally_directed_lines(esk2_0,X2)
| unequally_directed_lines(reverse_line(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_21,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ unequally_directed_lines(reverse_line(esk3_0),X1)
| unequally_directed_lines(esk2_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( unequally_directed_lines(esk2_0,X1)
| unequally_directed_lines(reverse_line(esk3_0),esk2_0) ),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( unequally_directed_lines(X2,X1)
| unequally_directed_lines(esk2_0,X2)
| unequally_directed_lines(esk2_0,reverse_line(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
unequally_directed_lines(reverse_line(esk3_0),esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ unequally_directed_lines(esk2_0,X2)
| unequally_directed_lines(X1,X2)
| unequally_directed_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
unequally_directed_lines(esk2_0,reverse_line(esk2_0)),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( unequally_directed_lines(esk2_0,X1)
| unequally_directed_lines(X1,reverse_line(esk2_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( unequally_directed_lines(esk2_0,X1)
| unequally_directed_lines(X1,reverse_line(esk3_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_31,negated_conjecture,
unequally_directed_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( ~ unequally_directed_lines(X1,esk3_0)
| unequally_directed_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( unequally_directed_lines(esk2_0,X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ unequally_directed_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO231+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 14:10:45 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 % Version: 3.5.1
% 0.19/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.55 % Starting sh5l with 300s (1) cores
% 0.19/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1975065 completed with status 0
% 0.19/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.55 % No SInE strategy applied
% 0.19/0.55 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.19/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.55 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.19/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.55 % SubtermCWHack with pid 1975069 completed with status 0
% 0.19/0.55 % Result found by SubtermCWHack
% 0.19/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.55 % No SInE strategy applied
% 0.19/0.55 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.19/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.55 % Preprocessing time : 0.003 s
% 0.19/0.55
% 0.19/0.55 % Proof found!
% 0.19/0.55 % SZS status Theorem
% 0.19/0.55 % SZS output start CNFRefutation
% See solution above
% 0.19/0.55 % Parsed axioms : 32
% 0.19/0.55 % Removed by relevancy pruning/SinE : 0
% 0.19/0.55 % Initial clauses : 61
% 0.19/0.55 % Removed in clause preprocessing : 0
% 0.19/0.55 % Initial clauses in saturation : 61
% 0.19/0.55 % Processed clauses : 254
% 0.19/0.55 % ...of these trivial : 1
% 0.19/0.55 % ...subsumed : 108
% 0.19/0.55 % ...remaining for further processing : 145
% 0.19/0.55 % Other redundant clauses eliminated : 0
% 0.19/0.55 % Clauses deleted for lack of memory : 0
% 0.19/0.55 % Backward-subsumed : 11
% 0.19/0.55 % Backward-rewritten : 1
% 0.19/0.55 % Generated clauses : 845
% 0.19/0.55 % ...of the previous two non-redundant : 622
% 0.19/0.55 % ...aggressively subsumed : 0
% 0.19/0.55 % Contextual simplify-reflections : 4
% 0.19/0.55 % Paramodulations : 811
% 0.19/0.55 % Factorizations : 34
% 0.19/0.55 % NegExts : 0
% 0.19/0.55 % Equation resolutions : 0
% 0.19/0.55 % Disequality decompositions : 0
% 0.19/0.55 % Total rewrite steps : 190
% 0.19/0.55 % ...of those cached : 173
% 0.19/0.55 % Propositional unsat checks : 0
% 0.19/0.55 % Propositional check models : 0
% 0.19/0.55 % Propositional check unsatisfiable : 0
% 0.19/0.55 % Propositional clauses : 0
% 0.19/0.55 % Propositional clauses after purity: 0
% 0.19/0.55 % Propositional unsat core size : 0
% 0.19/0.55 % Propositional preprocessing time : 0.000
% 0.19/0.55 % Propositional encoding time : 0.000
% 0.19/0.55 % Propositional solver time : 0.000
% 0.19/0.55 % Success case prop preproc time : 0.000
% 0.19/0.55 % Success case prop encoding time : 0.000
% 0.19/0.55 % Success case prop solver time : 0.000
% 0.19/0.55 % Current number of processed clauses : 133
% 0.19/0.55 % Positive orientable unit clauses : 14
% 0.19/0.55 % Positive unorientable unit clauses: 0
% 0.19/0.55 % Negative unit clauses : 14
% 0.19/0.55 % Non-unit-clauses : 105
% 0.19/0.55 % Current number of unprocessed clauses: 420
% 0.19/0.55 % ...number of literals in the above : 1507
% 0.19/0.55 % Current number of archived formulas : 0
% 0.19/0.55 % Current number of archived clauses : 12
% 0.19/0.55 % Clause-clause subsumption calls (NU) : 2947
% 0.19/0.55 % Rec. Clause-clause subsumption calls : 1799
% 0.19/0.55 % Non-unit clause-clause subsumptions : 85
% 0.19/0.55 % Unit Clause-clause subsumption calls : 327
% 0.19/0.55 % Rewrite failures with RHS unbound : 0
% 0.19/0.55 % BW rewrite match attempts : 4
% 0.19/0.55 % BW rewrite match successes : 3
% 0.19/0.55 % Condensation attempts : 0
% 0.19/0.55 % Condensation successes : 0
% 0.19/0.55 % Termbank termtop insertions : 12427
% 0.19/0.55 % Search garbage collected termcells : 666
% 0.19/0.55
% 0.19/0.55 % -------------------------------------------------
% 0.19/0.55 % User time : 0.038 s
% 0.19/0.55 % System time : 0.008 s
% 0.19/0.55 % Total time : 0.046 s
% 0.19/0.55 % Maximum resident set size: 3676 pages
% 0.19/0.55
% 0.19/0.55 % -------------------------------------------------
% 0.19/0.55 % User time : 0.080 s
% 0.19/0.55 % System time : 0.025 s
% 0.19/0.55 % Total time : 0.105 s
% 0.19/0.55 % Maximum resident set size: 4864 pages
% 0.19/0.55 % E exiting
%------------------------------------------------------------------------------