%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO063-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:59 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 15 unt; 4 nHn; 19 RR)
% Number of literals : 38 ( 17 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-4 aty)
% Number of variables : 58 ( 3 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(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(prove_equality_of_insertions,negated_conjecture,
insertion(u,v,w,x) != insertion(u,v,y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality_of_insertions) ).
cnf(d10_2,axiom,
( ~ equidistant(X1,X2,X3,X4)
| X5 = X6
| extension(X5,X6,X1,X2) = extension(X5,X6,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_2) ).
cnf(insertion,axiom,
insertion(X1,X2,X3,X4) = extension(extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X1,X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-3.ax',insertion) ).
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_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) ),
inference(fof_simplification,[status(thm)],[d4_4]) ).
cnf(c_0_9,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X2,X1) ),
c_0_7 ).
cnf(c_0_10,hypothesis,
equidistant(w,x,y,z),
w_to_x_equals_y_to_z ).
cnf(c_0_11,plain,
( ~ equidistant(X1,X2,X3,X4)
| equidistant(X4,X3,X1,X2) ),
c_0_8 ).
cnf(c_0_12,hypothesis,
equidistant(z,y,x,w),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
insertion(u,v,w,x) != insertion(u,v,y,z),
inference(fof_simplification,[status(thm)],[prove_equality_of_insertions]) ).
cnf(c_0_14,plain,
( ~ equidistant(X1,X2,X3,X4)
| X5 = X6
| extension(X5,X6,X1,X2) = extension(X5,X6,X3,X4) ),
inference(fof_simplification,[status(thm)],[d10_2]) ).
cnf(c_0_15,hypothesis,
equidistant(w,x,z,y),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
insertion(u,v,w,x) != insertion(u,v,y,z),
c_0_13 ).
cnf(c_0_17,axiom,
insertion(X1,X2,X3,X4) = extension(extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X1,X3,X4),
insertion ).
cnf(c_0_18,plain,
( ~ equidistant(X1,X2,X3,X4)
| X5 = X6
| extension(X5,X6,X1,X2) = extension(X5,X6,X3,X4) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
equidistant(y,z,w,x),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_20,plain,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
inference(fof_simplification,[status(thm)],[e3_1]) ).
cnf(c_0_21,negated_conjecture,
extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,y,z) != extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,w,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_22,hypothesis,
( X1 = X2
| extension(X1,X2,y,z) = extension(X1,X2,w,x) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO063-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 09:19:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 298397 completed with status 0
% 0.10/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.10/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.46 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.10/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.10/0.46 % SubtermCWHack with pid 298403 completed with status 0
% 0.10/0.46 % Result found by SubtermCWHack
% 0.10/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Unsatisfiable
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 76
% 0.10/0.46 % Removed by relevancy pruning/SinE : 0
% 0.10/0.46 % Initial clauses : 76
% 0.10/0.46 % Removed in clause preprocessing : 3
% 0.10/0.46 % Initial clauses in saturation : 73
% 0.10/0.46 % Processed clauses : 370
% 0.10/0.46 % ...of these trivial : 106
% 0.10/0.46 % ...subsumed : 77
% 0.10/0.46 % ...remaining for further processing : 187
% 0.10/0.46 % Other redundant clauses eliminated : 4
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 0
% 0.10/0.46 % Backward-rewritten : 1
% 0.10/0.46 % Generated clauses : 2167
% 0.10/0.46 % ...of the previous two non-redundant : 1279
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 0
% 0.10/0.46 % Paramodulations : 2163
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 4
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 991
% 0.10/0.46 % ...of those cached : 788
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 183
% 0.10/0.46 % Positive orientable unit clauses : 63
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 15
% 0.10/0.46 % Non-unit-clauses : 105
% 0.10/0.46 % Current number of unprocessed clauses: 981
% 0.10/0.46 % ...number of literals in the above : 3785
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 3
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 3592
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 2703
% 0.10/0.46 % Non-unit clause-clause subsumptions : 60
% 0.10/0.46 % Unit Clause-clause subsumption calls : 15
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 324
% 0.10/0.46 % BW rewrite match successes : 1
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 27271
% 0.10/0.46 % Search garbage collected termcells : 186
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.032 s
% 0.10/0.46 % System time : 0.008 s
% 0.10/0.46 % Total time : 0.040 s
% 0.10/0.46 % Maximum resident set size: 3696 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.139 s
% 0.10/0.46 % System time : 0.022 s
% 0.10/0.46 % Total time : 0.161 s
% 0.10/0.46 % Maximum resident set size: 4608 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------