%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO029-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:28:51 PM UTC 2026
% Result : Unsatisfiable 243.18s 31.50s
% Output : CNFRefutation 243.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 35 ( 17 unt; 9 nHn; 21 RR)
% Number of literals : 87 ( 19 equ; 49 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 : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 144 ( 11 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(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,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,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
inference(fof_simplification,[status(thm)],[transitivity_for_equidistance]) ).
cnf(c_0_9,plain,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
c_0_8 ).
cnf(c_0_10,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_11,plain,
( ~ equidistant(X4,X3,X1,X2)
| equidistant(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
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(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
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(X3,X4,X1,X2)
| equidistant(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_17,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_18,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_19,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,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_18,c_0_15]) ).
cnf(c_0_21,plain,
( ~ equidistant(X5,X6,X1,X2)
| equidistant(X1,X2,X3,extension(X4,X3,X5,X6)) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,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_20,c_0_13]) ).
cnf(c_0_23,plain,
equidistant(X1,X2,X3,extension(X4,X3,X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_24,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_25,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_22,c_0_13]),c_0_13])]) ).
cnf(c_0_26,plain,
equidistant(X1,extension(X2,X1,X3,X4),X5,extension(X6,X5,X4,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
inference(fof_simplification,[status(thm)],[prove_equal_extensions]) ).
cnf(c_0_28,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_24 ).
cnf(c_0_29,plain,
( equidistant(extension(X1,X2,X3,X4),X5,extension(X1,X2,X4,X3),X5)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
u != v,
inference(fof_simplification,[status(thm)],[u_not_v]) ).
cnf(c_0_31,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
c_0_27 ).
cnf(c_0_32,plain,
( X1 = X2
| extension(X1,X2,X3,X4) = extension(X1,X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,hypothesis,
u != v,
c_0_30 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO029-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.09/0.57 % Computer : n005.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Sun Sep 20 08:24:04 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.65 Running first-order theorem proving
% 0.15/0.65 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
% 243.18/31.50 % Version: 3.5.1
% 243.18/31.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 243.18/31.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 243.18/31.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 243.18/31.50 % Starting new_bool_3 with 300s (1) cores
% 243.18/31.50 % Starting new_bool_1 with 300s (1) cores
% 243.18/31.50 % Starting sh5l with 300s (1) cores
% 243.18/31.50 % new_bool_1 with pid 799370 completed with status 0
% 243.18/31.50 % Result found by new_bool_1
% 243.18/31.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 243.18/31.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 243.18/31.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 243.18/31.50 % Starting new_bool_3 with 300s (1) cores
% 243.18/31.50 % Starting new_bool_1 with 300s (1) cores
% 243.18/31.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 243.18/31.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 243.18/31.50 % Search class: FGUSS-FFSF33-SFFFFFNN
% 243.18/31.50 % partial match(1): FGUSS-FFMF33-SFFFFFNN
% 243.18/31.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 243.18/31.50 % Starting SubtermCWHack with 28s (1) cores
% 243.18/31.50 % SubtermCWHack with pid 799377 completed with status 8
% 243.18/31.50 % Starting new_bool_1 with 31s (1) cores
% 243.18/31.50 % new_bool_1 with pid 799384 completed with status 0
% 243.18/31.50 % Result found by new_bool_1
% 243.18/31.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 243.18/31.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 243.18/31.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 243.18/31.50 % Starting new_bool_3 with 300s (1) cores
% 243.18/31.50 % Starting new_bool_1 with 300s (1) cores
% 243.18/31.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 243.18/31.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 243.18/31.50 % Search class: FGUSS-FFSF33-SFFFFFNN
% 243.18/31.50 % partial match(1): FGUSS-FFMF33-SFFFFFNN
% 243.18/31.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 243.18/31.50 % Starting SubtermCWHack with 28s (1) cores
% 243.18/31.50 % SubtermCWHack with pid 799377 completed with status 8
% 243.18/31.50 % Starting new_bool_1 with 31s (1) cores
% 243.18/31.50 % Preprocessing time : 0.002 s
% 243.18/31.50 % Presaturation interreduction done
% 243.18/31.50
% 243.18/31.50 % Proof found!
% 243.18/31.50 % SZS status Unsatisfiable
% 243.18/31.50 % SZS output start CNFRefutation
% See solution above
% 243.18/31.50 % Parsed axioms : 20
% 243.18/31.50 % Removed by relevancy pruning/SinE : 10
% 243.18/31.50 % Initial clauses : 10
% 243.18/31.50 % Removed in clause preprocessing : 0
% 243.18/31.50 % Initial clauses in saturation : 10
% 243.18/31.50 % Processed clauses : 3433
% 243.18/31.50 % ...of these trivial : 674
% 243.18/31.50 % ...subsumed : 1902
% 243.18/31.50 % ...remaining for further processing : 857
% 243.18/31.50 % Other redundant clauses eliminated : 0
% 243.18/31.50 % Clauses deleted for lack of memory : 0
% 243.18/31.50 % Backward-subsumed : 17
% 243.18/31.50 % Backward-rewritten : 0
% 243.18/31.50 % Generated clauses : 73650
% 243.18/31.50 % ...of the previous two non-redundant : 62684
% 243.18/31.50 % ...aggressively subsumed : 0
% 243.18/31.50 % Contextual simplify-reflections : 0
% 243.18/31.50 % Paramodulations : 73650
% 243.18/31.50 % Factorizations : 0
% 243.18/31.50 % NegExts : 0
% 243.18/31.50 % Equation resolutions : 0
% 243.18/31.50 % Disequality decompositions : 0
% 243.18/31.50 % Total rewrite steps : 14798
% 243.18/31.50 % ...of those cached : 14140
% 243.18/31.50 % Propositional unsat checks : 0
% 243.18/31.50 % Propositional check models : 0
% 243.18/31.50 % Propositional check unsatisfiable : 0
% 243.18/31.50 % Propositional clauses : 0
% 243.18/31.50 % Propositional clauses after purity: 0
% 243.18/31.50 % Propositional unsat core size : 0
% 243.18/31.50 % Propositional preprocessing time : 0.000
% 243.18/31.50 % Propositional encoding time : 0.000
% 243.18/31.50 % Propositional solver time : 0.000
% 243.18/31.50 % Success case prop preproc time : 0.000
% 243.18/31.50 % Success case prop encoding time : 0.000
% 243.18/31.50 % Success case prop solver time : 0.000
% 243.18/31.50 % Current number of processed clauses : 830
% 243.18/31.50 % Positive orientable unit clauses : 246
% 243.18/31.50 % Positive unorientable unit clauses: 0
% 243.18/31.50 % Negative unit clauses : 2
% 243.18/31.50 % Non-unit-clauses : 582
% 243.18/31.50 % Current number of unprocessed clauses: 59183
% 243.18/31.50 % ...number of literals in the above : 115117
% 243.18/31.50 % Current number of archived formulas : 0
% 243.18/31.50 % Current number of archived clauses : 27
% 243.18/31.50 % Clause-clause subsumption calls (NU) : 220739
% 243.18/31.50 % Rec. Clause-clause subsumption calls : 153176
% 243.18/31.50 % Non-unit clause-clause subsumptions : 1919
% 243.18/31.50 % Unit Clause-clause subsumption calls : 2217
% 243.18/31.50 % Rewrite failures with RHS unbound : 0
% 243.18/31.50 % BW rewrite match attempts : 33283
% 243.18/31.50 % BW rewrite match successes : 0
% 243.18/31.50 % Condensation attempts : 0
% 243.18/31.50 % Condensation successes : 0
% 243.18/31.50 % Termbank termtop insertions : 1098819
% 243.18/31.50 % Search garbage collected termcells : 101
% 243.18/31.50
% 243.18/31.50 % -------------------------------------------------
% 243.18/31.50 % User time : 29.893 s
% 243.18/31.50 % System time : 0.579 s
% 243.18/31.50 % Total time : 30.471 s
% 243.18/31.50 % Maximum resident set size: 3656 pages
% 243.18/31.50
% 243.18/31.50 % -------------------------------------------------
% 243.18/31.50 % User time : 29.896 s
% 243.18/31.50 % System time : 0.587 s
% 243.18/31.50 % Total time : 30.483 s
% 243.18/31.50 % Maximum resident set size: 4608 pages
% 243.18/31.50 % E exiting
%------------------------------------------------------------------------------