%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO266+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 : n014.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:03 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 7 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 37 ~; 37 |; 5 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 54 ( 2 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X4,X5] :
( unequally_directed_opposite_lines(X4,X5)
<=> unequally_directed_opposite_lines(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
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(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(ax8_basics,axiom,
! [X4,X5] :
( unequally_directed_lines(X4,reverse_line(X5))
| unequally_directed_lines(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).
fof(a4_defns,axiom,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a4_defns) ).
fof(ax6_basics,axiom,
! [X4,X5,X8] :
( unequally_directed_lines(X4,X5)
=> ( unequally_directed_lines(X5,X8)
| unequally_directed_lines(X4,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax6_basics) ).
fof(ax5_basics,axiom,
! [X4] : equally_directed_lines(X4,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( unequally_directed_opposite_lines(X4,X5)
<=> unequally_directed_opposite_lines(X5,X4) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,negated_conjecture,
( ( unequally_directed_opposite_lines(esk2_0,esk1_0)
| unequally_directed_opposite_lines(esk1_0,esk2_0) )
& ( ~ unequally_directed_opposite_lines(esk2_0,esk1_0)
| ~ unequally_directed_opposite_lines(esk1_0,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_10,plain,
! [X9,X10] :
( ( unequally_directed_opposite_lines(X9,X10)
| ~ unequally_directed_lines(X9,reverse_line(X10)) )
& ( unequally_directed_lines(X9,reverse_line(X10))
| ~ unequally_directed_opposite_lines(X9,X10) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ unequally_directed_opposite_lines(esk2_0,esk1_0)
| ~ unequally_directed_opposite_lines(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X50,X51] :
( left_convergent_lines(X50,reverse_line(X51))
| left_convergent_lines(X50,X51)
| ~ unequally_directed_lines(X50,reverse_line(X51))
| ~ unequally_directed_lines(X50,X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])])]) ).
fof(c_0_14,plain,
! [X54,X55] :
( ~ left_convergent_lines(X54,reverse_line(X55))
& ~ left_convergent_lines(X54,X55) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])])]) ).
cnf(c_0_15,plain,
( ~ unequally_directed_opposite_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( unequally_directed_opposite_lines(esk2_0,esk1_0)
| unequally_directed_opposite_lines(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ unequally_directed_opposite_lines(esk1_0,esk2_0)
| ~ unequally_directed_lines(esk2_0,reverse_line(esk1_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_18,plain,
! [X48,X49] :
( unequally_directed_lines(X48,reverse_line(X49))
| unequally_directed_lines(X48,X49) ),
inference(variable_rename,[status(thm)],[ax8_basics]) ).
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_13]) ).
cnf(c_0_20,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( unequally_directed_opposite_lines(esk1_0,esk2_0)
| unequally_directed_lines(esk2_0,reverse_line(esk1_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| ~ unequally_directed_lines(esk2_0,reverse_line(esk1_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_23,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4_defns]) ).
cnf(c_0_25,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_26,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| unequally_directed_lines(esk2_0,reverse_line(esk1_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
fof(c_0_27,plain,
! [X42,X43,X44] :
( unequally_directed_lines(X43,X44)
| unequally_directed_lines(X42,X44)
| ~ unequally_directed_lines(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6_basics])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| unequally_directed_lines(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,plain,
! [X15,X16] :
( ( equally_directed_lines(X15,X16)
| unequally_directed_lines(X15,X16) )
& ( ~ unequally_directed_lines(X15,X16)
| ~ equally_directed_lines(X15,X16) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_30,plain,
! [X41] : equally_directed_lines(X41,X41),
inference(variable_rename,[status(thm)],[ax5_basics]) ).
cnf(c_0_31,negated_conjecture,
( ~ unequally_directed_lines(esk2_0,esk1_0)
| unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( ~ unequally_directed_lines(X1,X2)
| unequally_directed_lines(X2,X3)
| unequally_directed_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( unequally_directed_lines(esk2_0,esk1_0)
| unequally_directed_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_34,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
equally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( ~ unequally_directed_lines(esk2_0,esk1_0)
| ~ unequally_directed_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(esk2_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_32]) ).
cnf(c_0_38,plain,
~ unequally_directed_lines(X1,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ unequally_directed_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_37]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO266+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 14:56:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1815205 completed with status 0
% 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHNS-FFMF21-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1815213 completed with status 0
% 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHNS-FFMF21-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.002 s
% 0.13/0.42 % Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 37
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 68
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 68
% 0.13/0.42 % Processed clauses : 119
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 20
% 0.13/0.42 % ...remaining for further processing : 98
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 6
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 43
% 0.13/0.42 % ...of the previous two non-redundant : 32
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 1
% 0.13/0.42 % Paramodulations : 42
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 0
% 0.13/0.42 % ...of those cached : 0
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 48
% 0.13/0.43 % Positive orientable unit clauses : 4
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 15
% 0.13/0.43 % Non-unit-clauses : 29
% 0.13/0.43 % Current number of unprocessed clauses: 24
% 0.13/0.43 % ...number of literals in the above : 61
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 50
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 385
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 303
% 0.13/0.43 % Non-unit clause-clause subsumptions : 6
% 0.13/0.43 % Unit Clause-clause subsumption calls : 156
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 0
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 4921
% 0.13/0.43 % Search garbage collected termcells : 737
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.011 s
% 0.13/0.43 % System time : 0.004 s
% 0.13/0.43 % Total time : 0.015 s
% 0.13/0.43 % Maximum resident set size: 3632 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.033 s
% 0.13/0.43 % System time : 0.013 s
% 0.13/0.43 % Total time : 0.046 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------