%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO028-2 : 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 : n005.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 180.06s 27.12s
% Output : CNFRefutation 180.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 40 ( 21 unt; 9 nHn; 24 RR)
% Number of literals : 93 ( 19 equ; 50 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 144 ( 13 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/sandbox2/benchmark/Axioms/GEO002-0.ax',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(w_to_x_equals_y_to_z,hypothesis,
equidistant(w,x,y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_to_x_equals_y_to_z) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
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(prove_equal_extensions,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equal_extensions) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_not_v) ).
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,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_12,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_13,plain,
( ~ equidistant(X4,X3,X1,X2)
| equidistant(X1,X2,X3,X4) ),
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 ),
c_0_12 ).
cnf(c_0_15,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_16,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_17,hypothesis,
equidistant(w,x,y,z),
w_to_x_equals_y_to_z ).
cnf(c_0_18,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_19,plain,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X4,X5,X9)
| ~ equidistant(X2,X4,X6,X9)
| ~ equidistant(X2,X3,X6,extension(X5,X6,X7,X8))
| ~ between(X1,X2,X3)
| equidistant(X3,X4,extension(X5,X6,X7,X8),X9)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ equidistant(X3,X4,X1,X2)
| equidistant(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_21,hypothesis,
( ~ equidistant(w,x,X1,X2)
| equidistant(X1,X2,y,z) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,plain,
( ~ equidistant(X1,X2,X6,X7)
| ~ equidistant(X1,X5,X6,X10)
| ~ equidistant(X2,X5,X7,X10)
| ~ equidistant(X2,extension(X1,X2,X3,X4),X7,extension(X6,X7,X8,X9))
| equidistant(extension(X1,X2,X3,X4),X5,extension(X6,X7,X8,X9),X10)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_24,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,hypothesis,
equidistant(extension(X1,X2,w,x),X2,y,z),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ equidistant(X1,X2,X6,X2)
| ~ equidistant(X1,X5,X6,X5)
| ~ equidistant(X2,extension(X1,X2,X3,X4),X2,extension(X6,X2,X7,X8))
| equidistant(extension(X1,X2,X3,X4),X5,extension(X6,X2,X7,X8),X5)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_27,plain,
( ~ equidistant(X5,X6,X1,X2)
| equidistant(X1,X2,X3,extension(X4,X3,X5,X6)) ),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_28,hypothesis,
equidistant(y,z,X1,extension(X2,X1,w,x)),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_29,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_30,plain,
( ~ equidistant(X2,extension(X1,X2,X3,X4),X2,extension(X1,X2,X6,X7))
| equidistant(extension(X1,X2,X3,X4),X5,extension(X1,X2,X6,X7),X5)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_16])]) ).
cnf(c_0_31,hypothesis,
equidistant(X1,extension(X2,X1,w,x),X3,extension(X4,X3,y,z)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
inference(fof_simplification,[status(thm)],[prove_equal_extensions]) ).
cnf(c_0_33,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_29 ).
cnf(c_0_34,hypothesis,
( equidistant(extension(X1,X2,w,x),X3,extension(X1,X2,y,z),X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,hypothesis,
u != v,
inference(fof_simplification,[status(thm)],[u_not_v]) ).
cnf(c_0_36,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
c_0_32 ).
cnf(c_0_37,hypothesis,
( X1 = X2
| extension(X1,X2,y,z) = extension(X1,X2,w,x) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,hypothesis,
u != v,
c_0_35 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO028-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.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:17:48 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 180.06/27.12 % Version: 3.5.1
% 180.06/27.12 % Preprocessing class: FSMSSMSMSSSNFFN.
% 180.06/27.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 180.06/27.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 180.06/27.12 % Starting new_bool_3 with 300s (1) cores
% 180.06/27.12 % Starting new_bool_1 with 300s (1) cores
% 180.06/27.12 % Starting sh5l with 300s (1) cores
% 180.06/27.12 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 796343 completed with status 0
% 180.06/27.12 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 180.06/27.12 % Preprocessing class: FSMSSMSMSSSNFFN.
% 180.06/27.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 180.06/27.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 180.06/27.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 180.06/27.12 % No SInE strategy applied
% 180.06/27.12 % Search class: FGUSS-FFMF33-SFFFFFNN
% 180.06/27.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 180.06/27.12 % Starting SubtermCWHack with 136s (1) cores
% 180.06/27.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 180.06/27.12 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S4c with 136s (1) cores
% 180.06/27.12 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 180.06/27.12 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 180.06/27.12 % H----_047_B31_F1_PI_AE_R4_CS_SP_S4c with pid 796350 completed with status 0
% 180.06/27.12 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S4c
% 180.06/27.12 % Preprocessing class: FSMSSMSMSSSNFFN.
% 180.06/27.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 180.06/27.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 180.06/27.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 180.06/27.12 % No SInE strategy applied
% 180.06/27.12 % Search class: FGUSS-FFMF33-SFFFFFNN
% 180.06/27.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 180.06/27.12 % Starting SubtermCWHack with 136s (1) cores
% 180.06/27.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 180.06/27.12 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S4c with 136s (1) cores
% 180.06/27.12 % Preprocessing time : 0.001 s
% 180.06/27.12
% 180.06/27.12 % Proof found!
% 180.06/27.12 % SZS status Unsatisfiable
% 180.06/27.12 % SZS output start CNFRefutation
% See solution above
% 180.06/27.13 % Parsed axioms : 21
% 180.06/27.13 % Removed by relevancy pruning/SinE : 0
% 180.06/27.13 % Initial clauses : 21
% 180.06/27.13 % Removed in clause preprocessing : 0
% 180.06/27.13 % Initial clauses in saturation : 21
% 180.06/27.13 % Processed clauses : 26184
% 180.06/27.13 % ...of these trivial : 9762
% 180.06/27.13 % ...subsumed : 9722
% 180.06/27.13 % ...remaining for further processing : 6700
% 180.06/27.13 % Other redundant clauses eliminated : 0
% 180.06/27.13 % Clauses deleted for lack of memory : 0
% 180.06/27.13 % Backward-subsumed : 95
% 180.06/27.13 % Backward-rewritten : 128
% 180.06/27.13 % Generated clauses : 1390697
% 180.06/27.13 % ...of the previous two non-redundant : 1302935
% 180.06/27.13 % ...aggressively subsumed : 0
% 180.06/27.13 % Contextual simplify-reflections : 0
% 180.06/27.13 % Paramodulations : 1390697
% 180.06/27.13 % Factorizations : 0
% 180.06/27.13 % NegExts : 0
% 180.06/27.13 % Equation resolutions : 0
% 180.06/27.13 % Disequality decompositions : 0
% 180.06/27.13 % Total rewrite steps : 429157
% 180.06/27.13 % ...of those cached : 418716
% 180.06/27.13 % Propositional unsat checks : 0
% 180.06/27.13 % Propositional check models : 0
% 180.06/27.13 % Propositional check unsatisfiable : 0
% 180.06/27.13 % Propositional clauses : 0
% 180.06/27.13 % Propositional clauses after purity: 0
% 180.06/27.13 % Propositional unsat core size : 0
% 180.06/27.13 % Propositional preprocessing time : 0.000
% 180.06/27.13 % Propositional encoding time : 0.000
% 180.06/27.13 % Propositional solver time : 0.000
% 180.06/27.13 % Success case prop preproc time : 0.000
% 180.06/27.13 % Success case prop encoding time : 0.000
% 180.06/27.13 % Success case prop solver time : 0.000
% 180.06/27.13 % Current number of processed clauses : 6477
% 180.06/27.13 % Positive orientable unit clauses : 2638
% 180.06/27.13 % Positive unorientable unit clauses: 0
% 180.06/27.13 % Negative unit clauses : 5
% 180.06/27.13 % Non-unit-clauses : 3834
% 180.06/27.13 % Current number of unprocessed clauses: 1271719
% 180.06/27.13 % ...number of literals in the above : 2687989
% 180.06/27.13 % Current number of archived formulas : 0
% 180.06/27.13 % Current number of archived clauses : 223
% 180.06/27.13 % Clause-clause subsumption calls (NU) : 2659063
% 180.06/27.13 % Rec. Clause-clause subsumption calls : 1248218
% 180.06/27.13 % Non-unit clause-clause subsumptions : 9817
% 180.06/27.13 % Unit Clause-clause subsumption calls : 349109
% 180.06/27.13 % Rewrite failures with RHS unbound : 0
% 180.06/27.13 % BW rewrite match attempts : 794845
% 180.06/27.13 % BW rewrite match successes : 76
% 180.06/27.13 % Condensation attempts : 0
% 180.06/27.13 % Condensation successes : 0
% 180.06/27.13 % Termbank termtop insertions : 40812514
% 180.06/27.13 % Search garbage collected termcells : 77
% 180.06/27.13
% 180.06/27.13 % -------------------------------------------------
% 180.06/27.13 % User time : 24.975 s
% 180.06/27.13 % System time : 0.987 s
% 180.06/27.13 % Total time : 25.962 s
% 180.06/27.13 % Maximum resident set size: 3656 pages
% 180.06/27.13
% 180.06/27.13 % -------------------------------------------------
% 180.06/27.13 % User time : 124.633 s
% 180.06/27.13 % System time : 3.701 s
% 180.06/27.13 % Total time : 128.335 s
% 180.06/27.13 % Maximum resident set size: 4608 pages
% 180.06/27.13 % E exiting
%------------------------------------------------------------------------------