%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO238+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 : n005.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:56 PM UTC 2026
% Result : Theorem 0.30s 0.64s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 61 ( 23 ~; 19 |; 14 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 38 ( 7 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X3,X6,X7,X4] :
( ( divides_points(X4,X3,X7)
& divides_points(X4,X3,X6) )
=> ~ divides_points(X4,X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(a2_defns,axiom,
! [X1,X2] :
( right_apart_point(X1,X2)
<=> left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a2_defns) ).
fof(ax10_basics,axiom,
! [X3,X4] :
~ ( left_apart_point(X3,reverse_line(X4))
| left_apart_point(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).
fof(a8_defns,axiom,
! [X3,X6,X4] :
( divides_points(X4,X3,X6)
<=> ( ( left_apart_point(X6,X4)
& right_apart_point(X3,X4) )
| ( right_apart_point(X6,X4)
& left_apart_point(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a8_defns) ).
fof(c_0_4,negated_conjecture,
~ ! [X3,X6,X7,X4] :
( ( divides_points(X4,X3,X7)
& divides_points(X4,X3,X6) )
=> ~ divides_points(X4,X6,X7) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X21,X22] :
( ( right_apart_point(X21,X22)
| ~ left_apart_point(X21,reverse_line(X22)) )
& ( left_apart_point(X21,reverse_line(X22))
| ~ right_apart_point(X21,X22) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_defns])])]) ).
fof(c_0_6,plain,
! [X16,X17] :
( ~ left_apart_point(X16,reverse_line(X17))
& ~ left_apart_point(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X3,X6,X7,X4] :
( ( divides_points(X4,X3,X7)
& divides_points(X4,X3,X6) )
=> ~ divides_points(X4,X6,X7) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X13,X14,X15] :
( ( divides_points(X15,X13,X14)
| ~ left_apart_point(X14,X15)
| ~ right_apart_point(X13,X15) )
& ( divides_points(X15,X13,X14)
| ~ right_apart_point(X14,X15)
| ~ left_apart_point(X13,X15) )
& ( ~ divides_points(X15,X13,X14)
| right_apart_point(X14,X15)
| left_apart_point(X14,X15) )
& ( ~ divides_points(X15,X13,X14)
| right_apart_point(X14,X15)
| right_apart_point(X13,X15) )
& ( ~ divides_points(X15,X13,X14)
| left_apart_point(X13,X15)
| left_apart_point(X14,X15) )
& ( ~ divides_points(X15,X13,X14)
| left_apart_point(X13,X15)
| right_apart_point(X13,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a8_defns])])])]) ).
cnf(c_0_9,plain,
( ~ right_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( divides_points(esk4_0,esk2_0,esk3_0)
& divides_points(esk4_0,esk1_0,esk3_0)
& divides_points(esk4_0,esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( ~ divides_points(X2,X1,X3)
| right_apart_point(X3,X2)
| right_apart_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
~ right_apart_point(X1,X2),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
divides_points(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
~ divides_points(X1,X2,X3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO238+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n005.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 20 14:18:18 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.56 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.30/0.64 % Version: 3.5.1
% 0.30/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.64 % Starting sh5l with 300s (1) cores
% 0.30/0.64 % new_bool_3 with pid 1213765 completed with status 0
% 0.30/0.64 % Result found by new_bool_3
% 0.30/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.64 % Search class: FGHNF-FFMS21-SFFFFFNN
% 0.30/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.64 % SubtermCWHack with pid 1213768 completed with status 0
% 0.30/0.64 % Result found by SubtermCWHack
% 0.30/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.64 % Search class: FGHNF-FFMS21-SFFFFFNN
% 0.30/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.64 % Preprocessing time : 0.002 s
% 0.30/0.64
% 0.30/0.64 % Proof found!
% 0.30/0.64 % SZS status Theorem
% 0.30/0.64 % SZS output start CNFRefutation
% See solution above
% 0.30/0.64 % Parsed axioms : 37
% 0.30/0.64 % Removed by relevancy pruning/SinE : 25
% 0.30/0.64 % Initial clauses : 27
% 0.30/0.64 % Removed in clause preprocessing : 0
% 0.30/0.64 % Initial clauses in saturation : 27
% 0.30/0.64 % Processed clauses : 21
% 0.30/0.64 % ...of these trivial : 0
% 0.30/0.64 % ...subsumed : 6
% 0.30/0.64 % ...remaining for further processing : 15
% 0.30/0.64 % Other redundant clauses eliminated : 0
% 0.30/0.64 % Clauses deleted for lack of memory : 0
% 0.30/0.64 % Backward-subsumed : 5
% 0.30/0.64 % Backward-rewritten : 0
% 0.30/0.64 % Generated clauses : 4
% 0.30/0.64 % ...of the previous two non-redundant : 1
% 0.30/0.64 % ...aggressively subsumed : 0
% 0.30/0.64 % Contextual simplify-reflections : 0
% 0.30/0.64 % Paramodulations : 1
% 0.30/0.64 % Factorizations : 0
% 0.30/0.64 % NegExts : 0
% 0.30/0.64 % Equation resolutions : 0
% 0.30/0.64 % Disequality decompositions : 0
% 0.30/0.64 % Total rewrite steps : 0
% 0.30/0.64 % ...of those cached : 0
% 0.30/0.64 % Propositional unsat checks : 0
% 0.30/0.64 % Propositional check models : 0
% 0.30/0.64 % Propositional check unsatisfiable : 0
% 0.30/0.64 % Propositional clauses : 0
% 0.30/0.64 % Propositional clauses after purity: 0
% 0.30/0.64 % Propositional unsat core size : 0
% 0.30/0.64 % Propositional preprocessing time : 0.000
% 0.30/0.64 % Propositional encoding time : 0.000
% 0.30/0.64 % Propositional solver time : 0.000
% 0.30/0.64 % Success case prop preproc time : 0.000
% 0.30/0.64 % Success case prop encoding time : 0.000
% 0.30/0.64 % Success case prop solver time : 0.000
% 0.30/0.64 % Current number of processed clauses : 7
% 0.30/0.64 % Positive orientable unit clauses : 0
% 0.30/0.64 % Positive unorientable unit clauses: 0
% 0.30/0.64 % Negative unit clauses : 5
% 0.30/0.64 % Non-unit-clauses : 2
% 0.30/0.64 % Current number of unprocessed clauses: 7
% 0.30/0.64 % ...number of literals in the above : 25
% 0.30/0.64 % Current number of archived formulas : 0
% 0.30/0.64 % Current number of archived clauses : 8
% 0.30/0.64 % Clause-clause subsumption calls (NU) : 2
% 0.30/0.64 % Rec. Clause-clause subsumption calls : 2
% 0.30/0.64 % Non-unit clause-clause subsumptions : 0
% 0.30/0.64 % Unit Clause-clause subsumption calls : 5
% 0.30/0.64 % Rewrite failures with RHS unbound : 0
% 0.30/0.64 % BW rewrite match attempts : 1
% 0.30/0.64 % BW rewrite match successes : 0
% 0.30/0.64 % Condensation attempts : 0
% 0.30/0.64 % Condensation successes : 0
% 0.30/0.64 % Termbank termtop insertions : 1727
% 0.30/0.64 % Search garbage collected termcells : 457
% 0.30/0.64
% 0.30/0.64 % -------------------------------------------------
% 0.30/0.64 % User time : 0.005 s
% 0.30/0.64 % System time : 0.006 s
% 0.30/0.64 % Total time : 0.011 s
% 0.30/0.64 % Maximum resident set size: 3632 pages
% 0.30/0.64
% 0.30/0.64 % -------------------------------------------------
% 0.30/0.64 % User time : 0.010 s
% 0.30/0.64 % System time : 0.010 s
% 0.30/0.64 % Total time : 0.020 s
% 0.30/0.64 % Maximum resident set size: 4864 pages
% 0.30/0.64 % E exiting
%------------------------------------------------------------------------------