%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO127-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:15 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.36s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 57 ( 14 unt; 15 nHn; 48 RR)
% Number of literals : 118 ( 8 equ; 51 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 78 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(start_point_defn_8,axiom,
( ~ incident_o(X3,X2)
| ~ start_point(X1,X2)
| ordered_by(X2,X1,X3)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-2.ax',start_point_defn_8) ).
cnf(theorem_4_12_138,negated_conjecture,
( ~ incident_o(sk26,sk25)
| ~ ordered_by(sk25,X1,sk26) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_4_12_138) ).
cnf(o4_29,axiom,
start_point(ax2_sk6(X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-2.ax',o4_29) ).
cnf(theorem_4_12_133,negated_conjecture,
( ordered_by(sk25,sk27,sk26)
| ordered_by(sk25,sk26,sk27)
| incident_o(sk26,sk25) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_4_12_133) ).
cnf(theorem_4_12_137,negated_conjecture,
( ~ incident_o(sk26,sk25)
| ~ ordered_by(sk25,sk26,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_4_12_137) ).
cnf(inner_point_defn_21,axiom,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',inner_point_defn_21) ).
cnf(end_point_defn_13,axiom,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_13) ).
cnf(open_defn_33,axiom,
( ~ open(X1)
| end_point(ax0_sk7(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',open_defn_33) ).
cnf(o2_21,axiom,
( ~ incident_c(X1,ax2_sk3(X2))
| incident_o(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-2.ax',o2_21) ).
cnf(c3_37,axiom,
inner_point(ax0_sk8(X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c3_37) ).
cnf(inner_point_defn_22,axiom,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',inner_point_defn_22) ).
cnf(o2_19,axiom,
open(ax2_sk3(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-2.ax',o2_19) ).
cnf(o1_18,axiom,
( ~ ordered_by(X1,X2,X3)
| incident_o(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-2.ax',o1_18) ).
cnf(o1_17,axiom,
( ~ ordered_by(X1,X2,X3)
| incident_o(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-2.ax',o1_17) ).
cnf(c_0_14,plain,
( ~ incident_o(X3,X2)
| ~ start_point(X1,X2)
| ordered_by(X2,X1,X3)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[start_point_defn_8]) ).
cnf(c_0_15,negated_conjecture,
( ~ incident_o(sk26,sk25)
| ~ ordered_by(sk25,X1,sk26) ),
inference(fof_simplification,[status(thm)],[theorem_4_12_138]) ).
cnf(c_0_16,plain,
( ~ incident_o(X3,X2)
| ~ start_point(X1,X2)
| ordered_by(X2,X1,X3)
| X1 = X3 ),
c_0_14 ).
cnf(c_0_17,axiom,
start_point(ax2_sk6(X1),X1),
o4_29 ).
cnf(c_0_18,negated_conjecture,
( ~ incident_o(sk26,sk25)
| ~ ordered_by(sk25,X1,sk26) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
( ordered_by(sk25,sk27,sk26)
| ordered_by(sk25,sk26,sk27)
| incident_o(sk26,sk25) ),
theorem_4_12_133 ).
cnf(c_0_20,plain,
( ~ incident_o(X2,X1)
| ordered_by(X1,ax2_sk6(X1),X2)
| ax2_sk6(X1) = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ ordered_by(sk25,X1,sk26)
| ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( ~ incident_o(sk26,sk25)
| ~ ordered_by(sk25,sk26,X1) ),
inference(fof_simplification,[status(thm)],[theorem_4_12_137]) ).
cnf(c_0_23,plain,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
inference(fof_simplification,[status(thm)],[inner_point_defn_21]) ).
cnf(c_0_24,plain,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
inference(fof_simplification,[status(thm)],[end_point_defn_13]) ).
cnf(c_0_25,plain,
( ~ open(X1)
| end_point(ax0_sk7(X1),X1) ),
inference(fof_simplification,[status(thm)],[open_defn_33]) ).
cnf(c_0_26,negated_conjecture,
( ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26)
| ax2_sk6(sk25) = sk26 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( ~ incident_o(sk26,sk25)
| ~ ordered_by(sk25,sk26,X1) ),
c_0_22 ).
cnf(c_0_28,plain,
( ~ incident_c(X1,ax2_sk3(X2))
| incident_o(X1,X2) ),
inference(fof_simplification,[status(thm)],[o2_21]) ).
cnf(c_0_29,plain,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
c_0_23 ).
cnf(c_0_30,axiom,
inner_point(ax0_sk8(X1),X1),
c3_37 ).
cnf(c_0_31,plain,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
c_0_24 ).
cnf(c_0_32,plain,
( ~ open(X1)
| end_point(ax0_sk7(X1),X1) ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
inference(fof_simplification,[status(thm)],[inner_point_defn_22]) ).
cnf(c_0_34,negated_conjecture,
( ordered_by(sk25,sk27,sk26)
| ordered_by(sk25,sk26,sk27)
| start_point(sk26,sk25) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( ~ ordered_by(sk25,sk26,X1)
| ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_36,plain,
( ~ incident_c(X1,ax2_sk3(X2))
| incident_o(X1,X2) ),
c_0_28 ).
cnf(c_0_37,plain,
incident_c(ax0_sk8(X1),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ open(X1)
| incident_c(ax0_sk7(X1),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,axiom,
open(ax2_sk3(X1)),
o2_19 ).
cnf(c_0_40,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
c_0_33 ).
cnf(c_0_41,negated_conjecture,
( ~ incident_o(X1,sk25)
| ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26)
| sk26 = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_34]),c_0_35]) ).
cnf(c_0_42,plain,
incident_o(ax0_sk8(ax2_sk3(X1)),X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
incident_o(ax0_sk7(ax2_sk3(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
~ end_point(ax0_sk8(X1),X1),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_45,negated_conjecture,
( ordered_by(sk25,sk27,sk26)
| ordered_by(sk25,sk26,sk27)
| ax0_sk8(ax2_sk3(sk25)) = sk26 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ ordered_by(X1,X2,X3)
| incident_o(X3,X1) ),
inference(fof_simplification,[status(thm)],[o1_18]) ).
cnf(c_0_47,negated_conjecture,
( ordered_by(sk25,sk27,sk26)
| ordered_by(sk25,sk26,sk27)
| ax0_sk7(ax2_sk3(sk25)) = sk26 ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( ~ end_point(sk26,ax2_sk3(sk25))
| ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( ~ ordered_by(X1,X2,X3)
| incident_o(X2,X1) ),
inference(fof_simplification,[status(thm)],[o1_17]) ).
cnf(c_0_50,plain,
( ~ ordered_by(X1,X2,X3)
| incident_o(X3,X1) ),
c_0_46 ).
cnf(c_0_51,negated_conjecture,
( ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_39])]),c_0_48]) ).
cnf(c_0_52,plain,
( ~ ordered_by(X1,X2,X3)
| incident_o(X2,X1) ),
c_0_49 ).
cnf(c_0_53,negated_conjecture,
incident_o(sk26,sk25),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_54,negated_conjecture,
~ ordered_by(sk25,sk26,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_53])]) ).
cnf(c_0_55,negated_conjecture,
~ ordered_by(sk25,X1,sk26),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_51,c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO127-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 20 12:01:37 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.36 % Version: 3.5.1
% 0.07/0.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.36 % Starting sh5l with 300s (1) cores
% 0.07/0.36 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 160304 completed with status 0
% 0.07/0.36 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.07/0.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.36 % No SInE strategy applied
% 0.07/0.36 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.07/0.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.36 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.07/0.36 % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.07/0.36 % Starting new_bool_3 with 248s (1) cores
% 0.07/0.36 % Starting new_bool_1 with 241s (1) cores
% 0.07/0.36 % new_bool_3 with pid 160313 completed with status 0
% 0.07/0.36 % Result found by new_bool_3
% 0.07/0.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.36 % No SInE strategy applied
% 0.07/0.36 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.07/0.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.36 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.07/0.36 % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.07/0.36 % Starting new_bool_3 with 248s (1) cores
% 0.07/0.36 % Preprocessing time : 0.001 s
% 0.07/0.36 % Presaturation interreduction done
% 0.07/0.36
% 0.07/0.36 % Proof found!
% 0.07/0.36 % SZS status Unsatisfiable
% 0.07/0.36 % SZS output start CNFRefutation
% See solution above
% 0.07/0.36 % Parsed axioms : 102
% 0.07/0.36 % Removed by relevancy pruning/SinE : 0
% 0.07/0.36 % Initial clauses : 102
% 0.07/0.36 % Removed in clause preprocessing : 12
% 0.07/0.36 % Initial clauses in saturation : 90
% 0.07/0.36 % Processed clauses : 298
% 0.07/0.36 % ...of these trivial : 0
% 0.07/0.36 % ...subsumed : 29
% 0.07/0.36 % ...remaining for further processing : 268
% 0.07/0.36 % Other redundant clauses eliminated : 7
% 0.07/0.36 % Clauses deleted for lack of memory : 0
% 0.07/0.36 % Backward-subsumed : 37
% 0.07/0.36 % Backward-rewritten : 2
% 0.07/0.36 % Generated clauses : 771
% 0.07/0.36 % ...of the previous two non-redundant : 733
% 0.07/0.36 % ...aggressively subsumed : 0
% 0.07/0.36 % Contextual simplify-reflections : 8
% 0.07/0.36 % Paramodulations : 761
% 0.07/0.36 % Factorizations : 2
% 0.07/0.36 % NegExts : 0
% 0.07/0.36 % Equation resolutions : 7
% 0.07/0.36 % Disequality decompositions : 0
% 0.07/0.36 % Total rewrite steps : 42
% 0.07/0.36 % ...of those cached : 19
% 0.07/0.36 % Propositional unsat checks : 0
% 0.07/0.36 % Propositional check models : 0
% 0.07/0.36 % Propositional check unsatisfiable : 0
% 0.07/0.36 % Propositional clauses : 0
% 0.07/0.36 % Propositional clauses after purity: 0
% 0.07/0.36 % Propositional unsat core size : 0
% 0.07/0.36 % Propositional preprocessing time : 0.000
% 0.07/0.36 % Propositional encoding time : 0.000
% 0.07/0.36 % Propositional solver time : 0.000
% 0.07/0.36 % Success case prop preproc time : 0.000
% 0.07/0.36 % Success case prop encoding time : 0.000
% 0.07/0.36 % Success case prop solver time : 0.000
% 0.07/0.36 % Current number of processed clauses : 131
% 0.07/0.36 % Positive orientable unit clauses : 41
% 0.07/0.36 % Positive unorientable unit clauses: 0
% 0.07/0.36 % Negative unit clauses : 4
% 0.07/0.36 % Non-unit-clauses : 86
% 0.07/0.36 % Current number of unprocessed clauses: 613
% 0.07/0.36 % ...number of literals in the above : 1969
% 0.07/0.36 % Current number of archived formulas : 0
% 0.07/0.36 % Current number of archived clauses : 130
% 0.07/0.36 % Clause-clause subsumption calls (NU) : 6716
% 0.07/0.36 % Rec. Clause-clause subsumption calls : 3276
% 0.07/0.36 % Non-unit clause-clause subsumptions : 74
% 0.07/0.36 % Unit Clause-clause subsumption calls : 320
% 0.07/0.36 % Rewrite failures with RHS unbound : 0
% 0.07/0.36 % BW rewrite match attempts : 7
% 0.07/0.36 % BW rewrite match successes : 1
% 0.07/0.36 % Condensation attempts : 0
% 0.07/0.36 % Condensation successes : 0
% 0.07/0.36 % Termbank termtop insertions : 14976
% 0.07/0.36 % Search garbage collected termcells : 250
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.015 s
% 0.07/0.36 % System time : 0.005 s
% 0.07/0.36 % Total time : 0.020 s
% 0.07/0.36 % Maximum resident set size: 3720 pages
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.079 s
% 0.07/0.36 % System time : 0.018 s
% 0.07/0.36 % Total time : 0.097 s
% 0.07/0.36 % Maximum resident set size: 4608 pages
% 0.07/0.36 % E exiting
%------------------------------------------------------------------------------