%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO059-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 : n015.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:27:03 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.58s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 13 unt; 0 nHn; 17 RR)
% Number of literals : 42 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 0 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(d4_5,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_5) ).
cnf(r2_2,axiom,
equidistant(X1,reflection(X2,X1),X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2_2) ).
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(d2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2) ).
cnf(prove_congruence,negated_conjecture,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_congruence) ).
cnf(c_0_6,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[d4_4]) ).
cnf(c_0_7,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[d4_5]) ).
cnf(c_0_8,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
c_0_6 ).
cnf(c_0_9,axiom,
equidistant(X1,reflection(X2,X1),X2,X1),
r2_2 ).
cnf(c_0_10,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
c_0_7 ).
cnf(c_0_11,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_12,plain,
equidistant(X1,X2,X1,reflection(X2,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
equidistant(X1,X2,reflection(X2,X1),X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,plain,
( ~ equidistant(X1,X2,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X5,X6) ),
c_0_11 ).
cnf(c_0_15,plain,
equidistant(reflection(X1,X2),X2,X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_16,plain,
equidistant(X1,reflection(X2,X1),X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
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(reflection(X4,X3),X3,X1,X2)
| equidistant(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
equidistant(X1,X2,X2,reflection(X1,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
inference(fof_simplification,[status(thm)],[prove_congruence]) ).
cnf(c_0_21,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X3,X4,X1,X2) ),
c_0_17 ).
cnf(c_0_22,plain,
equidistant(X1,reflection(reflection(X2,X1),X1),X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
c_0_20 ).
cnf(c_0_24,plain,
equidistant(X1,X2,X1,reflection(reflection(X2,X1),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO059-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n015.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 20 09:14:05 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.58 % Version: 3.5.1
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.58 % Starting sh5l with 300s (1) cores
% 0.24/0.58 % new_bool_3 with pid 3009171 completed with status 0
% 0.24/0.58 % Result found by new_bool_3
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.58 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.24/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.58 % SubtermCWHack with pid 3009174 completed with status 0
% 0.24/0.58 % Result found by SubtermCWHack
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.58 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.24/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.58 % Preprocessing time : 0.002 s
% 0.24/0.58
% 0.24/0.58 % Proof found!
% 0.24/0.58 % SZS status Unsatisfiable
% 0.24/0.58 % SZS output start CNFRefutation
% See solution above
% 0.24/0.58 % Parsed axioms : 42
% 0.24/0.58 % Removed by relevancy pruning/SinE : 10
% 0.24/0.58 % Initial clauses : 32
% 0.24/0.58 % Removed in clause preprocessing : 0
% 0.24/0.58 % Initial clauses in saturation : 32
% 0.24/0.58 % Processed clauses : 61
% 0.24/0.58 % ...of these trivial : 5
% 0.24/0.58 % ...subsumed : 3
% 0.24/0.58 % ...remaining for further processing : 53
% 0.24/0.58 % Other redundant clauses eliminated : 2
% 0.24/0.58 % Clauses deleted for lack of memory : 0
% 0.24/0.58 % Backward-subsumed : 0
% 0.24/0.58 % Backward-rewritten : 2
% 0.24/0.58 % Generated clauses : 331
% 0.24/0.58 % ...of the previous two non-redundant : 94
% 0.24/0.58 % ...aggressively subsumed : 0
% 0.24/0.58 % Contextual simplify-reflections : 0
% 0.24/0.58 % Paramodulations : 329
% 0.24/0.58 % Factorizations : 0
% 0.24/0.58 % NegExts : 0
% 0.24/0.58 % Equation resolutions : 2
% 0.24/0.58 % Disequality decompositions : 0
% 0.24/0.58 % Total rewrite steps : 273
% 0.24/0.58 % ...of those cached : 229
% 0.24/0.58 % Propositional unsat checks : 0
% 0.24/0.58 % Propositional check models : 0
% 0.24/0.58 % Propositional check unsatisfiable : 0
% 0.24/0.58 % Propositional clauses : 0
% 0.24/0.58 % Propositional clauses after purity: 0
% 0.24/0.58 % Propositional unsat core size : 0
% 0.24/0.58 % Propositional preprocessing time : 0.000
% 0.24/0.58 % Propositional encoding time : 0.000
% 0.24/0.58 % Propositional solver time : 0.000
% 0.24/0.58 % Success case prop preproc time : 0.000
% 0.24/0.58 % Success case prop encoding time : 0.000
% 0.24/0.58 % Success case prop solver time : 0.000
% 0.24/0.58 % Current number of processed clauses : 49
% 0.24/0.58 % Positive orientable unit clauses : 33
% 0.24/0.58 % Positive unorientable unit clauses: 0
% 0.24/0.58 % Negative unit clauses : 0
% 0.24/0.58 % Non-unit-clauses : 16
% 0.24/0.58 % Current number of unprocessed clauses: 65
% 0.24/0.58 % ...number of literals in the above : 130
% 0.24/0.58 % Current number of archived formulas : 0
% 0.24/0.58 % Current number of archived clauses : 2
% 0.24/0.58 % Clause-clause subsumption calls (NU) : 126
% 0.24/0.58 % Rec. Clause-clause subsumption calls : 115
% 0.24/0.58 % Non-unit clause-clause subsumptions : 3
% 0.24/0.58 % Unit Clause-clause subsumption calls : 0
% 0.24/0.58 % Rewrite failures with RHS unbound : 0
% 0.24/0.58 % BW rewrite match attempts : 301
% 0.24/0.58 % BW rewrite match successes : 2
% 0.24/0.58 % Condensation attempts : 0
% 0.24/0.58 % Condensation successes : 0
% 0.24/0.58 % Termbank termtop insertions : 2745
% 0.24/0.58 % Search garbage collected termcells : 127
% 0.24/0.58
% 0.24/0.58 % -------------------------------------------------
% 0.24/0.58 % User time : 0.007 s
% 0.24/0.58 % System time : 0.004 s
% 0.24/0.58 % Total time : 0.011 s
% 0.24/0.58 % Maximum resident set size: 3616 pages
% 0.24/0.58
% 0.24/0.58 % -------------------------------------------------
% 0.24/0.58 % User time : 0.009 s
% 0.24/0.58 % System time : 0.012 s
% 0.24/0.58 % Total time : 0.021 s
% 0.24/0.58 % Maximum resident set size: 4608 pages
% 0.24/0.58 % E exiting
%------------------------------------------------------------------------------