%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO233+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 : n001.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:55 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 61 ( 24 ~; 29 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2] : ~ unequally_directed_lines(reverse_line(reverse_line(X2)),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag5) ).
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(oag7,axiom,
! [X2,X3,X6] :
( ( unequally_directed_lines(X2,reverse_line(X3))
& unequally_directed_lines(X2,X3) )
=> ( ( unequally_directed_lines(X3,reverse_line(X6))
& unequally_directed_lines(X3,X6) )
| ( unequally_directed_lines(X2,reverse_line(X6))
& unequally_directed_lines(X2,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag7) ).
fof(c_0_4,negated_conjecture,
~ ! [X2] : ~ unequally_directed_lines(reverse_line(reverse_line(X2)),X2),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,negated_conjecture,
~ ! [X2] : ~ unequally_directed_lines(reverse_line(reverse_line(X2)),X2),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
fof(c_0_7,plain,
! [X9,X10,X11] :
( unequally_directed_lines(X10,X11)
| unequally_directed_lines(X9,X11)
| ~ unequally_directed_lines(X9,X10) ),
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(reverse_line(reverse_line(esk1_0)),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X8] : ~ unequally_directed_lines(X8,X8),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
cnf(c_0_10,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_11,negated_conjecture,
unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X12,X13,X14] :
( ( ~ unequally_directed_lines(X12,reverse_line(X13))
| ~ unequally_directed_lines(X12,X13)
| unequally_directed_lines(X12,reverse_line(X14))
| unequally_directed_lines(X13,reverse_line(X14)) )
& ( ~ unequally_directed_lines(X12,reverse_line(X13))
| ~ unequally_directed_lines(X12,X13)
| unequally_directed_lines(X12,reverse_line(X14))
| unequally_directed_lines(X13,X14) )
& ( ~ unequally_directed_lines(X12,reverse_line(X13))
| ~ unequally_directed_lines(X12,X13)
| unequally_directed_lines(X12,X14)
| unequally_directed_lines(X13,reverse_line(X14)) )
& ( ~ unequally_directed_lines(X12,reverse_line(X13))
| ~ unequally_directed_lines(X12,X13)
| unequally_directed_lines(X12,X14)
| unequally_directed_lines(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag7])])])]) ).
cnf(c_0_13,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ unequally_directed_lines(X3,reverse_line(X1))
| ~ unequally_directed_lines(X3,X1)
| unequally_directed_lines(X3,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ unequally_directed_lines(esk1_0,reverse_line(esk1_0))
| unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(reverse_line(esk1_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( ~ unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X2)
| unequally_directed_lines(X2,reverse_line(X1))
| unequally_directed_lines(esk1_0,reverse_line(X2))
| unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(X1))
| unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19]) ).
cnf(c_0_21,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(reverse_line(reverse_line(esk1_0)))),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(reverse_line(reverse_line(esk1_0)),reverse_line(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO233+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.38 % Computer : n001.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:14:12 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_3 with pid 807836 completed with status 0
% 0.10/0.45 % Result found by new_bool_3
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 807839 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 32
% 0.10/0.45 % Removed by relevancy pruning/SinE : 28
% 0.10/0.45 % Initial clauses : 7
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 7
% 0.10/0.45 % Processed clauses : 48
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 27
% 0.10/0.45 % ...remaining for further processing : 21
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 1
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 153
% 0.10/0.45 % ...of the previous two non-redundant : 126
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 119
% 0.10/0.45 % Factorizations : 34
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 25
% 0.10/0.45 % ...of those cached : 22
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 20
% 0.10/0.45 % Positive orientable unit clauses : 3
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 2
% 0.10/0.45 % Non-unit-clauses : 15
% 0.10/0.45 % Current number of unprocessed clauses: 84
% 0.10/0.45 % ...number of literals in the above : 405
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 1
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 193
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 152
% 0.10/0.45 % Non-unit clause-clause subsumptions : 26
% 0.10/0.45 % Unit Clause-clause subsumption calls : 5
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 1
% 0.10/0.45 % BW rewrite match successes : 0
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 2588
% 0.10/0.45 % Search garbage collected termcells : 290
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.006 s
% 0.10/0.45 % System time : 0.003 s
% 0.10/0.45 % Total time : 0.009 s
% 0.10/0.45 % Maximum resident set size: 3676 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.007 s
% 0.10/0.45 % System time : 0.008 s
% 0.10/0.45 % Total time : 0.016 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------