%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL092-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 : n003.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:09:35 PM UTC 2026
% Result : Unsatisfiable 0.61s 0.71s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 55 ( 12 unt; 6 nHn; 55 RR)
% Number of literals : 113 ( 27 equ; 53 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 107 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_parcontractE2,axiom,
( ~ member(pair(combK,X1),parcontract)
| X1 = combK ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_parcontractE2) ).
cnf(ap_parcontractE12,axiom,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE12) ).
cnf(k1_parcontractD_c1,negated_conjecture,
( ~ member(pair(p,X1),parcontract)
| r != comb_app(combK,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_parcontractD_c1) ).
cnf(ap_parcontractE13,axiom,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE13) ).
cnf(ap_parcontractE14,axiom,
( ~ ap_parcontractE_c4(X1,X2,X3)
| X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE14) ).
cnf(ap_parcontractE2,axiom,
( ~ ap_parcontractE_c1(X1,X2,X3)
| member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE2) ).
cnf(ap_parcontractE1,axiom,
( ~ member(pair(comb_app(X1,X2),X3),parcontract)
| ap_parcontractE_c4(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE1) ).
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_app) ).
cnf(ap_parcontractE11,axiom,
( ~ ap_parcontractE_c3(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE11) ).
cnf(ap_parcontractE6,axiom,
( ~ ap_parcontractE_c2(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE6) ).
cnf(k1_parcontractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),parcontract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_parcontractD_h1) ).
cnf(parcontract_intros1,axiom,
( ~ member(X1,comb)
| member(pair(X1,X1),parcontract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',parcontract_intros1) ).
cnf(ap_E2,axiom,
( ~ member(comb_app(X1,X2),comb)
| member(X2,comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_E2) ).
cnf(ap_parcontractE3,axiom,
( ~ ap_parcontractE_c1(X1,X2,X3)
| X3 = comb_app(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE3) ).
cnf(c_0_14,plain,
( ~ member(pair(combK,X1),parcontract)
| X1 = combK ),
inference(fof_simplification,[status(thm)],[k_parcontractE2]) ).
cnf(c_0_15,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE12]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(pair(p,X1),parcontract)
| r != comb_app(combK,X1) ),
inference(fof_simplification,[status(thm)],[k1_parcontractD_c1]) ).
cnf(c_0_17,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE13]) ).
cnf(c_0_18,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE14]) ).
cnf(c_0_19,plain,
( ~ member(pair(combK,X1),parcontract)
| X1 = combK ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( ~ member(pair(p,X1),parcontract)
| r != comb_app(combK,X1) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract) ),
c_0_17 ).
cnf(c_0_23,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3)) ),
c_0_18 ).
cnf(c_0_24,plain,
( ~ ap_parcontractE_c4(combK,X1,X2)
| ap_parcontractE_sk2q(combK,X1,X2) = combK ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ ap_parcontractE_c1(X1,X2,X3)
| member(comb_app(X1,X2),comb) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE2]) ).
cnf(c_0_26,plain,
( ~ member(pair(comb_app(X1,X2),X3),parcontract)
| ap_parcontractE_c4(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE1]) ).
cnf(c_0_27,plain,
combK != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[k_app]) ).
cnf(c_0_28,plain,
( ~ ap_parcontractE_c3(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE11]) ).
cnf(c_0_29,negated_conjecture,
( ~ ap_parcontractE_c4(X1,p,X2)
| comb_app(combK,ap_parcontractE_sk2s(X1,p,X2)) != r ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( ~ ap_parcontractE_c4(combK,X1,X2)
| comb_app(combK,ap_parcontractE_sk2s(combK,X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ ap_parcontractE_c1(X1,X2,X3)
| member(comb_app(X1,X2),comb) ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ member(pair(comb_app(X1,X2),X3),parcontract)
| ap_parcontractE_c4(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c1(X1,X2,X3) ),
c_0_26 ).
cnf(c_0_33,plain,
combK != comb_app(X1,X2),
c_0_27 ).
cnf(c_0_34,plain,
( ~ ap_parcontractE_c3(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3)) ),
c_0_28 ).
cnf(c_0_35,plain,
( ~ ap_parcontractE_c2(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE6]) ).
cnf(c_0_36,negated_conjecture,
~ ap_parcontractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_37,plain,
( ~ member(pair(comb_app(X1,X2),X3),parcontract)
| member(comb_app(X1,X2),comb)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,hypothesis,
member(pair(comb_app(combK,p),r),parcontract),
k1_parcontractD_h1 ).
cnf(c_0_39,plain,
~ ap_parcontractE_c3(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_40,plain,
( ~ member(X1,comb)
| member(pair(X1,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[parcontract_intros1]) ).
cnf(c_0_41,plain,
( ~ member(comb_app(X1,X2),comb)
| member(X2,comb) ),
inference(fof_simplification,[status(thm)],[ap_E2]) ).
cnf(c_0_42,plain,
( ~ ap_parcontractE_c2(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
c_0_35 ).
cnf(c_0_43,negated_conjecture,
( member(comb_app(combK,p),comb)
| ap_parcontractE_c2(combK,p,r) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_44,plain,
( ~ ap_parcontractE_c1(X1,X2,X3)
| X3 = comb_app(X1,X2) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE3]) ).
cnf(c_0_45,plain,
( ~ member(X1,comb)
| member(pair(X1,X1),parcontract) ),
c_0_40 ).
cnf(c_0_46,plain,
( ~ member(comb_app(X1,X2),comb)
| member(X2,comb) ),
c_0_41 ).
cnf(c_0_47,negated_conjecture,
member(comb_app(combK,p),comb),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_33]) ).
cnf(c_0_48,plain,
( ~ ap_parcontractE_c1(X1,X2,X3)
| X3 = comb_app(X1,X2) ),
c_0_44 ).
cnf(c_0_49,negated_conjecture,
( ~ member(p,comb)
| comb_app(combK,p) != r ),
inference(spm,[status(thm)],[c_0_21,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
member(p,comb),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ member(pair(comb_app(X2,X3),X1),parcontract)
| ap_parcontractE_c2(X2,X3,X1)
| ap_parcontractE_c3(X2,X3,X1)
| ap_parcontractE_c4(X2,X3,X1)
| X1 = comb_app(X2,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_52,negated_conjecture,
comb_app(combK,p) != r,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_53,negated_conjecture,
ap_parcontractE_c2(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_36,c_0_51]),c_0_38])]),c_0_52]),c_0_39]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_53]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COL092-2 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n003.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 14:11:31 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.61/0.70 % Version: 3.5.1
% 0.61/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.70 % Starting sh5l with 300s (1) cores
% 0.61/0.70 % sh5l with pid 312023 completed with status 0
% 0.61/0.70 % Result found by sh5l
% 0.61/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.70 % Starting sh5l with 300s (1) cores
% 0.61/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.61/0.70 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.61/0.70 % Search class: FGHSF-FFMS32-MFFFFFNN
% 0.61/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.70 % Starting SubtermCWHack with 31s (1) cores
% 0.61/0.70 % SubtermCWHack with pid 312026 completed with status 0
% 0.61/0.70 % Result found by SubtermCWHack
% 0.61/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.71 % Starting sh5l with 300s (1) cores
% 0.61/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.61/0.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.61/0.71 % Search class: FGHSF-FFMS32-MFFFFFNN
% 0.61/0.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.71 % Starting SubtermCWHack with 31s (1) cores
% 0.61/0.71 % Preprocessing time : 0.003 s
% 0.61/0.71
% 0.61/0.71 % Proof found!
% 0.61/0.71 % SZS status Unsatisfiable
% 0.61/0.71 % SZS output start CNFRefutation
% See solution above
% 0.61/0.71 % Parsed axioms : 197
% 0.61/0.71 % Removed by relevancy pruning/SinE : 139
% 0.61/0.71 % Initial clauses : 58
% 0.61/0.71 % Removed in clause preprocessing : 1
% 0.61/0.71 % Initial clauses in saturation : 57
% 0.61/0.71 % Processed clauses : 617
% 0.61/0.71 % ...of these trivial : 2
% 0.61/0.71 % ...subsumed : 240
% 0.61/0.71 % ...remaining for further processing : 375
% 0.61/0.71 % Other redundant clauses eliminated : 79
% 0.61/0.71 % Clauses deleted for lack of memory : 0
% 0.61/0.71 % Backward-subsumed : 4
% 0.61/0.71 % Backward-rewritten : 2
% 0.61/0.71 % Generated clauses : 1953
% 0.61/0.71 % ...of the previous two non-redundant : 1791
% 0.61/0.71 % ...aggressively subsumed : 0
% 0.61/0.71 % Contextual simplify-reflections : 3
% 0.61/0.71 % Paramodulations : 1870
% 0.61/0.71 % Factorizations : 0
% 0.61/0.71 % NegExts : 0
% 0.61/0.71 % Equation resolutions : 83
% 0.61/0.71 % Disequality decompositions : 0
% 0.61/0.71 % Total rewrite steps : 148
% 0.61/0.71 % ...of those cached : 143
% 0.61/0.71 % Propositional unsat checks : 0
% 0.61/0.71 % Propositional check models : 0
% 0.61/0.71 % Propositional check unsatisfiable : 0
% 0.61/0.71 % Propositional clauses : 0
% 0.61/0.71 % Propositional clauses after purity: 0
% 0.61/0.71 % Propositional unsat core size : 0
% 0.61/0.71 % Propositional preprocessing time : 0.000
% 0.61/0.71 % Propositional encoding time : 0.000
% 0.61/0.71 % Propositional solver time : 0.000
% 0.61/0.71 % Success case prop preproc time : 0.000
% 0.61/0.71 % Success case prop encoding time : 0.000
% 0.61/0.71 % Success case prop solver time : 0.000
% 0.61/0.71 % Current number of processed clauses : 369
% 0.61/0.71 % Positive orientable unit clauses : 6
% 0.61/0.71 % Positive unorientable unit clauses: 0
% 0.61/0.71 % Negative unit clauses : 43
% 0.61/0.71 % Non-unit-clauses : 320
% 0.61/0.71 % Current number of unprocessed clauses: 1224
% 0.61/0.71 % ...number of literals in the above : 5070
% 0.61/0.71 % Current number of archived formulas : 0
% 0.61/0.71 % Current number of archived clauses : 6
% 0.61/0.71 % Clause-clause subsumption calls (NU) : 16734
% 0.61/0.71 % Rec. Clause-clause subsumption calls : 12851
% 0.61/0.71 % Non-unit clause-clause subsumptions : 189
% 0.61/0.71 % Unit Clause-clause subsumption calls : 785
% 0.61/0.71 % Rewrite failures with RHS unbound : 0
% 0.61/0.71 % BW rewrite match attempts : 2
% 0.61/0.71 % BW rewrite match successes : 2
% 0.61/0.71 % Condensation attempts : 0
% 0.61/0.71 % Condensation successes : 0
% 0.61/0.71 % Termbank termtop insertions : 27946
% 0.61/0.71 % Search garbage collected termcells : 699
% 0.61/0.71
% 0.61/0.71 % -------------------------------------------------
% 0.61/0.71 % User time : 0.094 s
% 0.61/0.71 % System time : 0.009 s
% 0.61/0.71 % Total time : 0.103 s
% 0.61/0.71 % Maximum resident set size: 4048 pages
% 0.61/0.71
% 0.61/0.71 % -------------------------------------------------
% 0.61/0.71 % User time : 0.102 s
% 0.61/0.71 % System time : 0.016 s
% 0.61/0.71 % Total time : 0.117 s
% 0.61/0.71 % Maximum resident set size: 4608 pages
% 0.61/0.71 % E exiting
%------------------------------------------------------------------------------