TSTP Solution File: NUM597+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM597+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n014.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  : 600s
% DateTime : Mon Jul 18 14:02:19 EDT 2022

% Result   : Timeout 288.02s 36.69s
% Output   : None 
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ aElementOf0(szDzizrdt0(xd),xT),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__)]) ).

cnf(g1,plain,
    ( ~ isFinite0(sdtlcdtrc0(xd,szDzozmdt0(xd)))
    | ~ isCountable0(szDzozmdt0(xd))
    | ~ aFunction0(xd)
    | aElement0(szDzizrdt0(xd)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDirichlet)]) ).

cnf(g2,plain,
    aSet0(xT),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3291)]) ).

cnf(g3,plain,
    aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4758)]) ).

cnf(g4,plain,
    isFinite0(xT),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3291)]) ).

cnf(g5,plain,
    sPE(xT,xT),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    aFunction0(xd),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4730)]) ).

cnf(g7,plain,
    sPE(szDzozmdt0(xd),szNzAzT0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4730)]) ).

cnf(g8,plain,
    isCountable0(szNzAzT0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet)]) ).

cnf(g9,plain,
    sPE(sdtlbdtrb0(xd,szDzizrdt0(xd)),sdtlbdtrb0(xd,szDzizrdt0(xd))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(sdtlbdtrb0(xd,szDzizrdt0(xd)),sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | ~ aElement0(szDzizrdt0(xd))
    | ~ aElementOf0(sK0(sdtlbdtrb0(xd,szDzizrdt0(xd))),sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | ~ aFunction0(xd)
    | sPE(sdtlpdtrp0(xd,sK0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),szDzizrdt0(xd)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPtt)]) ).

cnf(g11,plain,
    ( ~ aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | sPE(sdtlbdtrb0(xd,szDzizrdt0(xd)),slcrc0)
    | aElementOf0(sK0(sdtlbdtrb0(xd,szDzizrdt0(xd))),sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp)]) ).

cnf(g12,plain,
    ~ sPE(sdtlbdtrb0(xd,szDzizrdt0(xd)),slcrc0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4868)]) ).

cnf(g13,plain,
    ( ~ sPE(szDzozmdt0(xd),szNzAzT0)
    | sPE(szNzAzT0,szDzozmdt0(xd)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(sdtlbdtrb0(xd,szDzizrdt0(xd)),sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | ~ aElement0(szDzizrdt0(xd))
    | ~ aFunction0(xd)
    | aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPtt)]) ).

cnf(g15,plain,
    ( ~ sPE(sdtlpdtrp0(xd,sK0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),szDzizrdt0(xd))
    | ~ sPE(xT,xT)
    | ~ aElementOf0(sdtlpdtrp0(xd,sK0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),xT)
    | aElementOf0(szDzizrdt0(xd),xT) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(szNzAzT0,szDzozmdt0(xd))
    | ~ isCountable0(szNzAzT0)
    | isCountable0(szDzozmdt0(xd)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ aSet0(xT)
    | ~ isFinite0(xT)
    | ~ aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT)
    | isFinite0(sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubFSet)]) ).

cnf(g18,plain,
    ( ~ aElementOf0(sK0(sdtlbdtrb0(xd,szDzizrdt0(xd))),szDzozmdt0(xd))
    | ~ aFunction0(xd)
    | aElementOf0(sdtlpdtrp0(xd,sK0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mImgRng)]) ).

cnf(g19,plain,
    ( ~ sPE(sdtlbdtrb0(xd,szDzizrdt0(xd)),sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | ~ aElement0(szDzizrdt0(xd))
    | ~ aElementOf0(sK0(sdtlbdtrb0(xd,szDzizrdt0(xd))),sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | ~ aFunction0(xd)
    | aElementOf0(sK0(sdtlbdtrb0(xd,szDzizrdt0(xd))),szDzozmdt0(xd)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPtt)]) ).

cnf(g20,plain,
    ( ~ aSet0(xT)
    | ~ aElementOf0(sdtlpdtrp0(xd,sK0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),sdtlcdtrc0(xd,szDzozmdt0(xd)))
    | ~ aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT)
    | aElementOf0(sdtlpdtrp0(xd,sK0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),xT) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM597+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : satcop --statistics %s
% 0.11/0.33  % Computer : n014.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Thu Jul  7 06:12:37 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 288.02/36.69  % symbols: 67
% 288.02/36.69  % clauses: 253
% 288.02/36.69  % start clauses: 1
% 288.02/36.69  % iterative deepening steps: 8886
% 288.02/36.69  % maximum path limit: 4
% 288.02/36.69  % literal attempts: 45800149
% 288.02/36.69  % depth failures: 41908082
% 288.02/36.69  % regularity failures: 549489
% 288.02/36.69  % tautology failures: 577013
% 288.02/36.69  % reductions: 43009
% 288.02/36.69  % extensions: 45749720
% 288.02/36.69  % SAT variables: 13452300
% 288.02/36.69  % SAT clauses: 12004746
% 288.02/36.69  % WalkSAT solutions: 12004737
% 288.02/36.69  % CDCL solutions: 8
% 288.02/36.69  % SZS status Theorem for theBenchmark
% 288.02/36.69  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------