%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO029-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 : n014.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.24s 0.59s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 13 unt; 7 nHn; 22 RR)
% Number of literals : 65 ( 20 equ; 34 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 104 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d4_4,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_4) ).
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(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
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(d2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
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_8,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[d4_4]) ).
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,X3,X4)
| equidistant(X4,X3,X1,X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_12,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_13,plain,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
c_0_9 ).
cnf(c_0_14,plain,
equidistant(X1,X2,X3,extension(X4,X3,X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ equidistant(X2,X3,X2,X4)
| ~ between(X1,X2,X4)
| ~ between(X1,X2,X3)
| X3 = X4
| X1 = X2 ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ equidistant(X6,X5,X1,X2)
| equidistant(X1,X2,X3,extension(X4,X3,X5,X6)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[d2]) ).
cnf(c_0_18,plain,
( ~ equidistant(X5,X4,X3,X1)
| ~ between(X6,X3,X1)
| ~ between(X6,X3,extension(X2,X3,X4,X5))
| X6 = X3
| X1 = extension(X2,X3,X4,X5) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_20,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
c_0_17 ).
cnf(c_0_21,plain,
( ~ equidistant(X5,X4,X3,X1)
| ~ between(X2,X3,X1)
| X2 = X3
| X1 = extension(X2,X3,X4,X5) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_23,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
inference(fof_simplification,[status(thm)],[prove_equal_extensions]) ).
cnf(c_0_24,plain,
( ~ between(X5,X2,extension(X1,X2,X3,X4))
| X5 = X2
| extension(X1,X2,X3,X4) = extension(X5,X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,hypothesis,
u != v,
inference(fof_simplification,[status(thm)],[u_not_v]) ).
cnf(c_0_26,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
c_0_23 ).
cnf(c_0_27,plain,
( X1 = X2
| extension(X1,X2,X3,X4) = extension(X1,X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_28,hypothesis,
u != v,
c_0_25 ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO029-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.39 % Computer : n014.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8046.5625MB
% 0.16/0.39 % OS : Linux 6.8.0-71-generic
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Sun Sep 20 08:27:49 UTC 2026
% 0.16/0.40 % CPUTime :
% 0.16/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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.24/0.59 % Version: 3.5.1
% 0.24/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.59 % Starting sh5l with 300s (1) cores
% 0.24/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1391260 completed with status 0
% 0.24/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.59 % No SInE strategy applied
% 0.24/0.59 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.24/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.59 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.24/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.24/0.59 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 1391268 completed with status 0
% 0.24/0.59 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.24/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.59 % No SInE strategy applied
% 0.24/0.59 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.24/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.59 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.24/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.24/0.59 % Preprocessing time : 0.003 s
% 0.24/0.59
% 0.24/0.59 % Proof found!
% 0.24/0.59 % SZS status Unsatisfiable
% 0.24/0.59 % SZS output start CNFRefutation
% See solution above
% 0.24/0.59 % Parsed axioms : 40
% 0.24/0.59 % Removed by relevancy pruning/SinE : 0
% 0.24/0.59 % Initial clauses : 40
% 0.24/0.59 % Removed in clause preprocessing : 1
% 0.24/0.59 % Initial clauses in saturation : 39
% 0.24/0.59 % Processed clauses : 298
% 0.24/0.59 % ...of these trivial : 30
% 0.24/0.59 % ...subsumed : 93
% 0.24/0.59 % ...remaining for further processing : 175
% 0.24/0.59 % Other redundant clauses eliminated : 9
% 0.24/0.59 % Clauses deleted for lack of memory : 0
% 0.24/0.59 % Backward-subsumed : 0
% 0.24/0.59 % Backward-rewritten : 0
% 0.24/0.59 % Generated clauses : 1739
% 0.24/0.59 % ...of the previous two non-redundant : 1238
% 0.24/0.59 % ...aggressively subsumed : 0
% 0.24/0.59 % Contextual simplify-reflections : 0
% 0.24/0.59 % Paramodulations : 1719
% 0.24/0.59 % Factorizations : 0
% 0.24/0.59 % NegExts : 0
% 0.24/0.59 % Equation resolutions : 20
% 0.24/0.59 % Disequality decompositions : 0
% 0.24/0.59 % Total rewrite steps : 611
% 0.24/0.59 % ...of those cached : 515
% 0.24/0.59 % Propositional unsat checks : 0
% 0.24/0.59 % Propositional check models : 0
% 0.24/0.59 % Propositional check unsatisfiable : 0
% 0.24/0.59 % Propositional clauses : 0
% 0.24/0.59 % Propositional clauses after purity: 0
% 0.24/0.59 % Propositional unsat core size : 0
% 0.24/0.59 % Propositional preprocessing time : 0.000
% 0.24/0.59 % Propositional encoding time : 0.000
% 0.24/0.59 % Propositional solver time : 0.000
% 0.24/0.59 % Success case prop preproc time : 0.000
% 0.24/0.59 % Success case prop encoding time : 0.000
% 0.24/0.59 % Success case prop solver time : 0.000
% 0.24/0.59 % Current number of processed clauses : 174
% 0.24/0.59 % Positive orientable unit clauses : 31
% 0.24/0.59 % Positive unorientable unit clauses: 0
% 0.24/0.59 % Negative unit clauses : 11
% 0.24/0.59 % Non-unit-clauses : 132
% 0.24/0.59 % Current number of unprocessed clauses: 979
% 0.24/0.59 % ...number of literals in the above : 3748
% 0.24/0.59 % Current number of archived formulas : 0
% 0.24/0.59 % Current number of archived clauses : 1
% 0.24/0.59 % Clause-clause subsumption calls (NU) : 7281
% 0.24/0.59 % Rec. Clause-clause subsumption calls : 3557
% 0.24/0.59 % Non-unit clause-clause subsumptions : 87
% 0.24/0.59 % Unit Clause-clause subsumption calls : 568
% 0.24/0.59 % Rewrite failures with RHS unbound : 0
% 0.24/0.59 % BW rewrite match attempts : 724
% 0.24/0.59 % BW rewrite match successes : 0
% 0.24/0.59 % Condensation attempts : 0
% 0.24/0.59 % Condensation successes : 0
% 0.24/0.59 % Termbank termtop insertions : 17782
% 0.24/0.59 % Search garbage collected termcells : 103
% 0.24/0.59
% 0.24/0.59 % -------------------------------------------------
% 0.24/0.59 % User time : 0.046 s
% 0.24/0.59 % System time : 0.009 s
% 0.24/0.59 % Total time : 0.055 s
% 0.24/0.59 % Maximum resident set size: 3664 pages
% 0.24/0.59
% 0.24/0.59 % -------------------------------------------------
% 0.24/0.59 % User time : 0.195 s
% 0.24/0.59 % System time : 0.036 s
% 0.24/0.59 % Total time : 0.231 s
% 0.24/0.59 % Maximum resident set size: 4864 pages
% 0.24/0.59 % E exiting
%------------------------------------------------------------------------------