%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO093-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 : n009.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:10 PM UTC 2026
% Result : Unsatisfiable 11.18s 2.40s
% Output : CNFRefutation 11.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 56 ( 13 unt; 16 nHn; 44 RR)
% Number of literals : 124 ( 31 equ; 52 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(proposition_2_14_2_71,negated_conjecture,
~ open(sum(sk15,sk16)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_2_71) ).
cnf(c1_35,axiom,
( ~ part_of(X1,X2)
| open(X1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c1_35) ).
cnf(part_of_defn_3,axiom,
( ~ incident_c(ax0_sk1(X1,X2),X2)
| part_of(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_3) ).
cnf(sum_defn_6,axiom,
( ~ incident_c(X4,X3)
| X1 != sum(X2,X3)
| incident_c(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',sum_defn_6) ).
cnf(sum_defn_5,axiom,
( ~ incident_c(X4,X2)
| X1 != sum(X2,X3)
| incident_c(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',sum_defn_5) ).
cnf(sum_defn_4,axiom,
( ~ incident_c(X4,X1)
| X1 != sum(X2,X3)
| incident_c(X4,X3)
| incident_c(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',sum_defn_4) ).
cnf(part_of_defn_1,axiom,
( ~ incident_c(X3,X1)
| ~ part_of(X1,X2)
| incident_c(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_1) ).
cnf(part_of_defn_2,axiom,
( part_of(X1,X2)
| incident_c(ax0_sk1(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_2) ).
cnf(proposition_2_14_2_68,negated_conjecture,
part_of(sk15,sk14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_2_68) ).
cnf(proposition_2_14_2_69,negated_conjecture,
part_of(sk16,sk14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_2_69) ).
cnf(c9_48,axiom,
( ~ incident_c(ax0_sk13(X1,X2),X2)
| ~ incident_c(ax0_sk13(X1,X2),X1)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c9_48) ).
cnf(c9_45,axiom,
( X2 = X1
| incident_c(ax0_sk13(X1,X2),X1)
| incident_c(ax0_sk13(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c9_45) ).
cnf(proposition_2_14_2_67,negated_conjecture,
open(sk14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_2_67) ).
cnf(c_0_13,negated_conjecture,
~ open(sum(sk15,sk16)),
inference(fof_simplification,[status(thm)],[proposition_2_14_2_71]) ).
cnf(c_0_14,plain,
( ~ part_of(X1,X2)
| open(X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[c1_35]) ).
cnf(c_0_15,negated_conjecture,
~ open(sum(sk15,sk16)),
c_0_13 ).
cnf(c_0_16,plain,
( ~ part_of(X1,X2)
| open(X1)
| X1 = X2 ),
c_0_14 ).
cnf(c_0_17,plain,
( ~ incident_c(ax0_sk1(X1,X2),X2)
| part_of(X1,X2) ),
inference(fof_simplification,[status(thm)],[part_of_defn_3]) ).
cnf(c_0_18,plain,
( ~ incident_c(X4,X3)
| X1 != sum(X2,X3)
| incident_c(X4,X1) ),
inference(fof_simplification,[status(thm)],[sum_defn_6]) ).
cnf(c_0_19,plain,
( ~ incident_c(X4,X2)
| X1 != sum(X2,X3)
| incident_c(X4,X1) ),
inference(fof_simplification,[status(thm)],[sum_defn_5]) ).
cnf(c_0_20,plain,
( ~ incident_c(X4,X1)
| X1 != sum(X2,X3)
| incident_c(X4,X3)
| incident_c(X4,X2) ),
inference(fof_simplification,[status(thm)],[sum_defn_4]) ).
cnf(c_0_21,negated_conjecture,
( ~ part_of(sum(sk15,sk16),X1)
| sum(sk15,sk16) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ incident_c(ax0_sk1(X1,X2),X2)
| part_of(X1,X2) ),
c_0_17 ).
cnf(c_0_23,plain,
( ~ incident_c(X4,X3)
| X1 != sum(X2,X3)
| incident_c(X4,X1) ),
c_0_18 ).
cnf(c_0_24,plain,
( ~ incident_c(X3,X1)
| ~ part_of(X1,X2)
| incident_c(X3,X2) ),
inference(fof_simplification,[status(thm)],[part_of_defn_1]) ).
cnf(c_0_25,plain,
( ~ incident_c(X4,X2)
| X1 != sum(X2,X3)
| incident_c(X4,X1) ),
c_0_19 ).
cnf(c_0_26,plain,
( ~ incident_c(X4,X1)
| X1 != sum(X2,X3)
| incident_c(X4,X3)
| incident_c(X4,X2) ),
c_0_20 ).
cnf(c_0_27,axiom,
( part_of(X1,X2)
| incident_c(ax0_sk1(X1,X2),X1) ),
part_of_defn_2 ).
cnf(c_0_28,negated_conjecture,
( ~ incident_c(ax0_sk1(sum(sk15,sk16),X1),X1)
| sum(sk15,sk16) = X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ incident_c(X1,X3)
| incident_c(X1,sum(X2,X3)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( ~ incident_c(X3,X1)
| ~ part_of(X1,X2)
| incident_c(X3,X2) ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
part_of(sk15,sk14),
proposition_2_14_2_68 ).
cnf(c_0_32,plain,
( ~ incident_c(X1,X2)
| incident_c(X1,sum(X2,X3)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ incident_c(X1,sum(X3,X2))
| incident_c(X1,X3)
| incident_c(X1,X2) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( incident_c(ax0_sk1(sum(sk15,sk16),X1),sum(sk15,sk16))
| sum(sk15,sk16) = X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ incident_c(ax0_sk1(sum(sk15,sk16),sum(X1,X2)),X2)
| sum(sk15,sk16) = sum(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( ~ incident_c(X1,sk15)
| incident_c(X1,sk14) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( ~ incident_c(ax0_sk1(sum(sk15,sk16),sum(X1,X2)),X1)
| sum(sk15,sk16) = sum(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( incident_c(ax0_sk1(sum(sk15,sk16),X1),sk15)
| incident_c(ax0_sk1(sum(sk15,sk16),X1),sk16)
| sum(sk15,sk16) = X1 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
sum(X1,sum(sk15,sk16)) = sum(sk15,sk16),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( ~ incident_c(ax0_sk1(sum(sk15,sk16),sum(X1,sk14)),sk15)
| sum(sk15,sk16) = sum(X1,sk14) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( incident_c(ax0_sk1(sum(sk15,sk16),sum(sk16,X1)),sk15)
| sum(sk16,X1) = sum(sk15,sk16) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
part_of(sk16,sk14),
proposition_2_14_2_69 ).
cnf(c_0_43,plain,
( ~ incident_c(ax0_sk13(X1,X2),X2)
| ~ incident_c(ax0_sk13(X1,X2),X1)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[c9_48]) ).
cnf(c_0_44,negated_conjecture,
( ~ incident_c(X1,X2)
| incident_c(X1,sum(sk15,sk16)) ),
inference(spm,[status(thm)],[c_0_32,c_0_39]) ).
cnf(c_0_45,axiom,
( X2 = X1
| incident_c(ax0_sk13(X1,X2),X1)
| incident_c(ax0_sk13(X1,X2),X2) ),
c9_45 ).
cnf(c_0_46,negated_conjecture,
sum(sk16,sk14) = sum(sk15,sk16),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( ~ incident_c(X1,sk16)
| incident_c(X1,sk14) ),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_48,plain,
( ~ incident_c(ax0_sk13(X1,X2),X2)
| ~ incident_c(ax0_sk13(X1,X2),X1)
| X2 = X1 ),
c_0_43 ).
cnf(c_0_49,negated_conjecture,
( incident_c(ax0_sk13(X1,X2),sum(sk15,sk16))
| X1 = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( ~ incident_c(X1,sum(sk15,sk16))
| incident_c(X1,sk14) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_46]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( ~ incident_c(ax0_sk13(X1,sum(sk15,sk16)),X1)
| X1 = sum(sk15,sk16) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( incident_c(ax0_sk13(X1,X2),sk14)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
sum(sk15,sk16) = sk14,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
open(sk14),
proposition_2_14_2_67 ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO093-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n009.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Sun Sep 20 10:40:12 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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
% 11.18/2.40 % Version: 3.5.1
% 11.18/2.40 % Preprocessing class: FSLSSMSSSSSNFFN.
% 11.18/2.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.18/2.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.18/2.40 % Starting new_bool_3 with 300s (1) cores
% 11.18/2.40 % Starting new_bool_1 with 300s (1) cores
% 11.18/2.40 % Starting sh5l with 300s (1) cores
% 11.18/2.40 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3352287 completed with status 0
% 11.18/2.40 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 11.18/2.40 % Preprocessing class: FSLSSMSSSSSNFFN.
% 11.18/2.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.18/2.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.18/2.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.18/2.40 % No SInE strategy applied
% 11.18/2.40 % Search class: FGHSF-FFMS31-SFFFFFNN
% 11.18/2.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.18/2.40 % Starting SubtermCWHack with 136s (1) cores
% 11.18/2.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 11.18/2.40 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 11.18/2.40 % Starting new_bool_3 with 189s (1) cores
% 11.18/2.40 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 11.18/2.40 % 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 3352297 completed with status 0
% 11.18/2.40 % Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 11.18/2.40 % Preprocessing class: FSLSSMSSSSSNFFN.
% 11.18/2.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.18/2.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.18/2.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.18/2.40 % No SInE strategy applied
% 11.18/2.40 % Search class: FGHSF-FFMS31-SFFFFFNN
% 11.18/2.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.18/2.40 % Starting SubtermCWHack with 136s (1) cores
% 11.18/2.40 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 11.18/2.40 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 11.18/2.40 % Starting new_bool_3 with 189s (1) cores
% 11.18/2.40 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 11.18/2.40 % Preprocessing time : 0.001 s
% 11.18/2.40 % Presaturation interreduction done
% 11.18/2.40
% 11.18/2.40 % Proof found!
% 11.18/2.40 % SZS status Unsatisfiable
% 11.18/2.40 % SZS output start CNFRefutation
% See solution above
% 11.18/2.40 % Parsed axioms : 53
% 11.18/2.40 % Removed by relevancy pruning/SinE : 0
% 11.18/2.40 % Initial clauses : 53
% 11.18/2.40 % Removed in clause preprocessing : 5
% 11.18/2.40 % Initial clauses in saturation : 48
% 11.18/2.40 % Processed clauses : 2627
% 11.18/2.40 % ...of these trivial : 115
% 11.18/2.40 % ...subsumed : 887
% 11.18/2.40 % ...remaining for further processing : 1625
% 11.18/2.40 % Other redundant clauses eliminated : 4
% 11.18/2.40 % Clauses deleted for lack of memory : 0
% 11.18/2.40 % Backward-subsumed : 62
% 11.18/2.40 % Backward-rewritten : 340
% 11.18/2.40 % Generated clauses : 31434
% 11.18/2.40 % ...of the previous two non-redundant : 27889
% 11.18/2.40 % ...aggressively subsumed : 0
% 11.18/2.40 % Contextual simplify-reflections : 19
% 11.18/2.40 % Paramodulations : 31336
% 11.18/2.40 % Factorizations : 94
% 11.18/2.40 % NegExts : 0
% 11.18/2.40 % Equation resolutions : 4
% 11.18/2.40 % Disequality decompositions : 0
% 11.18/2.40 % Total rewrite steps : 5506
% 11.18/2.40 % ...of those cached : 4180
% 11.18/2.40 % Propositional unsat checks : 0
% 11.18/2.40 % Propositional check models : 0
% 11.18/2.40 % Propositional check unsatisfiable : 0
% 11.18/2.40 % Propositional clauses : 0
% 11.18/2.40 % Propositional clauses after purity: 0
% 11.18/2.40 % Propositional unsat core size : 0
% 11.18/2.40 % Propositional preprocessing time : 0.000
% 11.18/2.40 % Propositional encoding time : 0.000
% 11.18/2.40 % Propositional solver time : 0.000
% 11.18/2.40 % Success case prop preproc time : 0.000
% 11.18/2.40 % Success case prop encoding time : 0.000
% 11.18/2.40 % Success case prop solver time : 0.000
% 11.18/2.40 % Current number of processed clauses : 1171
% 11.18/2.40 % Positive orientable unit clauses : 126
% 11.18/2.40 % Positive unorientable unit clauses: 0
% 11.18/2.40 % Negative unit clauses : 10
% 11.18/2.40 % Non-unit-clauses : 1035
% 11.18/2.40 % Current number of unprocessed clauses: 24962
% 11.18/2.40 % ...number of literals in the above : 124905
% 11.18/2.40 % Current number of archived formulas : 0
% 11.18/2.40 % Current number of archived clauses : 450
% 11.18/2.40 % Clause-clause subsumption calls (NU) : 259576
% 11.18/2.40 % Rec. Clause-clause subsumption calls : 129690
% 11.18/2.40 % Non-unit clause-clause subsumptions : 590
% 11.18/2.40 % Unit Clause-clause subsumption calls : 3581
% 11.18/2.40 % Rewrite failures with RHS unbound : 0
% 11.18/2.40 % BW rewrite match attempts : 663
% 11.18/2.40 % BW rewrite match successes : 125
% 11.18/2.40 % Condensation attempts : 0
% 11.18/2.40 % Condensation successes : 0
% 11.18/2.40 % Termbank termtop insertions : 729525
% 11.18/2.40 % Search garbage collected termcells : 128
% 11.18/2.40
% 11.18/2.40 % -------------------------------------------------
% 11.18/2.40 % User time : 0.844 s
% 11.18/2.40 % System time : 0.037 s
% 11.18/2.40 % Total time : 0.881 s
% 11.18/2.40 % Maximum resident set size: 3680 pages
% 11.18/2.40
% 11.18/2.40 % -------------------------------------------------
% 11.18/2.40 % User time : 7.100 s
% 11.18/2.40 % System time : 0.281 s
% 11.18/2.40 % Total time : 7.381 s
% 11.18/2.40 % Maximum resident set size: 4864 pages
% 11.18/2.40 % E exiting
%------------------------------------------------------------------------------