%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO262+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 68 ( 22 ~; 19 |; 22 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a1_defns,axiom,
! [X1,X2] :
( unequally_directed_opposite_lines(X1,X2)
<=> unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GEO009+0.ax',a7_defns) ).
fof(con,conjecture,
! [X4,X5,X8,X3,X6,X7] :
( ( incident_point_and_line(X6,X8)
& convergent_lines(X5,X8)
& convergent_lines(X4,X8)
& incident_point_and_line(X6,X5)
& convergent_lines(X4,X5)
& between_on_line(X4,X3,X6,X7) )
=> between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X3)),X6,intersection_point(X5,parallel_through_point(X8,X7))) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(c_0_5,plain,
! [X64,X65] :
( ( unequally_directed_opposite_lines(X64,X65)
| ~ unequally_directed_lines(X64,reverse_line(X65)) )
& ( unequally_directed_lines(X64,reverse_line(X65))
| ~ unequally_directed_opposite_lines(X64,X65) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).
fof(c_0_6,plain,
! [X32,X33] :
( ( convergent_lines(X32,X33)
| ~ unequally_directed_opposite_lines(X32,X33)
| ~ unequally_directed_lines(X32,X33) )
& ( ~ convergent_lines(X32,X33)
| unequally_directed_opposite_lines(X32,X33) )
& ( ~ convergent_lines(X32,X33)
| unequally_directed_lines(X32,X33) ) ),
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,X8,X3,X6,X7] :
( ( incident_point_and_line(X6,X8)
& convergent_lines(X5,X8)
& convergent_lines(X4,X8)
& incident_point_and_line(X6,X5)
& convergent_lines(X4,X5)
& between_on_line(X4,X3,X6,X7) )
=> between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X3)),X6,intersection_point(X5,parallel_through_point(X8,X7))) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X70,X71] :
( left_convergent_lines(X70,reverse_line(X71))
| left_convergent_lines(X70,X71)
| ~ unequally_directed_lines(X70,reverse_line(X71))
| ~ unequally_directed_lines(X70,X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])])]) ).
fof(c_0_9,plain,
! [X72,X73] :
( ~ left_convergent_lines(X72,reverse_line(X73))
& ~ left_convergent_lines(X72,X73) ),
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,
( ~ between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),esk5_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk6_0)))
& incident_point_and_line(esk5_0,esk3_0)
& convergent_lines(esk2_0,esk3_0)
& convergent_lines(esk1_0,esk3_0)
& incident_point_and_line(esk5_0,esk2_0)
& convergent_lines(esk1_0,esk2_0)
& between_on_line(esk1_0,esk4_0,esk5_0,esk6_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(esk2_0,esk3_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(esk2_0,reverse_line(esk3_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
unequally_directed_lines(esk2_0,esk3_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.03 % Problem : GEO262+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 14:47:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.45 Running first-order theorem proving
% 0.11/0.45 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.21/0.54 % Version: 3.5.1
% 0.21/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 % Starting sh5l with 300s (1) cores
% 0.21/0.54 % new_bool_1 with pid 93697 completed with status 0
% 0.21/0.54 % Result found by new_bool_1
% 0.21/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 % Search class: FGHNS-FFMM21-SFFFFFNN
% 0.21/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.54 % SubtermCWHack with pid 93703 completed with status 0
% 0.21/0.54 % Result found by SubtermCWHack
% 0.21/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 % Search class: FGHNS-FFMM21-SFFFFFNN
% 0.21/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.54 % Preprocessing time : 0.003 s
% 0.21/0.54
% 0.21/0.54 % Proof found!
% 0.21/0.54 % SZS status Theorem
% 0.21/0.54 % SZS output start CNFRefutation
% See solution above
% 0.21/0.54 % Parsed axioms : 37
% 0.21/0.54 % Removed by relevancy pruning/SinE : 8
% 0.21/0.54 % Initial clauses : 58
% 0.21/0.54 % Removed in clause preprocessing : 0
% 0.21/0.54 % Initial clauses in saturation : 58
% 0.21/0.54 % Processed clauses : 110
% 0.21/0.54 % ...of these trivial : 0
% 0.21/0.54 % ...subsumed : 21
% 0.21/0.54 % ...remaining for further processing : 89
% 0.21/0.54 % Other redundant clauses eliminated : 0
% 0.21/0.54 % Clauses deleted for lack of memory : 0
% 0.21/0.54 % Backward-subsumed : 6
% 0.21/0.54 % Backward-rewritten : 0
% 0.21/0.54 % Generated clauses : 263
% 0.21/0.54 % ...of the previous two non-redundant : 197
% 0.21/0.54 % ...aggressively subsumed : 0
% 0.21/0.54 % Contextual simplify-reflections : 0
% 0.21/0.54 % Paramodulations : 245
% 0.21/0.54 % Factorizations : 18
% 0.21/0.54 % NegExts : 0
% 0.21/0.54 % Equation resolutions : 0
% 0.21/0.54 % Disequality decompositions : 0
% 0.21/0.54 % Total rewrite steps : 40
% 0.21/0.54 % ...of those cached : 28
% 0.21/0.54 % Propositional unsat checks : 0
% 0.21/0.54 % Propositional check models : 0
% 0.21/0.54 % Propositional check unsatisfiable : 0
% 0.21/0.54 % Propositional clauses : 0
% 0.21/0.54 % Propositional clauses after purity: 0
% 0.21/0.54 % Propositional unsat core size : 0
% 0.21/0.54 % Propositional preprocessing time : 0.000
% 0.21/0.54 % Propositional encoding time : 0.000
% 0.21/0.54 % Propositional solver time : 0.000
% 0.21/0.54 % Success case prop preproc time : 0.000
% 0.21/0.54 % Success case prop encoding time : 0.000
% 0.21/0.54 % Success case prop solver time : 0.000
% 0.21/0.54 % Current number of processed clauses : 83
% 0.21/0.54 % Positive orientable unit clauses : 25
% 0.21/0.54 % Positive unorientable unit clauses: 0
% 0.21/0.54 % Negative unit clauses : 8
% 0.21/0.54 % Non-unit-clauses : 50
% 0.21/0.54 % Current number of unprocessed clauses: 139
% 0.21/0.54 % ...number of literals in the above : 492
% 0.21/0.54 % Current number of archived formulas : 0
% 0.21/0.54 % Current number of archived clauses : 6
% 0.21/0.54 % Clause-clause subsumption calls (NU) : 866
% 0.21/0.54 % Rec. Clause-clause subsumption calls : 633
% 0.21/0.54 % Non-unit clause-clause subsumptions : 17
% 0.21/0.54 % Unit Clause-clause subsumption calls : 100
% 0.21/0.54 % Rewrite failures with RHS unbound : 0
% 0.21/0.54 % BW rewrite match attempts : 4
% 0.21/0.54 % BW rewrite match successes : 0
% 0.21/0.54 % Condensation attempts : 0
% 0.21/0.54 % Condensation successes : 0
% 0.21/0.54 % Termbank termtop insertions : 6138
% 0.21/0.54 % Search garbage collected termcells : 715
% 0.21/0.54
% 0.21/0.54 % -------------------------------------------------
% 0.21/0.54 % User time : 0.019 s
% 0.21/0.54 % System time : 0.006 s
% 0.21/0.54 % Total time : 0.025 s
% 0.21/0.54 % Maximum resident set size: 3876 pages
% 0.21/0.54
% 0.21/0.54 % -------------------------------------------------
% 0.21/0.54 % User time : 0.023 s
% 0.21/0.54 % System time : 0.012 s
% 0.21/0.54 % Total time : 0.035 s
% 0.21/0.54 % Maximum resident set size: 4864 pages
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------