%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO030-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:56 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 36 ( 21 unt; 5 nHn; 33 RR)
% Number of literals : 81 ( 14 equ; 46 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_for_equidistance,axiom,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',transitivity_for_equidistance) ).
cnf(v_to_w_equals_v_to_w1,hypothesis,
equidistant(v,w,v,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_to_w_equals_v_to_w1) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',reflexivity_for_equidistance) ).
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/sandbox/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).
cnf(u_to_w_equals_u_to_w1,hypothesis,
equidistant(u,w,u,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_to_w_equals_u_to_w1) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_not_v) ).
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_w_is_w1,negated_conjecture,
w != w1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_w_is_w1) ).
cnf(c_0_9,plain,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
inference(fof_simplification,[status(thm)],[transitivity_for_equidistance]) ).
cnf(c_0_10,plain,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
c_0_9 ).
cnf(c_0_11,hypothesis,
equidistant(v,w,v,w1),
v_to_w_equals_v_to_w1 ).
cnf(c_0_12,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_13,hypothesis,
( ~ equidistant(v,w,X1,X2)
| equidistant(X1,X2,v,w1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,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_15,plain,
( ~ equidistant(X4,X3,X1,X2)
| equidistant(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,hypothesis,
equidistant(w,v,v,w1),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,hypothesis,
equidistant(u,w,u,w1),
u_to_w_equals_u_to_w1 ).
cnf(c_0_18,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_14 ).
cnf(c_0_19,hypothesis,
equidistant(v,w1,v,w),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
( ~ equidistant(u,w,X1,X2)
| equidistant(X1,X2,u,w1) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,hypothesis,
( ~ equidistant(X1,v,X4,v)
| ~ equidistant(X1,w1,X4,w)
| ~ equidistant(v,X2,v,X3)
| ~ between(X1,v,X2)
| ~ between(X4,v,X3)
| equidistant(X2,w1,X3,w)
| X1 = v ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_23,hypothesis,
equidistant(w,u,u,w1),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,hypothesis,
u != v,
inference(fof_simplification,[status(thm)],[u_not_v]) ).
cnf(c_0_25,hypothesis,
( ~ equidistant(X1,v,X3,v)
| ~ equidistant(X1,w1,X3,w)
| ~ between(X1,v,X2)
| ~ between(X3,v,X2)
| equidistant(X2,w1,X2,w)
| X1 = v ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
equidistant(u,w1,u,w),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_27,hypothesis,
u != v,
c_0_24 ).
cnf(c_0_28,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_29,hypothesis,
( ~ between(u,v,X1)
| equidistant(X1,w1,X1,w) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22])]),c_0_27]) ).
cnf(c_0_30,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_31,negated_conjecture,
w != w1,
inference(fof_simplification,[status(thm)],[prove_w_is_w1]) ).
cnf(c_0_32,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_28 ).
cnf(c_0_33,hypothesis,
equidistant(w,w1,w,w),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
w != w1,
c_0_31 ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO030-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 08:28:21 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_3 with pid 4099163 completed with status 0
% 0.11/0.45 % Result found by new_bool_3
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGUSF-FFSS00-SFFFFFNN
% 0.11/0.45 % partial match(1): FGUNF-FFSS00-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 4099166 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGUSF-FFSS00-SFFFFFNN
% 0.11/0.45 % partial match(1): FGUNF-FFSS00-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 23
% 0.11/0.45 % Removed by relevancy pruning/SinE : 12
% 0.11/0.45 % Initial clauses : 11
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 11
% 0.11/0.45 % Processed clauses : 86
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 14
% 0.11/0.45 % ...remaining for further processing : 72
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 2
% 0.11/0.45 % Generated clauses : 202
% 0.11/0.45 % ...of the previous two non-redundant : 96
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 202
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 93
% 0.11/0.45 % ...of those cached : 55
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 70
% 0.11/0.45 % Positive orientable unit clauses : 22
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 2
% 0.11/0.45 % Non-unit-clauses : 46
% 0.11/0.45 % Current number of unprocessed clauses: 18
% 0.11/0.45 % ...number of literals in the above : 122
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 2
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 922
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 355
% 0.11/0.45 % Non-unit clause-clause subsumptions : 14
% 0.11/0.45 % Unit Clause-clause subsumption calls : 13
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 47
% 0.11/0.45 % BW rewrite match successes : 2
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 3816
% 0.11/0.45 % Search garbage collected termcells : 107
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.009 s
% 0.11/0.45 % System time : 0.001 s
% 0.11/0.45 % Total time : 0.010 s
% 0.11/0.45 % Maximum resident set size: 3656 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.010 s
% 0.11/0.45 % System time : 0.007 s
% 0.11/0.45 % Total time : 0.017 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------