%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL095-1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:36 PM UTC 2026
% Result : Unsatisfiable 9.32s 1.81s
% Output : CNFRefutation 9.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of clauses : 95 ( 20 unt; 7 nHn; 95 RR)
% Number of literals : 192 ( 41 equ; 98 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 : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 186 ( 39 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ap_E2,axiom,
( ~ member(comb_app(X1,X2),comb)
| member(X2,comb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_E2) ).
cnf(k1_parcontractD_1,axiom,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| X2 = comb_app(combK,k1_parcontractD_sk1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k1_parcontractD_1) ).
cnf(parcontract_combD2,axiom,
( ~ member(pair(X1,X2),parcontract)
| member(X2,comb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',parcontract_combD2) ).
cnf(app_app1,axiom,
( comb_app(X1,X2) != comb_app(X3,X4)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',app_app1) ).
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/sandbox/benchmark/theBenchmark.p',ap_parcontractE11) ).
cnf(parcontract_intros2,axiom,
( ~ member(X2,comb)
| ~ member(X1,comb)
| member(pair(comb_app(comb_app(combK,X1),X2),X1),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',parcontract_intros2) ).
cnf(ap_parcontractE13,axiom,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_parcontractE13) ).
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_app) ).
cnf(diamond_parcontract_2c2,negated_conjecture,
( ~ member(pair(yp,X1),parcontract)
| ~ member(pair(p,X1),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_parcontract_2c2) ).
cnf(k1_parcontractD_2,axiom,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| member(pair(X1,k1_parcontractD_sk1(X1,X2)),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k1_parcontractD_2) ).
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/sandbox/benchmark/theBenchmark.p',ap_parcontractE14) ).
cnf(app_app2,axiom,
( comb_app(X1,X2) != comb_app(X3,X4)
| X2 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',app_app2) ).
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/sandbox/benchmark/theBenchmark.p',ap_parcontractE1) ).
cnf(k_parcontractE2,axiom,
( ~ member(pair(combK,X1),parcontract)
| X1 = combK ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_parcontractE2) ).
cnf(ap_parcontractE3,axiom,
( ~ ap_parcontractE_c1(X1,X2,X3)
| X3 = comb_app(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_parcontractE3) ).
cnf(diamond_parcontract_2c1,negated_conjecture,
member(pair(comb_app(comb_app(combK,p),q),yp),parcontract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_parcontract_2c1) ).
cnf(ap_parcontractE12,axiom,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_parcontractE12) ).
cnf(parcontract_intros4,axiom,
( ~ member(pair(X3,X4),parcontract)
| ~ member(pair(X1,X2),parcontract)
| member(pair(comb_app(X1,X3),comb_app(X2,X4)),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',parcontract_intros4) ).
cnf(ap_parcontractE6,axiom,
( ~ ap_parcontractE_c2(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_parcontractE6) ).
cnf(parcontract_intros1,axiom,
( ~ member(X1,comb)
| member(pair(X1,X1),parcontract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',parcontract_intros1) ).
cnf(diamond_parcontract_2h1,hypothesis,
member(p,comb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_parcontract_2h1) ).
cnf(comb_intros1,axiom,
member(combK,comb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',comb_intros1) ).
cnf(diamond_parcontract_2h2,hypothesis,
member(q,comb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_parcontract_2h2) ).
cnf(c_0_23,plain,
( ~ member(comb_app(X1,X2),comb)
| member(X2,comb) ),
inference(fof_simplification,[status(thm)],[ap_E2]) ).
cnf(c_0_24,plain,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| X2 = comb_app(combK,k1_parcontractD_sk1(X1,X2)) ),
inference(fof_simplification,[status(thm)],[k1_parcontractD_1]) ).
cnf(c_0_25,plain,
( ~ member(pair(X1,X2),parcontract)
| member(X2,comb) ),
inference(fof_simplification,[status(thm)],[parcontract_combD2]) ).
cnf(c_0_26,plain,
( comb_app(X1,X2) != comb_app(X3,X4)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[app_app1]) ).
cnf(c_0_27,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_28,plain,
( ~ member(X2,comb)
| ~ member(X1,comb)
| member(pair(comb_app(comb_app(combK,X1),X2),X1),parcontract) ),
inference(fof_simplification,[status(thm)],[parcontract_intros2]) ).
cnf(c_0_29,plain,
( ~ member(comb_app(X1,X2),comb)
| member(X2,comb) ),
c_0_23 ).
cnf(c_0_30,plain,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| X2 = comb_app(combK,k1_parcontractD_sk1(X1,X2)) ),
c_0_24 ).
cnf(c_0_31,plain,
( ~ member(pair(X1,X2),parcontract)
| member(X2,comb) ),
c_0_25 ).
cnf(c_0_32,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_33,plain,
combK != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[k_app]) ).
cnf(c_0_34,plain,
( comb_app(X1,X2) != comb_app(X3,X4)
| X1 = X3 ),
c_0_26 ).
cnf(c_0_35,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_27 ).
cnf(c_0_36,negated_conjecture,
( ~ member(pair(yp,X1),parcontract)
| ~ member(pair(p,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[diamond_parcontract_2c2]) ).
cnf(c_0_37,plain,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| member(pair(X1,k1_parcontractD_sk1(X1,X2)),parcontract) ),
inference(fof_simplification,[status(thm)],[k1_parcontractD_2]) ).
cnf(c_0_38,plain,
( ~ member(X2,comb)
| ~ member(X1,comb)
| member(pair(comb_app(comb_app(combK,X1),X2),X1),parcontract) ),
c_0_28 ).
cnf(c_0_39,plain,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| member(k1_parcontractD_sk1(X1,X2),comb) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_40,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_41,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract) ),
c_0_32 ).
cnf(c_0_42,plain,
( comb_app(X1,X2) != comb_app(X3,X4)
| X2 = X4 ),
inference(fof_simplification,[status(thm)],[app_app2]) ).
cnf(c_0_43,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_44,plain,
combK != comb_app(X1,X2),
c_0_33 ).
cnf(c_0_45,plain,
( ~ ap_parcontractE_c3(comb_app(X1,X2),X3,X4)
| comb_app(combS,ap_parcontractE_sk1p(comb_app(X1,X2),X3,X4)) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
( ~ member(pair(yp,X1),parcontract)
| ~ member(pair(p,X1),parcontract) ),
c_0_36 ).
cnf(c_0_47,plain,
( ~ member(pair(comb_app(combK,X1),X2),parcontract)
| member(pair(X1,k1_parcontractD_sk1(X1,X2)),parcontract) ),
c_0_37 ).
cnf(c_0_48,plain,
( ~ member(X2,comb)
| ~ member(pair(comb_app(combK,X3),X1),parcontract)
| member(pair(comb_app(X1,X2),k1_parcontractD_sk1(X3,X1)),parcontract) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_39]) ).
cnf(c_0_49,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3)) ),
c_0_40 ).
cnf(c_0_50,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(ap_parcontractE_sk2s(X1,X2,X3),comb) ),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_51,plain,
( ~ member(pair(combK,X1),parcontract)
| X1 = combK ),
inference(fof_simplification,[status(thm)],[k_parcontractE2]) ).
cnf(c_0_52,plain,
( comb_app(X1,X2) != comb_app(X3,X4)
| X2 = X4 ),
c_0_42 ).
cnf(c_0_53,plain,
( ~ ap_parcontractE_c1(X1,X2,X3)
| X3 = comb_app(X1,X2) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE3]) ).
cnf(c_0_54,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_43 ).
cnf(c_0_55,negated_conjecture,
member(pair(comb_app(comb_app(combK,p),q),yp),parcontract),
diamond_parcontract_2c1 ).
cnf(c_0_56,plain,
~ ap_parcontractE_c3(comb_app(combK,X1),X2,X3),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_57,negated_conjecture,
( ~ member(pair(comb_app(combK,p),X1),parcontract)
| ~ member(pair(yp,k1_parcontractD_sk1(p,X1)),parcontract) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_58,plain,
( ~ member(pair(comb_app(combK,X2),ap_parcontractE_sk2q(X3,X4,X1)),parcontract)
| ~ ap_parcontractE_c4(X3,X4,X1)
| member(pair(X1,k1_parcontractD_sk1(X2,ap_parcontractE_sk2q(X3,X4,X1))),parcontract) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_59,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_60,plain,
( ~ member(pair(combK,X1),parcontract)
| X1 = combK ),
c_0_51 ).
cnf(c_0_61,plain,
( ~ member(pair(comb_app(combK,X1),comb_app(X2,X3)),parcontract)
| k1_parcontractD_sk1(X1,comb_app(X2,X3)) = X3 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_30])]) ).
cnf(c_0_62,plain,
( ~ ap_parcontractE_c1(X1,X2,X3)
| X3 = comb_app(X1,X2) ),
c_0_53 ).
cnf(c_0_63,negated_conjecture,
( ap_parcontractE_c1(comb_app(combK,p),q,yp)
| ap_parcontractE_c2(comb_app(combK,p),q,yp)
| ap_parcontractE_c4(comb_app(combK,p),q,yp) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( ~ member(pair(comb_app(combK,p),ap_parcontractE_sk2q(X1,X2,yp)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,yp) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,plain,
( ~ ap_parcontractE_c4(X1,X2,X3)
| member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract) ),
c_0_59 ).
cnf(c_0_66,plain,
( ~ member(pair(comb_app(combK,combK),X1),parcontract)
| k1_parcontractD_sk1(combK,X1) = combK ),
inference(spm,[status(thm)],[c_0_60,c_0_47]) ).
cnf(c_0_67,plain,
( ~ member(pair(X3,X4),parcontract)
| ~ member(pair(X1,X2),parcontract)
| member(pair(comb_app(X1,X3),comb_app(X2,X4)),parcontract) ),
inference(fof_simplification,[status(thm)],[parcontract_intros4]) ).
cnf(c_0_68,negated_conjecture,
( ~ member(pair(yp,X2),parcontract)
| ~ member(pair(comb_app(combK,p),comb_app(X1,X2)),parcontract) ),
inference(spm,[status(thm)],[c_0_57,c_0_61]) ).
cnf(c_0_69,plain,
( ~ ap_parcontractE_c2(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE6]) ).
cnf(c_0_70,negated_conjecture,
( ap_parcontractE_c2(comb_app(combK,p),q,yp)
| ap_parcontractE_c4(comb_app(combK,p),q,yp)
| comb_app(comb_app(combK,p),q) = yp ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
~ ap_parcontractE_c4(comb_app(combK,p),X1,yp),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,plain,
( ~ member(X1,comb)
| member(pair(X1,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[parcontract_intros1]) ).
cnf(c_0_73,plain,
( ~ member(pair(comb_app(combK,combK),X1),parcontract)
| member(pair(combK,combK),parcontract) ),
inference(spm,[status(thm)],[c_0_47,c_0_66]) ).
cnf(c_0_74,plain,
( ~ member(pair(X3,X4),parcontract)
| ~ member(pair(X1,X2),parcontract)
| member(pair(comb_app(X1,X3),comb_app(X2,X4)),parcontract) ),
c_0_67 ).
cnf(c_0_75,negated_conjecture,
( ~ member(pair(comb_app(combK,X2),X1),parcontract)
| ~ member(pair(yp,k1_parcontractD_sk1(X2,X1)),parcontract)
| ~ member(pair(comb_app(combK,p),X1),parcontract) ),
inference(spm,[status(thm)],[c_0_68,c_0_30]) ).
cnf(c_0_76,plain,
( ~ ap_parcontractE_c2(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
c_0_69 ).
cnf(c_0_77,negated_conjecture,
( ap_parcontractE_c2(comb_app(combK,p),q,yp)
| comb_app(comb_app(combK,p),q) = yp ),
inference(sr,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,plain,
( ~ member(X1,comb)
| member(pair(X1,X1),parcontract) ),
c_0_72 ).
cnf(c_0_79,hypothesis,
member(p,comb),
diamond_parcontract_2h1 ).
cnf(c_0_80,plain,
( ~ member(pair(combK,X2),parcontract)
| ~ member(pair(combK,X1),parcontract)
| member(pair(combK,combK),parcontract) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_81,axiom,
member(combK,comb),
comb_intros1 ).
cnf(c_0_82,negated_conjecture,
( ~ member(pair(comb_app(combK,yp),X1),parcontract)
| ~ member(pair(comb_app(combK,p),X1),parcontract) ),
inference(spm,[status(thm)],[c_0_75,c_0_47]) ).
cnf(c_0_83,negated_conjecture,
( comb_app(combK,p) = comb_app(combK,yp)
| comb_app(comb_app(combK,p),q) = yp ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_84,hypothesis,
member(q,comb),
diamond_parcontract_2h2 ).
cnf(c_0_85,negated_conjecture,
~ member(pair(yp,p),parcontract),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_78]),c_0_79])]) ).
cnf(c_0_86,plain,
( ~ member(pair(X4,X1),parcontract)
| ~ member(pair(X3,X2),parcontract)
| member(comb_app(X1,X2),comb) ),
inference(spm,[status(thm)],[c_0_31,c_0_74]) ).
cnf(c_0_87,plain,
( ~ member(pair(combK,X1),parcontract)
| member(pair(combK,combK),parcontract) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_78]),c_0_81])]) ).
cnf(c_0_88,negated_conjecture,
~ member(pair(comb_app(combK,yp),comb_app(combK,p)),parcontract),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_78]),c_0_31]) ).
cnf(c_0_89,negated_conjecture,
comb_app(combK,p) = comb_app(combK,yp),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_83]),c_0_84]),c_0_79])]),c_0_85]) ).
cnf(c_0_90,negated_conjecture,
( ~ member(pair(X2,X1),parcontract)
| member(comb_app(X1,yp),comb) ),
inference(spm,[status(thm)],[c_0_86,c_0_55]) ).
cnf(c_0_91,plain,
member(pair(combK,combK),parcontract),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_78]),c_0_81])]) ).
cnf(c_0_92,negated_conjecture,
~ member(pair(comb_app(combK,yp),comb_app(combK,yp)),parcontract),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,negated_conjecture,
member(comb_app(combK,yp),comb),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_78]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL095-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n020.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 14:10:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 9.32/1.81 % Version: 3.5.1
% 9.32/1.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.32/1.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.32/1.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.32/1.81 % Starting new_bool_3 with 300s (1) cores
% 9.32/1.81 % Starting new_bool_1 with 300s (1) cores
% 9.32/1.81 % Starting sh5l with 300s (1) cores
% 9.32/1.81 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3135488 completed with status 0
% 9.32/1.81 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 9.32/1.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.32/1.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.32/1.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.32/1.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.32/1.81 % No SInE strategy applied
% 9.32/1.81 % Search class: FGHSF-FFMS32-MFFFFFNN
% 9.32/1.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 9.32/1.81 % Starting SubtermCWHack with 136s (1) cores
% 9.32/1.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 9.32/1.81 % Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.32/1.81 % Starting new_bool_3 with 136s (1) cores
% 9.32/1.81 % Starting new_bool_1 with 136s (1) cores
% 9.32/1.81 % G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3135495 completed with status 0
% 9.32/1.81 % Result found by G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.32/1.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.32/1.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.32/1.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.32/1.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.32/1.81 % No SInE strategy applied
% 9.32/1.81 % Search class: FGHSF-FFMS32-MFFFFFNN
% 9.32/1.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 9.32/1.81 % Starting SubtermCWHack with 136s (1) cores
% 9.32/1.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 9.32/1.81 % Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.32/1.81 % Preprocessing time : 0.001 s
% 9.32/1.81 % Presaturation interreduction done
% 9.32/1.81
% 9.32/1.81 % Proof found!
% 9.32/1.81 % SZS status Unsatisfiable
% 9.32/1.81 % SZS output start CNFRefutation
% See solution above
% 9.32/1.81 % Parsed axioms : 68
% 9.32/1.81 % Removed by relevancy pruning/SinE : 0
% 9.32/1.81 % Initial clauses : 68
% 9.32/1.81 % Removed in clause preprocessing : 1
% 9.32/1.81 % Initial clauses in saturation : 67
% 9.32/1.81 % Processed clauses : 9343
% 9.32/1.81 % ...of these trivial : 9
% 9.32/1.81 % ...subsumed : 5892
% 9.32/1.81 % ...remaining for further processing : 3442
% 9.32/1.81 % Other redundant clauses eliminated : 183
% 9.32/1.81 % Clauses deleted for lack of memory : 0
% 9.32/1.81 % Backward-subsumed : 423
% 9.32/1.81 % Backward-rewritten : 171
% 9.32/1.81 % Generated clauses : 68502
% 9.32/1.81 % ...of the previous two non-redundant : 66992
% 9.32/1.81 % ...aggressively subsumed : 0
% 9.32/1.81 % Contextual simplify-reflections : 169
% 9.32/1.81 % Paramodulations : 68311
% 9.32/1.81 % Factorizations : 0
% 9.32/1.81 % NegExts : 0
% 9.32/1.81 % Equation resolutions : 188
% 9.32/1.81 % Disequality decompositions : 0
% 9.32/1.81 % Total rewrite steps : 9593
% 9.32/1.81 % ...of those cached : 9533
% 9.32/1.81 % Propositional unsat checks : 0
% 9.32/1.81 % Propositional check models : 0
% 9.32/1.81 % Propositional check unsatisfiable : 0
% 9.32/1.81 % Propositional clauses : 0
% 9.32/1.81 % Propositional clauses after purity: 0
% 9.32/1.81 % Propositional unsat core size : 0
% 9.32/1.81 % Propositional preprocessing time : 0.000
% 9.32/1.81 % Propositional encoding time : 0.000
% 9.32/1.81 % Propositional solver time : 0.000
% 9.32/1.81 % Success case prop preproc time : 0.000
% 9.32/1.81 % Success case prop encoding time : 0.000
% 9.32/1.81 % Success case prop solver time : 0.000
% 9.32/1.81 % Current number of processed clauses : 2777
% 9.32/1.81 % Positive orientable unit clauses : 66
% 9.32/1.81 % Positive unorientable unit clauses: 0
% 9.32/1.81 % Negative unit clauses : 103
% 9.32/1.81 % Non-unit-clauses : 2608
% 9.32/1.81 % Current number of unprocessed clauses: 57134
% 9.32/1.81 % ...number of literals in the above : 226306
% 9.32/1.81 % Current number of archived formulas : 0
% 9.32/1.81 % Current number of archived clauses : 662
% 9.32/1.81 % Clause-clause subsumption calls (NU) : 1366621
% 9.32/1.81 % Rec. Clause-clause subsumption calls : 495878
% 9.32/1.81 % Non-unit clause-clause subsumptions : 3035
% 9.32/1.81 % Unit Clause-clause subsumption calls : 25838
% 9.32/1.81 % Rewrite failures with RHS unbound : 0
% 9.32/1.81 % BW rewrite match attempts : 123
% 9.32/1.81 % BW rewrite match successes : 36
% 9.32/1.81 % Condensation attempts : 0
% 9.32/1.81 % Condensation successes : 0
% 9.32/1.81 % Termbank termtop insertions : 1327671
% 9.32/1.81 % Search garbage collected termcells : 123
% 9.32/1.81
% 9.32/1.81 % -------------------------------------------------
% 9.32/1.81 % User time : 1.160 s
% 9.32/1.81 % System time : 0.047 s
% 9.32/1.81 % Total time : 1.206 s
% 9.32/1.81 % Maximum resident set size: 3688 pages
% 9.32/1.81
% 9.32/1.81 % -------------------------------------------------
% 9.32/1.81 % User time : 6.145 s
% 9.32/1.81 % System time : 0.314 s
% 9.32/1.81 % Total time : 6.458 s
% 9.32/1.81 % Maximum resident set size: 4608 pages
% 9.32/1.81 % E exiting
%------------------------------------------------------------------------------