%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL092-2 : TPTP v9.2.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n016.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:12:19 PM UTC 2026
% Result : Unsatisfiable 30.12s 17.78s
% Output : CNFRefutation 30.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 11 unt; 6 nHn; 45 RR)
% Number of literals : 88 ( 21 equ; 40 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 : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 76 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_app) ).
cnf(ap_parcontractE11,axiom,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE11) ).
cnf(k_parcontractE2,axiom,
( X1 = combK
| ~ member(pair(combK,X1),parcontract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_parcontractE2) ).
cnf(ap_parcontractE12,axiom,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE12) ).
cnf(ap_parcontractE1,axiom,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE1) ).
cnf(k1_parcontractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),parcontract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_parcontractD_h1) ).
cnf(k1_parcontractD_c1,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),parcontract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_parcontractD_c1) ).
cnf(ap_parcontractE13,axiom,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE13) ).
cnf(ap_parcontractE14,axiom,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE14) ).
cnf(ap_parcontractE3,axiom,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE3) ).
cnf(parcontract_intros1,axiom,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',parcontract_intros1) ).
cnf(ap_parcontractE6,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE6) ).
cnf(ap_parcontractE2,axiom,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE2) ).
cnf(ap_E2,axiom,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_E2) ).
cnf(ap_parcontractE4,axiom,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_parcontractE4) ).
cnf(c_0_15,axiom,
combK != comb_app(X1,X2),
k_app ).
cnf(c_0_16,axiom,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
ap_parcontractE11 ).
cnf(c_0_17,axiom,
( X1 = combK
| ~ member(pair(combK,X1),parcontract) ),
k_parcontractE2 ).
cnf(c_0_18,axiom,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
ap_parcontractE12 ).
cnf(c_0_19,axiom,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
ap_parcontractE1 ).
cnf(c_0_20,hypothesis,
member(pair(comb_app(combK,p),r),parcontract),
k1_parcontractD_h1 ).
cnf(c_0_21,plain,
~ ap_parcontractE_c3(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),parcontract) ),
k1_parcontractD_c1 ).
cnf(c_0_23,axiom,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
ap_parcontractE13 ).
cnf(c_0_24,axiom,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
ap_parcontractE14 ).
cnf(c_0_25,plain,
( ap_parcontractE_sk2q(combK,X1,X2) = combK
| ~ ap_parcontractE_c4(combK,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,axiom,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
ap_parcontractE3 ).
cnf(c_0_27,hypothesis,
( ap_parcontractE_c4(combK,p,r)
| ap_parcontractE_c2(combK,p,r)
| ap_parcontractE_c1(combK,p,r) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( comb_app(combK,ap_parcontractE_sk2s(X1,p,X2)) != r
| ~ ap_parcontractE_c4(X1,p,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( comb_app(combK,ap_parcontractE_sk2s(combK,X1,X2)) = X2
| ~ ap_parcontractE_c4(combK,X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,hypothesis,
( comb_app(combK,p) = r
| ap_parcontractE_c4(combK,p,r)
| ap_parcontractE_c2(combK,p,r) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ ap_parcontractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,axiom,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
parcontract_intros1 ).
cnf(c_0_33,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
ap_parcontractE6 ).
cnf(c_0_34,hypothesis,
( comb_app(combK,p) = r
| ap_parcontractE_c2(combK,p,r) ),
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( comb_app(combK,p) != r
| ~ member(p,comb) ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_36,hypothesis,
comb_app(combK,p) = r,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15]) ).
cnf(c_0_37,axiom,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
ap_parcontractE2 ).
cnf(c_0_38,axiom,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
ap_E2 ).
cnf(c_0_39,negated_conjecture,
~ member(p,comb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,hypothesis,
( ap_parcontractE_c4(combK,p,r)
| ap_parcontractE_c2(combK,p,r)
| member(comb_app(combK,p),comb) ),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_41,hypothesis,
~ member(r,comb),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_39]) ).
cnf(c_0_42,axiom,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
ap_parcontractE4 ).
cnf(c_0_43,hypothesis,
ap_parcontractE_c2(combK,p,r),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_40,c_0_31]),c_0_36]),c_0_41]) ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : COL092-2 : TPTP v9.2.1. Released v2.7.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34 % Computer : n016.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Mon May 4 16:17:21 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.19/0.35 % start to proof: theBenchmark
% 30.12/17.78 % Version : CSE_E---1.7
% 30.12/17.78 % Problem : theBenchmark.p
% 30.12/17.78 % SZS status Unsatisfiable for theBenchmark.p
% 30.12/17.78 % SZS output start CNFRefutation
% See solution above
% 30.23/17.89 % Total time : 13.400s
%------------------------------------------------------------------------------