%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO053-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:57 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 21 unt; 3 nHn; 31 RR)
% Number of literals : 68 ( 14 equ; 33 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 87 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d4_5,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_5) ).
cnf(d4_4,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_4) ).
cnf(u_to_v_equals_u_to_w,hypothesis,
equidistant(u,v,u,w),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_v_equals_u_to_w) ).
cnf(b5,axiom,
( ~ between(X1,X3,X4)
| ~ between(X1,X2,X3)
| between(X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b5) ).
cnf(t1,axiom,
( ~ between(X1,X2,X3)
| between(X3,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).
cnf(d9,axiom,
( ~ equidistant(X2,X3,X2,X4)
| ~ between(X1,X2,X4)
| ~ between(X1,X2,X3)
| X3 = X4
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9) ).
cnf(prove_v_equals_w,negated_conjecture,
v != w,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_equals_w) ).
cnf(e3_1,axiom,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e3_1) ).
cnf(c_0_10,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[d4_5]) ).
cnf(c_0_11,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[d4_4]) ).
cnf(c_0_12,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
c_0_10 ).
cnf(c_0_13,hypothesis,
equidistant(u,v,u,w),
u_to_v_equals_u_to_w ).
cnf(c_0_14,plain,
( ~ between(X1,X3,X4)
| ~ between(X1,X2,X3)
| between(X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[b5]) ).
cnf(c_0_15,plain,
( ~ between(X1,X2,X3)
| between(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[t1]) ).
cnf(c_0_16,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
c_0_11 ).
cnf(c_0_17,hypothesis,
equidistant(w,u,v,u),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ between(X1,X3,X4)
| ~ between(X1,X2,X3)
| between(X2,X3,X4) ),
c_0_14 ).
cnf(c_0_19,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_20,plain,
( ~ between(X1,X2,X3)
| between(X3,X2,X1) ),
c_0_15 ).
cnf(c_0_21,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_22,plain,
( ~ equidistant(X2,X3,X2,X4)
| ~ between(X1,X2,X4)
| ~ between(X1,X2,X3)
| X3 = X4
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[d9]) ).
cnf(c_0_23,hypothesis,
equidistant(u,v,w,u),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
v != w,
inference(fof_simplification,[status(thm)],[prove_v_equals_w]) ).
cnf(c_0_25,plain,
( ~ between(X3,X1,X2)
| between(X1,X2,extension(X3,X2,X4,X5)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
between(w,v,u),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ equidistant(X2,X3,X2,X4)
| ~ between(X1,X2,X4)
| ~ between(X1,X2,X3)
| X3 = X4
| X1 = X2 ),
c_0_22 ).
cnf(c_0_28,hypothesis,
equidistant(u,w,u,v),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
v != w,
c_0_24 ).
cnf(c_0_30,hypothesis,
between(v,u,extension(w,u,X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
inference(fof_simplification,[status(thm)],[e3_1]) ).
cnf(c_0_32,hypothesis,
( ~ between(X1,u,w)
| ~ between(X1,u,v)
| X1 = u ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,hypothesis,
between(extension(w,u,X1,X2),u,v),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_34,plain,
between(extension(X1,X2,X3,X4),X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_35,plain,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
c_0_31 ).
cnf(c_0_36,hypothesis,
extension(w,u,X1,X2) = u,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO053-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.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 09:23:05 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 300614 completed with status 0
% 0.11/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.11/0.47 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 151s (1) cores
% 0.11/0.47 % Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 0.11/0.47 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 0.11/0.47 % Starting new_bool_3 with 151s (1) cores
% 0.11/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 146s (1) cores
% 0.11/0.47 % G-E--_215_C46_F1_AE_CS_SP_PS_S2S with pid 300621 completed with status 0
% 0.11/0.47 % Result found by G-E--_215_C46_F1_AE_CS_SP_PS_S2S
% 0.11/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.11/0.47 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 151s (1) cores
% 0.11/0.47 % Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 0.11/0.47 % Preprocessing time : 0.002 s
% 0.11/0.47 % Presaturation interreduction done
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Unsatisfiable
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.11/0.47 % Parsed axioms : 85
% 0.11/0.47 % Removed by relevancy pruning/SinE : 0
% 0.11/0.47 % Initial clauses : 85
% 0.11/0.47 % Removed in clause preprocessing : 3
% 0.11/0.47 % Initial clauses in saturation : 82
% 0.11/0.47 % Processed clauses : 367
% 0.11/0.47 % ...of these trivial : 7
% 0.11/0.47 % ...subsumed : 100
% 0.11/0.47 % ...remaining for further processing : 260
% 0.11/0.47 % Other redundant clauses eliminated : 0
% 0.11/0.47 % Clauses deleted for lack of memory : 0
% 0.11/0.47 % Backward-subsumed : 0
% 0.11/0.47 % Backward-rewritten : 16
% 0.11/0.47 % Generated clauses : 884
% 0.11/0.47 % ...of the previous two non-redundant : 603
% 0.11/0.47 % ...aggressively subsumed : 0
% 0.11/0.47 % Contextual simplify-reflections : 0
% 0.11/0.47 % Paramodulations : 876
% 0.11/0.47 % Factorizations : 0
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 8
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 311
% 0.11/0.47 % ...of those cached : 214
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 169
% 0.11/0.47 % Positive orientable unit clauses : 34
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 23
% 0.11/0.47 % Non-unit-clauses : 112
% 0.11/0.47 % Current number of unprocessed clauses: 375
% 0.11/0.47 % ...number of literals in the above : 859
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 93
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 3968
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 3274
% 0.11/0.47 % Non-unit clause-clause subsumptions : 61
% 0.11/0.47 % Unit Clause-clause subsumption calls : 106
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 172
% 0.11/0.47 % BW rewrite match successes : 3
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 12848
% 0.11/0.47 % Search garbage collected termcells : 207
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.027 s
% 0.11/0.47 % System time : 0.003 s
% 0.11/0.47 % Total time : 0.030 s
% 0.11/0.47 % Maximum resident set size: 3444 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.102 s
% 0.11/0.47 % System time : 0.014 s
% 0.11/0.47 % Total time : 0.116 s
% 0.11/0.47 % Maximum resident set size: 4608 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------