%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO025-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:26:55 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 22 unt; 6 nHn; 38 RR)
% Number of literals : 83 ( 11 equ; 40 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(outer_five_segment,axiom,
( ~ between(X3,X4,X6)
| ~ between(X1,X2,X5)
| ~ equidistant(X2,X7,X4,X8)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X5,X7,X6,X8)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).
cnf(d4_5,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_5) ).
cnf(v1_between_u1_and_w1,hypothesis,
between(u1,v1,w1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1_between_u1_and_w1) ).
cnf(d2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2) ).
cnf(u_to_v_equals_u1_to_v1,hypothesis,
equidistant(u,v,u1,v1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_v_equals_u1_to_v1) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).
cnf(v_to_w_equals_v1_to_w1,hypothesis,
equidistant(v,w,v1,w1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_to_w_equals_v1_to_w1) ).
cnf(d4_2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_2) ).
cnf(d7,axiom,
equidistant(X1,X1,X2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7) ).
cnf(prove_equal_sums,negated_conjecture,
~ equidistant(u,w,u1,w1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equal_sums) ).
cnf(identity_for_equidistance,axiom,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
cnf(c_0_11,plain,
( ~ between(X3,X4,X6)
| ~ between(X1,X2,X5)
| ~ equidistant(X2,X7,X4,X8)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X5,X7,X6,X8)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[outer_five_segment]) ).
cnf(c_0_12,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[d4_5]) ).
cnf(c_0_13,plain,
( ~ between(X3,X4,X6)
| ~ between(X1,X2,X5)
| ~ equidistant(X2,X7,X4,X8)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X5,X7,X6,X8)
| X1 = X2 ),
c_0_11 ).
cnf(c_0_14,hypothesis,
between(u1,v1,w1),
v1_between_u1_and_w1 ).
cnf(c_0_15,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[d2]) ).
cnf(c_0_16,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
c_0_12 ).
cnf(c_0_17,hypothesis,
equidistant(u,v,u1,v1),
u_to_v_equals_u1_to_v1 ).
cnf(c_0_18,hypothesis,
( ~ equidistant(X1,X4,u1,X5)
| ~ equidistant(X2,X4,v1,X5)
| ~ equidistant(X1,X2,u1,v1)
| ~ equidistant(X2,X3,v1,w1)
| ~ between(X1,X2,X3)
| equidistant(X3,X4,w1,X5)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_20,hypothesis,
equidistant(v,w,v1,w1),
v_to_w_equals_v1_to_w1 ).
cnf(c_0_21,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
c_0_15 ).
cnf(c_0_22,hypothesis,
equidistant(v1,u1,v,u),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[d4_2]) ).
cnf(c_0_24,hypothesis,
( ~ equidistant(u,X1,u1,X2)
| ~ equidistant(v,X1,v1,X2)
| equidistant(w,X1,w1,X2)
| v = u ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_17])]) ).
cnf(c_0_25,hypothesis,
equidistant(v,u,v1,u1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
equidistant(X1,X1,X2,X2),
d7 ).
cnf(c_0_27,negated_conjecture,
~ equidistant(u,w,u1,w1),
inference(fof_simplification,[status(thm)],[prove_equal_sums]) ).
cnf(c_0_28,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X1,X4,X3) ),
c_0_23 ).
cnf(c_0_29,hypothesis,
( equidistant(w,u,w1,u1)
| v = u ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
~ equidistant(u,w,u1,w1),
c_0_27 ).
cnf(c_0_31,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_32,hypothesis,
equidistant(u1,v1,u,v),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_33,hypothesis,
v = u,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_31 ).
cnf(c_0_35,hypothesis,
equidistant(u1,v1,u,u),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,hypothesis,
equidistant(v1,w1,v,w),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_37,hypothesis,
v1 = u1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,hypothesis,
equidistant(u1,w1,u,w),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_33]),c_0_37]) ).
cnf(c_0_39,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_38]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO025-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 08:31:08 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.48 % Version: 3.5.1
% 0.13/0.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3817950 completed with status 0
% 0.13/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.48 % No SInE strategy applied
% 0.13/0.48 % Search class: FGUSM-FFMS33-SFFFFFNN
% 0.13/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.13/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3817958 completed with status 0
% 0.13/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.48 % No SInE strategy applied
% 0.13/0.48 % Search class: FGUSM-FFMS33-SFFFFFNN
% 0.13/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.13/0.48 % Preprocessing time : 0.002 s
% 0.13/0.48 % Presaturation interreduction done
% 0.13/0.48
% 0.13/0.48 % Proof found!
% 0.13/0.48 % SZS status Unsatisfiable
% 0.13/0.48 % SZS output start CNFRefutation
% See solution above
% 0.13/0.49 % Parsed axioms : 41
% 0.13/0.49 % Removed by relevancy pruning/SinE : 0
% 0.13/0.49 % Initial clauses : 41
% 0.13/0.49 % Removed in clause preprocessing : 1
% 0.13/0.49 % Initial clauses in saturation : 40
% 0.13/0.49 % Processed clauses : 520
% 0.13/0.49 % ...of these trivial : 182
% 0.13/0.49 % ...subsumed : 13
% 0.13/0.49 % ...remaining for further processing : 325
% 0.13/0.49 % Other redundant clauses eliminated : 2
% 0.13/0.49 % Clauses deleted for lack of memory : 0
% 0.13/0.49 % Backward-subsumed : 0
% 0.13/0.49 % Backward-rewritten : 172
% 0.13/0.49 % Generated clauses : 3180
% 0.13/0.49 % ...of the previous two non-redundant : 2395
% 0.13/0.49 % ...aggressively subsumed : 0
% 0.13/0.49 % Contextual simplify-reflections : 0
% 0.13/0.49 % Paramodulations : 3178
% 0.13/0.49 % Factorizations : 0
% 0.13/0.49 % NegExts : 0
% 0.13/0.49 % Equation resolutions : 2
% 0.13/0.49 % Disequality decompositions : 0
% 0.13/0.49 % Total rewrite steps : 1461
% 0.13/0.49 % ...of those cached : 1292
% 0.13/0.49 % Propositional unsat checks : 0
% 0.13/0.49 % Propositional check models : 0
% 0.13/0.49 % Propositional check unsatisfiable : 0
% 0.13/0.49 % Propositional clauses : 0
% 0.13/0.49 % Propositional clauses after purity: 0
% 0.13/0.49 % Propositional unsat core size : 0
% 0.13/0.49 % Propositional preprocessing time : 0.000
% 0.13/0.49 % Propositional encoding time : 0.000
% 0.13/0.49 % Propositional solver time : 0.000
% 0.13/0.49 % Success case prop preproc time : 0.000
% 0.13/0.49 % Success case prop encoding time : 0.000
% 0.13/0.49 % Success case prop solver time : 0.000
% 0.13/0.49 % Current number of processed clauses : 116
% 0.13/0.49 % Positive orientable unit clauses : 51
% 0.13/0.49 % Positive unorientable unit clauses: 0
% 0.13/0.49 % Negative unit clauses : 4
% 0.13/0.49 % Non-unit-clauses : 61
% 0.13/0.49 % Current number of unprocessed clauses: 1936
% 0.13/0.49 % ...number of literals in the above : 3236
% 0.13/0.49 % Current number of archived formulas : 0
% 0.13/0.49 % Current number of archived clauses : 208
% 0.13/0.49 % Clause-clause subsumption calls (NU) : 8350
% 0.13/0.49 % Rec. Clause-clause subsumption calls : 6374
% 0.13/0.49 % Non-unit clause-clause subsumptions : 13
% 0.13/0.49 % Unit Clause-clause subsumption calls : 1163
% 0.13/0.49 % Rewrite failures with RHS unbound : 0
% 0.13/0.49 % BW rewrite match attempts : 972
% 0.13/0.49 % BW rewrite match successes : 4
% 0.13/0.49 % Condensation attempts : 0
% 0.13/0.49 % Condensation successes : 0
% 0.13/0.49 % Termbank termtop insertions : 38899
% 0.13/0.49 % Search garbage collected termcells : 92
% 0.13/0.49
% 0.13/0.49 % -------------------------------------------------
% 0.13/0.49 % User time : 0.050 s
% 0.13/0.49 % System time : 0.008 s
% 0.13/0.49 % Total time : 0.058 s
% 0.13/0.49 % Maximum resident set size: 3664 pages
% 0.13/0.49
% 0.13/0.49 % -------------------------------------------------
% 0.13/0.49 % User time : 0.189 s
% 0.13/0.49 % System time : 0.029 s
% 0.13/0.49 % Total time : 0.218 s
% 0.13/0.49 % Maximum resident set size: 4608 pages
% 0.13/0.49 % E exiting
%------------------------------------------------------------------------------