%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO255+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 : n007.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:28:00 PM UTC 2026
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 14 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 81 ( 30 ~; 36 |; 10 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 2 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X1,X4] :
( ( distinct_points(X1,X4)
& line(X2) )
=> ~ ( before_on_line(X2,X4,X1)
& before_on_line(X2,X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(oag8,axiom,
! [X2,X3] :
( ( line(X3)
& line(X2) )
=> ( unequally_directed_lines(X2,reverse_line(X3))
| unequally_directed_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag8) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag5) ).
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(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(oagco9,axiom,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oagco9) ).
fof(c_0_7,negated_conjecture,
~ ! [X2,X1,X4] :
( ( distinct_points(X1,X4)
& line(X2) )
=> ~ ( before_on_line(X2,X4,X1)
& before_on_line(X2,X1,X4) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X35,X36] :
( unequally_directed_lines(X35,reverse_line(X36))
| unequally_directed_lines(X35,X36)
| ~ line(X36)
| ~ line(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag8])])]) ).
fof(c_0_9,negated_conjecture,
( before_on_line(esk1_0,esk3_0,esk2_0)
& before_on_line(esk1_0,esk2_0,esk3_0)
& distinct_points(esk2_0,esk3_0)
& line(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_11,plain,
( ~ line(X2)
| ~ line(X1)
| unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
line(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X42] : ~ unequally_directed_lines(X42,X42),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_14,plain,
! [X49,X50] :
( left_convergent_lines(X49,reverse_line(X50))
| left_convergent_lines(X49,X50)
| ~ unequally_directed_lines(X49,reverse_line(X50))
| ~ unequally_directed_lines(X49,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])])]) ).
fof(c_0_15,plain,
! [X65,X66] :
( ~ left_convergent_lines(X65,reverse_line(X66))
& ~ left_convergent_lines(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])]) ).
fof(c_0_16,plain,
! [X43,X44,X45] :
( unequally_directed_lines(X44,X45)
| unequally_directed_lines(X43,X45)
| ~ unequally_directed_lines(X43,X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ line(X1)
| unequally_directed_lines(X1,esk1_0)
| unequally_directed_lines(X1,reverse_line(esk1_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,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_14]) ).
cnf(c_0_20,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ unequally_directed_lines(X1,X2)
| unequally_directed_lines(X2,X3)
| unequally_directed_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_18]) ).
cnf(c_0_23,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(reverse_line(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ~ unequally_directed_lines(reverse_line(esk1_0),X1)
| unequally_directed_lines(esk1_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( unequally_directed_lines(X2,X1)
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(reverse_line(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
fof(c_0_27,plain,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
inference(fof_simplification,[status(thm)],[oagco9]) ).
cnf(c_0_28,negated_conjecture,
( unequally_directed_lines(X2,X1)
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(esk1_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X51,X52] : ~ unequally_directed_lines(line_connecting(X51,X52),reverse_line(line_connecting(X52,X51))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
( ~ unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(X1,X2)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(esk1_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_32,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( unequally_directed_lines(esk1_0,line_connecting(X2,X1))
| unequally_directed_lines(esk1_0,line_connecting(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
unequally_directed_lines(esk1_0,line_connecting(X1,X1)),
inference(ef,[status(thm)],[c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(line_connecting(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(line_connecting(X1,X1))),
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_37]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO255+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 14:36:20 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.46 Running first-order theorem proving
% 0.10/0.46 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.20/0.54 % Version: 3.5.1
% 0.20/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 % Starting sh5l with 300s (1) cores
% 0.20/0.54 % sh5l with pid 3048925 completed with status 0
% 0.20/0.54 % Result found by sh5l
% 0.20/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 % Starting sh5l with 300s (1) cores
% 0.20/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 % Search class: FGHNF-FFMS21-SFFFFFNN
% 0.20/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.54 % SubtermCWHack with pid 3048932 completed with status 0
% 0.20/0.54 % Result found by SubtermCWHack
% 0.20/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 % Starting sh5l with 300s (1) cores
% 0.20/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 % Search class: FGHNF-FFMS21-SFFFFFNN
% 0.20/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.54 % Preprocessing time : 0.002 s
% 0.20/0.54
% 0.20/0.54 % Proof found!
% 0.20/0.54 % SZS status Theorem
% 0.20/0.54 % SZS output start CNFRefutation
% See solution above
% 0.20/0.54 % Parsed axioms : 32
% 0.20/0.54 % Removed by relevancy pruning/SinE : 2
% 0.20/0.54 % Initial clauses : 53
% 0.20/0.54 % Removed in clause preprocessing : 0
% 0.20/0.54 % Initial clauses in saturation : 53
% 0.20/0.54 % Processed clauses : 159
% 0.20/0.54 % ...of these trivial : 1
% 0.20/0.54 % ...subsumed : 85
% 0.20/0.54 % ...remaining for further processing : 73
% 0.20/0.54 % Other redundant clauses eliminated : 0
% 0.20/0.54 % Clauses deleted for lack of memory : 0
% 0.20/0.54 % Backward-subsumed : 5
% 0.20/0.54 % Backward-rewritten : 0
% 0.20/0.54 % Generated clauses : 286
% 0.20/0.54 % ...of the previous two non-redundant : 213
% 0.20/0.54 % ...aggressively subsumed : 0
% 0.20/0.54 % Contextual simplify-reflections : 0
% 0.20/0.54 % Paramodulations : 230
% 0.20/0.54 % Factorizations : 56
% 0.20/0.54 % NegExts : 0
% 0.20/0.54 % Equation resolutions : 0
% 0.20/0.54 % Disequality decompositions : 0
% 0.20/0.54 % Total rewrite steps : 72
% 0.20/0.54 % ...of those cached : 62
% 0.20/0.54 % Propositional unsat checks : 0
% 0.20/0.54 % Propositional check models : 0
% 0.20/0.54 % Propositional check unsatisfiable : 0
% 0.20/0.54 % Propositional clauses : 0
% 0.20/0.54 % Propositional clauses after purity: 0
% 0.20/0.54 % Propositional unsat core size : 0
% 0.20/0.54 % Propositional preprocessing time : 0.000
% 0.20/0.54 % Propositional encoding time : 0.000
% 0.20/0.54 % Propositional solver time : 0.000
% 0.20/0.54 % Success case prop preproc time : 0.000
% 0.20/0.54 % Success case prop encoding time : 0.000
% 0.20/0.54 % Success case prop solver time : 0.000
% 0.20/0.54 % Current number of processed clauses : 68
% 0.20/0.54 % Positive orientable unit clauses : 11
% 0.20/0.54 % Positive unorientable unit clauses: 0
% 0.20/0.54 % Negative unit clauses : 10
% 0.20/0.54 % Non-unit-clauses : 47
% 0.20/0.54 % Current number of unprocessed clauses: 106
% 0.20/0.54 % ...number of literals in the above : 389
% 0.20/0.54 % Current number of archived formulas : 0
% 0.20/0.54 % Current number of archived clauses : 5
% 0.20/0.54 % Clause-clause subsumption calls (NU) : 833
% 0.20/0.54 % Rec. Clause-clause subsumption calls : 485
% 0.20/0.54 % Non-unit clause-clause subsumptions : 70
% 0.20/0.54 % Unit Clause-clause subsumption calls : 106
% 0.20/0.54 % Rewrite failures with RHS unbound : 0
% 0.20/0.54 % BW rewrite match attempts : 2
% 0.20/0.54 % BW rewrite match successes : 0
% 0.20/0.54 % Condensation attempts : 0
% 0.20/0.54 % Condensation successes : 0
% 0.20/0.54 % Termbank termtop insertions : 6272
% 0.20/0.54 % Search garbage collected termcells : 606
% 0.20/0.54
% 0.20/0.54 % -------------------------------------------------
% 0.20/0.54 % User time : 0.015 s
% 0.20/0.54 % System time : 0.004 s
% 0.20/0.54 % Total time : 0.019 s
% 0.20/0.54 % Maximum resident set size: 3676 pages
% 0.20/0.54
% 0.20/0.54 % -------------------------------------------------
% 0.20/0.54 % User time : 0.017 s
% 0.20/0.54 % System time : 0.012 s
% 0.20/0.54 % Total time : 0.029 s
% 0.20/0.54 % Maximum resident set size: 4608 pages
% 0.20/0.54 % E exiting
%------------------------------------------------------------------------------