%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO011-1 : TPTP v9.3.1. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:46 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 19 unt; 4 nHn; 32 RR)
% Number of literals : 71 ( 8 equ; 35 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-5 aty)
% Number of variables : 86 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
( ~ between(X1,X2,X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',identity_for_betweeness) ).
cnf(outer_pasch1,axiom,
( ~ between(X4,X3,X5)
| ~ between(X1,X2,X3)
| between(X1,outer_pasch(X2,X1,X4,X5,X3),X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',outer_pasch1) ).
cnf(identity_for_equidistance,axiom,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',identity_for_equidistance) ).
cnf(outer_pasch2,axiom,
( ~ between(X4,X3,X5)
| ~ between(X1,X2,X3)
| between(X5,X2,outer_pasch(X2,X1,X4,X5,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',outer_pasch2) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',segment_construction2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',segment_construction1) ).
cnf(colinearity1,axiom,
( ~ colinear(X1,X2,X3)
| between(X1,X3,X2)
| between(X2,X1,X3)
| between(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-1.ax',colinearity1) ).
cnf(lower_dimension1,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',lower_dimension1) ).
cnf(prove_lower_dimension_points_not_colinear,negated_conjecture,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lower_dimension_points_not_colinear) ).
cnf(lower_dimension3,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',lower_dimension3) ).
cnf(lower_dimension2,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO001-0.ax',lower_dimension2) ).
cnf(c_0_11,plain,
( ~ between(X1,X2,X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).
cnf(c_0_12,plain,
( ~ between(X4,X3,X5)
| ~ between(X1,X2,X3)
| between(X1,outer_pasch(X2,X1,X4,X5,X3),X4) ),
inference(fof_simplification,[status(thm)],[outer_pasch1]) ).
cnf(c_0_13,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_14,plain,
( ~ between(X4,X3,X5)
| ~ between(X1,X2,X3)
| between(X5,X2,outer_pasch(X2,X1,X4,X5,X3)) ),
inference(fof_simplification,[status(thm)],[outer_pasch2]) ).
cnf(c_0_15,plain,
( ~ between(X1,X2,X1)
| X1 = X2 ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ between(X4,X3,X5)
| ~ between(X1,X2,X3)
| between(X1,outer_pasch(X2,X1,X4,X5,X3),X4) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_13 ).
cnf(c_0_18,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_19,plain,
( ~ between(X4,X3,X5)
| ~ between(X1,X2,X3)
| between(X5,X2,outer_pasch(X2,X1,X4,X5,X3)) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ between(X2,X1,X4)
| ~ between(X2,X4,X3)
| outer_pasch(X1,X2,X2,X3,X4) = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_22,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ colinear(X1,X2,X3)
| between(X1,X3,X2)
| between(X2,X1,X3)
| between(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[colinearity1]) ).
cnf(c_0_24,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(fof_simplification,[status(thm)],[lower_dimension1]) ).
cnf(c_0_25,plain,
( ~ between(X3,X2,X4)
| ~ between(X3,X4,X1)
| between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ colinear(X1,X2,X3)
| between(X1,X3,X2)
| between(X2,X1,X3)
| between(X1,X2,X3) ),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
prove_lower_dimension_points_not_colinear ).
cnf(c_0_29,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
c_0_24 ).
cnf(c_0_30,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(fof_simplification,[status(thm)],[lower_dimension3]) ).
cnf(c_0_31,plain,
( ~ between(X3,X2,X1)
| between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( between(lower_dimension_point_2,lower_dimension_point_1,lower_dimension_point_3)
| between(lower_dimension_point_1,lower_dimension_point_3,lower_dimension_point_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
c_0_30 ).
cnf(c_0_34,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(fof_simplification,[status(thm)],[lower_dimension2]) ).
cnf(c_0_35,negated_conjecture,
between(lower_dimension_point_1,lower_dimension_point_3,lower_dimension_point_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO011-1 : TPTP v9.3.1. Bugfixed v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n001.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:21:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 401278 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGUSS-FFMF33-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S4c with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.11/0.44 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 401286 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGUSS-FFMF33-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44 % Presaturation interreduction done
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 25
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 25
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 25
% 0.11/0.44 % Processed clauses : 89
% 0.11/0.44 % ...of these trivial : 1
% 0.11/0.44 % ...subsumed : 4
% 0.11/0.44 % ...remaining for further processing : 84
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 11
% 0.11/0.44 % Generated clauses : 199
% 0.11/0.44 % ...of the previous two non-redundant : 145
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 199
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 61
% 0.11/0.44 % ...of those cached : 35
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 48
% 0.11/0.44 % Positive orientable unit clauses : 15
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 3
% 0.11/0.44 % Non-unit-clauses : 30
% 0.11/0.44 % Current number of unprocessed clauses: 100
% 0.11/0.44 % ...number of literals in the above : 427
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 36
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 609
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 344
% 0.11/0.44 % Non-unit clause-clause subsumptions : 4
% 0.11/0.44 % Unit Clause-clause subsumption calls : 49
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 153
% 0.11/0.44 % BW rewrite match successes : 2
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 3584
% 0.11/0.44 % Search garbage collected termcells : 82
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.006 s
% 0.11/0.44 % System time : 0.003 s
% 0.11/0.44 % Total time : 0.009 s
% 0.11/0.44 % Maximum resident set size: 3660 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.033 s
% 0.11/0.44 % System time : 0.013 s
% 0.11/0.44 % Total time : 0.046 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------