%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GEO127-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:19:23 PM UTC 2026
% Result : Unsatisfiable 1.13s 1.62s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of clauses : 54 ( 20 unt; 11 nHn; 45 RR)
% Number of literals : 104 ( 13 equ; 46 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(o1_18,axiom,
( incident_o(X3,X1)
| ~ ordered_by(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',o1_18) ).
cnf(theorem_4_12_133,negated_conjecture,
( incident_o(sk26,sk25)
| ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_12_133) ).
cnf(o1_17,axiom,
( incident_o(X2,X1)
| ~ ordered_by(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',o1_17) ).
cnf(theorem_4_12_138,negated_conjecture,
( ~ ordered_by(sk25,X1,sk26)
| ~ incident_o(sk26,sk25) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_12_138) ).
cnf(start_point_defn_8,axiom,
( X1 = X3
| ordered_by(X2,X1,X3)
| ~ start_point(X1,X2)
| ~ incident_o(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',start_point_defn_8) ).
cnf(finish_point_defn_15,axiom,
( incident_o(ax2_sk2(X2,X1),X2)
| finish_point(X1,X2)
| ~ incident_o(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',finish_point_defn_15) ).
cnf(o4_29,axiom,
start_point(ax2_sk6(X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',o4_29) ).
cnf(theorem_4_12_137,negated_conjecture,
( ~ ordered_by(sk25,sk26,X1)
| ~ incident_o(sk26,sk25) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_12_137) ).
cnf(finish_point_defn_14,axiom,
( finish_point(X1,X2)
| ~ incident_o(X1,X2)
| X1 != ax2_sk2(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',finish_point_defn_14) ).
cnf(inner_point_defn_21,axiom,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',inner_point_defn_21) ).
cnf(c3_37,axiom,
inner_point(ax0_sk8(X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',c3_37) ).
cnf(end_point_defn_13,axiom,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',end_point_defn_13) ).
cnf(open_defn_33,axiom,
( end_point(ax0_sk7(X1),X1)
| ~ open(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',open_defn_33) ).
cnf(finish_point_defn_13,axiom,
( X1 = X3
| ordered_by(X2,X3,X1)
| ~ finish_point(X1,X2)
| ~ incident_o(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',finish_point_defn_13) ).
cnf(o2_21,axiom,
( incident_o(X1,X2)
| ~ incident_c(X1,ax2_sk3(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',o2_21) ).
cnf(o2_19,axiom,
open(ax2_sk3(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',o2_19) ).
cnf(inner_point_defn_22,axiom,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',inner_point_defn_22) ).
cnf(c_0_17,axiom,
( incident_o(X3,X1)
| ~ ordered_by(X1,X2,X3) ),
o1_18 ).
cnf(c_0_18,negated_conjecture,
( incident_o(sk26,sk25)
| ordered_by(sk25,sk26,sk27)
| ordered_by(sk25,sk27,sk26) ),
theorem_4_12_133 ).
cnf(c_0_19,axiom,
( incident_o(X2,X1)
| ~ ordered_by(X1,X2,X3) ),
o1_17 ).
cnf(c_0_20,negated_conjecture,
( ~ ordered_by(sk25,X1,sk26)
| ~ incident_o(sk26,sk25) ),
theorem_4_12_138 ).
cnf(c_0_21,negated_conjecture,
incident_o(sk26,sk25),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,axiom,
( X1 = X3
| ordered_by(X2,X1,X3)
| ~ start_point(X1,X2)
| ~ incident_o(X3,X2) ),
start_point_defn_8 ).
cnf(c_0_23,negated_conjecture,
~ ordered_by(sk25,X1,sk26),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,axiom,
( incident_o(ax2_sk2(X2,X1),X2)
| finish_point(X1,X2)
| ~ incident_o(X1,X2) ),
finish_point_defn_15 ).
cnf(c_0_25,negated_conjecture,
( X1 = sk26
| ~ start_point(X1,sk25) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_23]) ).
cnf(c_0_26,axiom,
start_point(ax2_sk6(X1),X1),
o4_29 ).
cnf(c_0_27,negated_conjecture,
( finish_point(sk26,sk25)
| incident_o(ax2_sk2(sk25,sk26),sk25) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
ax2_sk6(sk25) = sk26,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ ordered_by(sk25,sk26,X1)
| ~ incident_o(sk26,sk25) ),
theorem_4_12_137 ).
cnf(c_0_30,negated_conjecture,
( X1 = ax2_sk2(sk25,sk26)
| finish_point(sk26,sk25)
| ordered_by(sk25,X1,ax2_sk2(sk25,sk26))
| ~ start_point(X1,sk25) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
start_point(sk26,sk25),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ ordered_by(sk25,sk26,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_21])]) ).
cnf(c_0_33,axiom,
( finish_point(X1,X2)
| ~ incident_o(X1,X2)
| X1 != ax2_sk2(X2,X1) ),
finish_point_defn_14 ).
cnf(c_0_34,negated_conjecture,
( ax2_sk2(sk25,sk26) = sk26
| finish_point(sk26,sk25) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,axiom,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inner_point_defn_21 ).
cnf(c_0_36,axiom,
inner_point(ax0_sk8(X1),X1),
c3_37 ).
cnf(c_0_37,axiom,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
end_point_defn_13 ).
cnf(c_0_38,axiom,
( end_point(ax0_sk7(X1),X1)
| ~ open(X1) ),
open_defn_33 ).
cnf(c_0_39,axiom,
( X1 = X3
| ordered_by(X2,X3,X1)
| ~ finish_point(X1,X2)
| ~ incident_o(X3,X2) ),
finish_point_defn_13 ).
cnf(c_0_40,negated_conjecture,
finish_point(sk26,sk25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21])]) ).
cnf(c_0_41,axiom,
( incident_o(X1,X2)
| ~ incident_c(X1,ax2_sk3(X2)) ),
o2_21 ).
cnf(c_0_42,plain,
incident_c(ax0_sk8(X1),X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( incident_c(ax0_sk7(X1),X1)
| ~ open(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,axiom,
open(ax2_sk3(X1)),
o2_19 ).
cnf(c_0_45,axiom,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
inner_point_defn_22 ).
cnf(c_0_46,negated_conjecture,
( sk26 = X1
| ~ incident_o(X1,sk25) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23]) ).
cnf(c_0_47,plain,
incident_o(ax0_sk8(ax2_sk3(X1)),X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
incident_o(ax0_sk7(ax2_sk3(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_44])]) ).
cnf(c_0_49,plain,
~ end_point(ax0_sk8(X1),X1),
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_50,negated_conjecture,
ax0_sk8(ax2_sk3(sk25)) = sk26,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
ax0_sk7(ax2_sk3(sk25)) = sk26,
inference(spm,[status(thm)],[c_0_46,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
~ end_point(sk26,ax2_sk3(sk25)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_51]),c_0_44])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : GEO127-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.06 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24 % Computer : n012.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Mon May 4 17:43:16 EDT 2026
% 0.06/0.25 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 1.13/1.62 % Version : CSE_E---1.7
% 1.13/1.62 % Problem : theBenchmark.p
% 1.13/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 1.13/1.62 % SZS output start CNFRefutation
% See solution above
% 1.13/1.62 % Total time : 1.361s
%------------------------------------------------------------------------------