%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO034-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 : 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:28:52 PM UTC 2026
% Result : Unsatisfiable 2.25s 0.75s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 15 unt; 0 nHn; 25 RR)
% Number of literals : 59 ( 6 equ; 35 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2) ).
cnf(d14,axiom,
( ~ between(X3,X4,X6)
| ~ between(X1,X2,X5)
| ~ equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X7,X4,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d14) ).
cnf(w_to_v_equals_w_to_x,hypothesis,
equidistant(w,v,w,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_to_v_equals_w_to_x) ).
cnf(d1,axiom,
equidistant(X1,X2,X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1) ).
cnf(u_to_v_equals_u_to_x,hypothesis,
equidistant(u,v,u,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_to_v_equals_u_to_x) ).
cnf(identity_for_equidistance,axiom,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_between_u_and_w) ).
cnf(prove_v_is_x,negated_conjecture,
v != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_v_is_x) ).
cnf(c_0_8,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[d2]) ).
cnf(c_0_9,plain,
( ~ between(X3,X4,X6)
| ~ between(X1,X2,X5)
| ~ equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X7,X4,X8) ),
inference(fof_simplification,[status(thm)],[d14]) ).
cnf(c_0_10,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
equidistant(w,v,w,x),
w_to_v_equals_w_to_x ).
cnf(c_0_12,plain,
( ~ between(X3,X4,X6)
| ~ between(X1,X2,X5)
| ~ equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X2,X7,X4,X8) ),
c_0_9 ).
cnf(c_0_13,hypothesis,
equidistant(w,x,w,v),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
( ~ equidistant(X4,X1,X3,X2)
| ~ equidistant(X4,x,X3,v)
| ~ equidistant(X1,w,X2,w)
| ~ between(X4,X1,w)
| ~ between(X3,X2,w)
| equidistant(X1,x,X2,v) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
equidistant(X1,X2,X1,X2),
d1 ).
cnf(c_0_16,hypothesis,
equidistant(u,v,u,x),
u_to_v_equals_u_to_x ).
cnf(c_0_17,hypothesis,
( ~ equidistant(X2,x,X2,v)
| ~ between(X2,X1,w)
| equidistant(X1,x,X1,v) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_18,hypothesis,
equidistant(u,x,u,v),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_19,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_20,hypothesis,
( ~ between(u,X1,w)
| equidistant(X1,x,X1,v) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_22,negated_conjecture,
v != x,
inference(fof_simplification,[status(thm)],[prove_v_is_x]) ).
cnf(c_0_23,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_19 ).
cnf(c_0_24,hypothesis,
equidistant(v,x,v,v),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
v != x,
c_0_22 ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO034-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n001.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 08:36:13 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 2.25/0.75 % Version: 3.5.1
% 2.25/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.25/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.25/0.75 % Starting new_bool_3 with 300s (1) cores
% 2.25/0.75 % Starting new_bool_1 with 300s (1) cores
% 2.25/0.75 % Starting sh5l with 300s (1) cores
% 2.25/0.75 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 411325 completed with status 0
% 2.25/0.75 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.25/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.25/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.25/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.25/0.75 % No SInE strategy applied
% 2.25/0.75 % Search class: FGUSM-FFMS33-SFFFFFNN
% 2.25/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.25/0.75 % Starting SubtermCWHack with 136s (1) cores
% 2.25/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.25/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.25/0.75 % Starting new_bool_3 with 136s (1) cores
% 2.25/0.75 % Starting new_bool_1 with 136s (1) cores
% 2.25/0.75 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 411334 completed with status 0
% 2.25/0.75 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 2.25/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.25/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.25/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.25/0.75 % No SInE strategy applied
% 2.25/0.75 % Search class: FGUSM-FFMS33-SFFFFFNN
% 2.25/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.25/0.75 % Starting SubtermCWHack with 136s (1) cores
% 2.25/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.25/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.25/0.75 % Preprocessing time : 0.002 s
% 2.25/0.75 % Presaturation interreduction done
% 2.25/0.75
% 2.25/0.75 % Proof found!
% 2.25/0.75 % SZS status Unsatisfiable
% 2.25/0.75 % SZS output start CNFRefutation
% See solution above
% 2.25/0.75 % Parsed axioms : 72
% 2.25/0.75 % Removed by relevancy pruning/SinE : 0
% 2.25/0.75 % Initial clauses : 72
% 2.25/0.75 % Removed in clause preprocessing : 2
% 2.25/0.75 % Initial clauses in saturation : 70
% 2.25/0.75 % Processed clauses : 2037
% 2.25/0.75 % ...of these trivial : 173
% 2.25/0.75 % ...subsumed : 910
% 2.25/0.75 % ...remaining for further processing : 954
% 2.25/0.75 % Other redundant clauses eliminated : 5
% 2.25/0.75 % Clauses deleted for lack of memory : 0
% 2.25/0.75 % Backward-subsumed : 11
% 2.25/0.75 % Backward-rewritten : 15
% 2.25/0.75 % Generated clauses : 15880
% 2.25/0.75 % ...of the previous two non-redundant : 13211
% 2.25/0.75 % ...aggressively subsumed : 0
% 2.25/0.75 % Contextual simplify-reflections : 8
% 2.25/0.75 % Paramodulations : 15875
% 2.25/0.75 % Factorizations : 0
% 2.25/0.75 % NegExts : 0
% 2.25/0.75 % Equation resolutions : 5
% 2.25/0.75 % Disequality decompositions : 0
% 2.25/0.75 % Total rewrite steps : 4468
% 2.25/0.75 % ...of those cached : 3819
% 2.25/0.75 % Propositional unsat checks : 0
% 2.25/0.75 % Propositional check models : 0
% 2.25/0.75 % Propositional check unsatisfiable : 0
% 2.25/0.75 % Propositional clauses : 0
% 2.25/0.75 % Propositional clauses after purity: 0
% 2.25/0.75 % Propositional unsat core size : 0
% 2.25/0.75 % Propositional preprocessing time : 0.000
% 2.25/0.75 % Propositional encoding time : 0.000
% 2.25/0.75 % Propositional solver time : 0.000
% 2.25/0.75 % Success case prop preproc time : 0.000
% 2.25/0.75 % Success case prop encoding time : 0.000
% 2.25/0.75 % Success case prop solver time : 0.000
% 2.25/0.75 % Current number of processed clauses : 864
% 2.25/0.75 % Positive orientable unit clauses : 147
% 2.25/0.75 % Positive unorientable unit clauses: 0
% 2.25/0.75 % Negative unit clauses : 20
% 2.25/0.75 % Non-unit-clauses : 697
% 2.25/0.75 % Current number of unprocessed clauses: 11215
% 2.25/0.75 % ...number of literals in the above : 32651
% 2.25/0.75 % Current number of archived formulas : 0
% 2.25/0.75 % Current number of archived clauses : 88
% 2.25/0.75 % Clause-clause subsumption calls (NU) : 93233
% 2.25/0.75 % Rec. Clause-clause subsumption calls : 57342
% 2.25/0.75 % Non-unit clause-clause subsumptions : 886
% 2.25/0.75 % Unit Clause-clause subsumption calls : 1103
% 2.25/0.75 % Rewrite failures with RHS unbound : 0
% 2.25/0.75 % BW rewrite match attempts : 1874
% 2.25/0.75 % BW rewrite match successes : 14
% 2.25/0.75 % Condensation attempts : 0
% 2.25/0.75 % Condensation successes : 0
% 2.25/0.75 % Termbank termtop insertions : 302377
% 2.25/0.75 % Search garbage collected termcells : 172
% 2.25/0.75
% 2.25/0.75 % -------------------------------------------------
% 2.25/0.75 % User time : 0.307 s
% 2.25/0.75 % System time : 0.018 s
% 2.25/0.75 % Total time : 0.326 s
% 2.25/0.75 % Maximum resident set size: 3688 pages
% 2.25/0.75
% 2.25/0.75 % -------------------------------------------------
% 2.25/0.75 % User time : 1.489 s
% 2.25/0.75 % System time : 0.081 s
% 2.25/0.75 % Total time : 1.571 s
% 2.25/0.75 % Maximum resident set size: 4608 pages
% 2.25/0.75 % E exiting
%------------------------------------------------------------------------------