%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO068-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:27:05 PM UTC 2026
% Result : Unsatisfiable 0.22s 6.06s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 51 ( 22 unt; 5 nHn; 51 RR)
% Number of literals : 102 ( 0 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d4_2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_2) ).
cnf(t10_4,axiom,
( ~ colinear(X1,X2,X3)
| colinear(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_4) ).
cnf(b11,axiom,
( ~ between(X1,X2,X5)
| ~ equidistant(X1,X5,X3,X6)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| between(X3,X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b11) ).
cnf(u_to_w_equals_u1_to_w1,hypothesis,
equidistant(u,w,u1,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_to_w_equals_u1_to_w1) ).
cnf(prove_u1v1w1_colinear,negated_conjecture,
~ colinear(u1,v1,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_u1v1w1_colinear) ).
cnf(colinearity2,axiom,
( ~ between(X1,X2,X3)
| colinear(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-1.ax',colinearity2) ).
cnf(colinearity4,axiom,
( ~ colinear(X1,X2,X3)
| between(X3,X1,X2)
| between(X2,X3,X1)
| between(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-1.ax',colinearity4) ).
cnf(uvw_colinear,hypothesis,
colinear(u,v,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uvw_colinear) ).
cnf(u_to_v_equals_u1_to_v1,hypothesis,
equidistant(u,v,u1,v1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_to_v_equals_u1_to_v1) ).
cnf(colinearity1,axiom,
( ~ between(X1,X2,X3)
| colinear(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-1.ax',colinearity1) ).
cnf(v_to_w_equals_v1_to_w1,hypothesis,
equidistant(v,w,v1,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_to_w_equals_v1_to_w1) ).
cnf(t1,axiom,
( ~ between(X1,X2,X3)
| between(X3,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1) ).
cnf(c2_3,axiom,
( ~ between(X1,X2,X3)
| colinear(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c2_3) ).
cnf(c_0_13,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[d4_2]) ).
cnf(c_0_14,plain,
( ~ colinear(X1,X2,X3)
| colinear(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[t10_4]) ).
cnf(c_0_15,plain,
( ~ between(X1,X2,X5)
| ~ equidistant(X1,X5,X3,X6)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| between(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[b11]) ).
cnf(c_0_16,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X1,X4,X3) ),
c_0_13 ).
cnf(c_0_17,hypothesis,
equidistant(u,w,u1,w1),
u_to_w_equals_u1_to_w1 ).
cnf(c_0_18,negated_conjecture,
~ colinear(u1,v1,w1),
inference(fof_simplification,[status(thm)],[prove_u1v1w1_colinear]) ).
cnf(c_0_19,plain,
( ~ between(X1,X2,X3)
| colinear(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[colinearity2]) ).
cnf(c_0_20,plain,
( ~ colinear(X1,X2,X3)
| between(X3,X1,X2)
| between(X2,X3,X1)
| between(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[colinearity4]) ).
cnf(c_0_21,plain,
( ~ colinear(X1,X2,X3)
| colinear(X3,X1,X2) ),
c_0_14 ).
cnf(c_0_22,hypothesis,
colinear(u,v,w),
uvw_colinear ).
cnf(c_0_23,plain,
( ~ between(X1,X2,X5)
| ~ equidistant(X1,X5,X3,X6)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| between(X3,X4,X6) ),
c_0_15 ).
cnf(c_0_24,hypothesis,
equidistant(w,u,w1,u1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,hypothesis,
equidistant(u,v,u1,v1),
u_to_v_equals_u1_to_v1 ).
cnf(c_0_26,negated_conjecture,
~ colinear(u1,v1,w1),
c_0_18 ).
cnf(c_0_27,plain,
( ~ between(X1,X2,X3)
| colinear(X3,X1,X2) ),
c_0_19 ).
cnf(c_0_28,plain,
( ~ between(X1,X2,X3)
| colinear(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[colinearity1]) ).
cnf(c_0_29,plain,
( ~ colinear(X1,X2,X3)
| between(X3,X1,X2)
| between(X2,X3,X1)
| between(X1,X2,X3) ),
c_0_20 ).
cnf(c_0_30,hypothesis,
colinear(w,u,v),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,hypothesis,
( ~ equidistant(X2,w,X1,w1)
| ~ equidistant(X2,u,X1,u1)
| ~ between(X2,w,u)
| between(X1,w1,u1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,hypothesis,
equidistant(v,w,v1,w1),
v_to_w_equals_v1_to_w1 ).
cnf(c_0_33,hypothesis,
equidistant(v,u,v1,u1),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_34,negated_conjecture,
~ between(v1,w1,u1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( ~ between(X1,X2,X3)
| colinear(X1,X2,X3) ),
c_0_28 ).
cnf(c_0_36,hypothesis,
( between(v,w,u)
| between(u,v,w)
| between(w,u,v) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,hypothesis,
~ between(v,w,u),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_38,hypothesis,
( ~ equidistant(X2,v,X1,v1)
| ~ equidistant(X2,w,X1,w1)
| ~ between(X2,v,w)
| between(X1,v1,w1) ),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
~ between(u1,v1,w1),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_40,plain,
( ~ between(X1,X2,X3)
| between(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[t1]) ).
cnf(c_0_41,hypothesis,
( between(w,u,v)
| between(u,v,w) ),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,hypothesis,
~ between(u,v,w),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_17]),c_0_25])]),c_0_39]) ).
cnf(c_0_43,plain,
( ~ between(X1,X2,X3)
| colinear(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[c2_3]) ).
cnf(c_0_44,plain,
( ~ between(X1,X2,X3)
| between(X3,X2,X1) ),
c_0_40 ).
cnf(c_0_45,hypothesis,
between(w,u,v),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ between(X1,X2,X3)
| colinear(X2,X1,X3) ),
c_0_43 ).
cnf(c_0_47,hypothesis,
( ~ equidistant(X2,u,X1,u1)
| ~ equidistant(X2,w,X1,w1)
| ~ between(X2,u,w)
| between(X1,u1,w1) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_48,hypothesis,
between(v,u,w),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ between(v1,u1,w1),
inference(spm,[status(thm)],[c_0_26,c_0_46]) ).
cnf(c_0_50,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_48]),c_0_33])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO068-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.45 % Computer : n017.cluster.edu
% 0.16/5.45 % Model : x86_64 x86_64
% 0.16/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.45 % Memory : 8046.5625MB
% 0.16/5.45 % OS : Linux 6.8.0-71-generic
% 0.16/5.45 % CPULimit : 300
% 0.16/5.45 % WCLimit : 300
% 0.16/5.45 % DateTime : Sun Sep 20 09:25:46 UTC 2026
% 0.16/5.45 % CPUTime :
% 0.16/5.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.53 Running first-order theorem proving
% 0.22/5.53 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.22/6.06 % Version: 3.5.1
% 0.22/6.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/6.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/6.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/6.06 % Starting new_bool_3 with 300s (1) cores
% 0.22/6.06 % Starting new_bool_1 with 300s (1) cores
% 0.22/6.06 % Starting sh5l with 300s (1) cores
% 0.22/6.06 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3915612 completed with status 0
% 0.22/6.06 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/6.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/6.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/6.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/6.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/6.06 % No SInE strategy applied
% 0.22/6.06 % Search class: FGUSM-FFMS33-SFFFFFNN
% 0.22/6.06 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/6.06 % Starting SubtermCWHack with 136s (1) cores
% 0.22/6.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/6.06 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.22/6.06 % Starting new_bool_3 with 136s (1) cores
% 0.22/6.06 % Starting new_bool_1 with 136s (1) cores
% 0.22/6.06 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3915620 completed with status 0
% 0.22/6.06 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/6.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/6.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/6.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/6.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/6.06 % No SInE strategy applied
% 0.22/6.06 % Search class: FGUSM-FFMS33-SFFFFFNN
% 0.22/6.06 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/6.06 % Starting SubtermCWHack with 136s (1) cores
% 0.22/6.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/6.06 % Preprocessing time : 0.004 s
% 0.22/6.06 % Presaturation interreduction done
% 0.22/6.06
% 0.22/6.06 % Proof found!
% 0.22/6.06 % SZS status Unsatisfiable
% 0.22/6.06 % SZS output start CNFRefutation
% See solution above
% 0.22/6.06 % Parsed axioms : 105
% 0.22/6.06 % Removed by relevancy pruning/SinE : 0
% 0.22/6.06 % Initial clauses : 105
% 0.22/6.06 % Removed in clause preprocessing : 3
% 0.22/6.06 % Initial clauses in saturation : 102
% 0.22/6.06 % Processed clauses : 1689
% 0.22/6.06 % ...of these trivial : 84
% 0.22/6.06 % ...subsumed : 828
% 0.22/6.06 % ...remaining for further processing : 777
% 0.22/6.06 % Other redundant clauses eliminated : 6
% 0.22/6.06 % Clauses deleted for lack of memory : 0
% 0.22/6.06 % Backward-subsumed : 13
% 0.22/6.06 % Backward-rewritten : 8
% 0.22/6.06 % Generated clauses : 9788
% 0.22/6.06 % ...of the previous two non-redundant : 8726
% 0.22/6.06 % ...aggressively subsumed : 0
% 0.22/6.06 % Contextual simplify-reflections : 0
% 0.22/6.06 % Paramodulations : 9779
% 0.22/6.06 % Factorizations : 0
% 0.22/6.06 % NegExts : 0
% 0.22/6.06 % Equation resolutions : 6
% 0.22/6.06 % Disequality decompositions : 0
% 0.22/6.06 % Total rewrite steps : 1369
% 0.22/6.06 % ...of those cached : 1155
% 0.22/6.06 % Propositional unsat checks : 0
% 0.22/6.06 % Propositional check models : 0
% 0.22/6.06 % Propositional check unsatisfiable : 0
% 0.22/6.06 % Propositional clauses : 0
% 0.22/6.06 % Propositional clauses after purity: 0
% 0.22/6.06 % Propositional unsat core size : 0
% 0.22/6.06 % Propositional preprocessing time : 0.000
% 0.22/6.06 % Propositional encoding time : 0.000
% 0.22/6.06 % Propositional solver time : 0.000
% 0.22/6.06 % Success case prop preproc time : 0.000
% 0.22/6.06 % Success case prop encoding time : 0.000
% 0.22/6.06 % Success case prop solver time : 0.000
% 0.22/6.06 % Current number of processed clauses : 657
% 0.22/6.06 % Positive orientable unit clauses : 56
% 0.22/6.06 % Positive unorientable unit clauses: 0
% 0.22/6.06 % Negative unit clauses : 27
% 0.22/6.06 % Non-unit-clauses : 574
% 0.22/6.06 % Current number of unprocessed clauses: 7172
% 0.22/6.06 % ...number of literals in the above : 28161
% 0.22/6.06 % Current number of archived formulas : 0
% 0.22/6.06 % Current number of archived clauses : 118
% 0.22/6.06 % Clause-clause subsumption calls (NU) : 167803
% 0.22/6.06 % Rec. Clause-clause subsumption calls : 149150
% 0.22/6.06 % Non-unit clause-clause subsumptions : 751
% 0.22/6.06 % Unit Clause-clause subsumption calls : 762
% 0.22/6.06 % Rewrite failures with RHS unbound : 0
% 0.22/6.06 % BW rewrite match attempts : 661
% 0.22/6.06 % BW rewrite match successes : 8
% 0.22/6.06 % Condensation attempts : 0
% 0.22/6.06 % Condensation successes : 0
% 0.22/6.06 % Termbank termtop insertions : 121760
% 0.22/6.06 % Search garbage collected termcells : 224
% 0.22/6.06
% 0.22/6.06 % -------------------------------------------------
% 0.22/6.06 % User time : 0.449 s
% 0.22/6.06 % System time : 0.013 s
% 0.22/6.06 % Total time : 0.462 s
% 0.22/6.06 % Maximum resident set size: 3712 pages
% 0.22/6.06
% 0.22/6.06 % -------------------------------------------------
% 0.22/6.06 % User time : 2.033 s
% 0.22/6.06 % System time : 0.083 s
% 0.22/6.06 % Total time : 2.116 s
% 0.22/6.06 % Maximum resident set size: 4608 pages
% 0.22/6.06 % E exiting
%------------------------------------------------------------------------------