%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL091-2 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:10:05 PM UTC 2026
% Result : Unsatisfiable 0.13s 5.51s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 13 unt; 3 nHn; 35 RR)
% Number of literals : 66 ( 16 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 72 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k1_contractD_c1,negated_conjecture,
( ~ member(pair(p,X1),contract)
| r != comb_app(combK,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_contractD_c1) ).
cnf(ap_contractE13,axiom,
( ~ ap_contractE_c4(X1,X2,X3)
| member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE13) ).
cnf(ap_contractE15,axiom,
( ~ ap_contractE_c4(X1,X2,X3)
| X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE15) ).
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_contractE) ).
cnf(ap_contractE10,axiom,
( ~ ap_contractE_c3(X1,X2,X3)
| member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE10) ).
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_app) ).
cnf(ap_contractE9,axiom,
( ~ ap_contractE_c2(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE9) ).
cnf(ap_contractE1,axiom,
( ~ member(pair(comb_app(X1,X2),X3),contract)
| ap_contractE_c4(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE1) ).
cnf(ap_contractE4,axiom,
( ~ ap_contractE_c1(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE4) ).
cnf(k1_contractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_contractD_h1) ).
cnf(c_0_10,negated_conjecture,
( ~ member(pair(p,X1),contract)
| r != comb_app(combK,X1) ),
inference(fof_simplification,[status(thm)],[k1_contractD_c1]) ).
cnf(c_0_11,plain,
( ~ ap_contractE_c4(X1,X2,X3)
| member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract) ),
inference(fof_simplification,[status(thm)],[ap_contractE13]) ).
cnf(c_0_12,negated_conjecture,
( ~ member(pair(p,X1),contract)
| r != comb_app(combK,X1) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ ap_contractE_c4(X1,X2,X3)
| member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ ap_contractE_c4(X1,X2,X3)
| X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[ap_contractE15]) ).
cnf(c_0_15,plain,
~ member(pair(combK,X1),contract),
inference(fof_simplification,[status(thm)],[k_contractE]) ).
cnf(c_0_16,plain,
( ~ ap_contractE_c3(X1,X2,X3)
| member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract) ),
inference(fof_simplification,[status(thm)],[ap_contractE10]) ).
cnf(c_0_17,plain,
combK != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[k_app]) ).
cnf(c_0_18,plain,
( ~ ap_contractE_c2(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[ap_contractE9]) ).
cnf(c_0_19,negated_conjecture,
( ~ ap_contractE_c4(X1,p,X2)
| comb_app(combK,ap_contractE_sk3q(X1,p,X2)) != r ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( ~ ap_contractE_c4(X1,X2,X3)
| X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3)) ),
c_0_14 ).
cnf(c_0_21,plain,
( ~ member(pair(comb_app(X1,X2),X3),contract)
| ap_contractE_c4(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE1]) ).
cnf(c_0_22,plain,
~ member(pair(combK,X1),contract),
c_0_15 ).
cnf(c_0_23,plain,
( ~ ap_contractE_c3(X1,X2,X3)
| member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract) ),
c_0_16 ).
cnf(c_0_24,plain,
combK != comb_app(X1,X2),
c_0_17 ).
cnf(c_0_25,plain,
( ~ ap_contractE_c2(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3)) ),
c_0_18 ).
cnf(c_0_26,plain,
( ~ ap_contractE_c1(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE4]) ).
cnf(c_0_27,negated_conjecture,
~ ap_contractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_28,plain,
( ~ member(pair(comb_app(X1,X2),X3),contract)
| ap_contractE_c4(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c1(X1,X2,X3) ),
c_0_21 ).
cnf(c_0_29,hypothesis,
member(pair(comb_app(combK,p),r),contract),
k1_contractD_h1 ).
cnf(c_0_30,plain,
~ ap_contractE_c3(combK,X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
~ ap_contractE_c2(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_32,plain,
( ~ ap_contractE_c1(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
ap_contractE_c1(combK,p,r),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL091-2 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n001.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 14:15:35 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.42 Running first-order theorem proving
% 0.13/5.42 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.13/5.51 % Version: 3.5.1
% 0.13/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.51 % Starting sh5l with 300s (1) cores
% 0.13/5.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3333532 completed with status 0
% 0.13/5.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.51 % No SInE strategy applied
% 0.13/5.51 % Search class: FGHSM-FFLS32-MFFFFFNN
% 0.13/5.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.51 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/5.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/5.51 % Starting new_bool_3 with 136s (1) cores
% 0.13/5.51 % Starting new_bool_1 with 136s (1) cores
% 0.13/5.51 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3333541 completed with status 0
% 0.13/5.51 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.51 % No SInE strategy applied
% 0.13/5.51 % Search class: FGHSM-FFLS32-MFFFFFNN
% 0.13/5.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.51 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/5.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/5.51 % Preprocessing time : 0.003 s
% 0.13/5.51 % Presaturation interreduction done
% 0.13/5.51
% 0.13/5.51 % Proof found!
% 0.13/5.51 % SZS status Unsatisfiable
% 0.13/5.51 % SZS output start CNFRefutation
% See solution above
% 0.13/5.51 % Parsed axioms : 175
% 0.13/5.51 % Removed by relevancy pruning/SinE : 0
% 0.13/5.51 % Initial clauses : 175
% 0.13/5.51 % Removed in clause preprocessing : 4
% 0.13/5.51 % Initial clauses in saturation : 171
% 0.13/5.51 % Processed clauses : 898
% 0.13/5.51 % ...of these trivial : 55
% 0.13/5.51 % ...subsumed : 337
% 0.13/5.51 % ...remaining for further processing : 506
% 0.13/5.51 % Other redundant clauses eliminated : 49
% 0.13/5.51 % Clauses deleted for lack of memory : 0
% 0.13/5.51 % Backward-subsumed : 3
% 0.13/5.51 % Backward-rewritten : 26
% 0.13/5.51 % Generated clauses : 2632
% 0.13/5.51 % ...of the previous two non-redundant : 2541
% 0.13/5.51 % ...aggressively subsumed : 0
% 0.13/5.51 % Contextual simplify-reflections : 0
% 0.13/5.51 % Paramodulations : 2571
% 0.13/5.51 % Factorizations : 0
% 0.13/5.51 % NegExts : 0
% 0.13/5.51 % Equation resolutions : 61
% 0.13/5.51 % Disequality decompositions : 0
% 0.13/5.51 % Total rewrite steps : 1298
% 0.13/5.51 % ...of those cached : 1253
% 0.13/5.51 % Propositional unsat checks : 0
% 0.13/5.51 % Propositional check models : 0
% 0.13/5.51 % Propositional check unsatisfiable : 0
% 0.13/5.51 % Propositional clauses : 0
% 0.13/5.51 % Propositional clauses after purity: 0
% 0.13/5.51 % Propositional unsat core size : 0
% 0.13/5.51 % Propositional preprocessing time : 0.000
% 0.13/5.51 % Propositional encoding time : 0.000
% 0.13/5.51 % Propositional solver time : 0.000
% 0.13/5.51 % Success case prop preproc time : 0.000
% 0.13/5.51 % Success case prop encoding time : 0.000
% 0.13/5.51 % Success case prop solver time : 0.000
% 0.13/5.51 % Current number of processed clauses : 309
% 0.13/5.51 % Positive orientable unit clauses : 39
% 0.13/5.51 % Positive unorientable unit clauses: 0
% 0.13/5.51 % Negative unit clauses : 72
% 0.13/5.51 % Non-unit-clauses : 198
% 0.13/5.51 % Current number of unprocessed clauses: 1880
% 0.13/5.51 % ...number of literals in the above : 3984
% 0.13/5.51 % Current number of archived formulas : 0
% 0.13/5.51 % Current number of archived clauses : 192
% 0.13/5.51 % Clause-clause subsumption calls (NU) : 10988
% 0.13/5.51 % Rec. Clause-clause subsumption calls : 9602
% 0.13/5.51 % Non-unit clause-clause subsumptions : 11
% 0.13/5.51 % Unit Clause-clause subsumption calls : 4667
% 0.13/5.51 % Rewrite failures with RHS unbound : 0
% 0.13/5.51 % BW rewrite match attempts : 33
% 0.13/5.51 % BW rewrite match successes : 18
% 0.13/5.51 % Condensation attempts : 0
% 0.13/5.51 % Condensation successes : 0
% 0.13/5.51 % Termbank termtop insertions : 33132
% 0.13/5.51 % Search garbage collected termcells : 341
% 0.13/5.51
% 0.13/5.51 % -------------------------------------------------
% 0.13/5.51 % User time : 0.067 s
% 0.13/5.51 % System time : 0.008 s
% 0.13/5.51 % Total time : 0.075 s
% 0.13/5.51 % Maximum resident set size: 3776 pages
% 0.13/5.51
% 0.13/5.51 % -------------------------------------------------
% 0.13/5.51 % User time : 0.327 s
% 0.13/5.51 % System time : 0.041 s
% 0.13/5.51 % Total time : 0.369 s
% 0.13/5.51 % Maximum resident set size: 4864 pages
% 0.13/5.51 % E exiting
%------------------------------------------------------------------------------