%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO261+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:02 PM UTC 2026
% Result : Theorem 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 59 ( 22 ~; 19 |; 13 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 40 ( 2 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a1_defns,axiom,
! [X1,X2] :
( unequally_directed_opposite_lines(X1,X2)
<=> unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a1_defns) ).
fof(a7_defns,axiom,
! [X4,X5] :
( convergent_lines(X4,X5)
<=> ( unequally_directed_opposite_lines(X4,X5)
& unequally_directed_lines(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a7_defns) ).
fof(con,conjecture,
! [X4,X5,X3,X6,X7] :
( ( incident_point_and_line(X6,X5)
& convergent_lines(X4,X5)
& between_on_line(X4,X3,X6,X7) )
=> divides_points(X5,X3,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(ax9_basics,axiom,
! [X4,X5] :
( ( unequally_directed_lines(X4,reverse_line(X5))
& unequally_directed_lines(X4,X5) )
=> ( left_convergent_lines(X4,reverse_line(X5))
| left_convergent_lines(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).
fof(ax11_basics,axiom,
! [X4,X5] :
~ ( left_convergent_lines(X4,reverse_line(X5))
| left_convergent_lines(X4,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(c_0_5,plain,
! [X49,X50] :
( ( unequally_directed_opposite_lines(X49,X50)
| ~ unequally_directed_lines(X49,reverse_line(X50)) )
& ( unequally_directed_lines(X49,reverse_line(X50))
| ~ unequally_directed_opposite_lines(X49,X50) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).
fof(c_0_6,plain,
! [X20,X21] :
( ( convergent_lines(X20,X21)
| ~ unequally_directed_opposite_lines(X20,X21)
| ~ unequally_directed_lines(X20,X21) )
& ( ~ convergent_lines(X20,X21)
| unequally_directed_opposite_lines(X20,X21) )
& ( ~ convergent_lines(X20,X21)
| unequally_directed_lines(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a7_defns])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5,X3,X6,X7] :
( ( incident_point_and_line(X6,X5)
& convergent_lines(X4,X5)
& between_on_line(X4,X3,X6,X7) )
=> divides_points(X5,X3,X7) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X61,X62] :
( left_convergent_lines(X61,reverse_line(X62))
| left_convergent_lines(X61,X62)
| ~ unequally_directed_lines(X61,reverse_line(X62))
| ~ unequally_directed_lines(X61,X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])])]) ).
fof(c_0_9,plain,
! [X63,X64] :
( ~ left_convergent_lines(X63,reverse_line(X64))
& ~ left_convergent_lines(X63,X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])])]) ).
cnf(c_0_10,plain,
( ~ unequally_directed_opposite_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ convergent_lines(X1,X2)
| unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,negated_conjecture,
( ~ divides_points(esk2_0,esk3_0,esk5_0)
& incident_point_and_line(esk4_0,esk2_0)
& convergent_lines(esk1_0,esk2_0)
& between_on_line(esk1_0,esk3_0,esk4_0,esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,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_8]) ).
cnf(c_0_14,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ convergent_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ convergent_lines(X1,X2)
| unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
unequally_directed_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO261+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n008.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 20 14:53:39 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % new_bool_3 with pid 3102285 completed with status 0
% 0.12/0.43 % Result found by new_bool_3
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGHNF-FFMS21-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 3102288 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGHNF-FFMS21-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % Preprocessing time : 0.002 s
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Theorem
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.43 % Parsed axioms : 37
% 0.12/0.43 % Removed by relevancy pruning/SinE : 13
% 0.12/0.43 % Initial clauses : 54
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 54
% 0.12/0.43 % Processed clauses : 88
% 0.12/0.43 % ...of these trivial : 0
% 0.12/0.43 % ...subsumed : 27
% 0.12/0.43 % ...remaining for further processing : 61
% 0.12/0.43 % Other redundant clauses eliminated : 0
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 8
% 0.12/0.43 % Backward-rewritten : 0
% 0.12/0.43 % Generated clauses : 207
% 0.12/0.43 % ...of the previous two non-redundant : 147
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 179
% 0.12/0.43 % Factorizations : 28
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 0
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 37
% 0.12/0.43 % ...of those cached : 25
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 53
% 0.12/0.43 % Positive orientable unit clauses : 9
% 0.12/0.43 % Positive unorientable unit clauses: 0
% 0.12/0.43 % Negative unit clauses : 8
% 0.12/0.43 % Non-unit-clauses : 36
% 0.12/0.43 % Current number of unprocessed clauses: 107
% 0.12/0.43 % ...number of literals in the above : 419
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 8
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 548
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 442
% 0.12/0.43 % Non-unit clause-clause subsumptions : 18
% 0.12/0.43 % Unit Clause-clause subsumption calls : 73
% 0.12/0.43 % Rewrite failures with RHS unbound : 0
% 0.12/0.43 % BW rewrite match attempts : 2
% 0.12/0.43 % BW rewrite match successes : 0
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 5091
% 0.12/0.43 % Search garbage collected termcells : 664
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.008 s
% 0.12/0.43 % System time : 0.004 s
% 0.12/0.43 % Total time : 0.011 s
% 0.12/0.43 % Maximum resident set size: 3684 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.010 s
% 0.12/0.43 % System time : 0.008 s
% 0.12/0.43 % Total time : 0.018 s
% 0.12/0.43 % Maximum resident set size: 4608 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------