↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n013.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:25 EDT 2022

% Result   : Theorem 0.13s 0.37s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ aSubsetOf0(xQ,szNzAzT0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__)]) ).

cnf(g1,plain,
    aSet0(szNzAzT0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet)]) ).

cnf(g2,plain,
    ( ~ aSet0(xQ)
    | ~ aSet0(xO)
    | ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(xQ,xO)
    | ~ aSubsetOf0(xO,szNzAzT0)
    | aSubsetOf0(xQ,szNzAzT0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubTrans)]) ).

cnf(g3,plain,
    aSubsetOf0(xQ,xO),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5093)]) ).

cnf(g4,plain,
    aSet0(xO),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891)]) ).

cnf(g5,plain,
    ( ~ aSet0(xO)
    | ~ aSubsetOf0(xQ,xO)
    | aSet0(xQ) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub)]) ).

cnf(g6,plain,
    ( ~ aSet0(xO)
    | ~ aSet0(xS)
    | ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(xO,xS)
    | ~ aSubsetOf0(xS,szNzAzT0)
    | aSubsetOf0(xO,szNzAzT0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubTrans)]) ).

cnf(g7,plain,
    aSubsetOf0(xO,xS),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998)]) ).

cnf(g8,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435)]) ).

cnf(g9,plain,
    ( ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(xS,szNzAzT0)
    | aSet0(xS) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jul  6 02:02:29 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  % symbols: 70
% 0.13/0.37  % clauses: 266
% 0.13/0.37  % start clauses: 1
% 0.13/0.37  % iterative deepening steps: 132
% 0.13/0.37  % maximum path limit: 2
% 0.13/0.37  % literal attempts: 13879
% 0.13/0.37  % depth failures: 12324
% 0.13/0.37  % regularity failures: 68
% 0.13/0.37  % tautology failures: 214
% 0.13/0.37  % reductions: 1
% 0.13/0.37  % extensions: 13793
% 0.13/0.37  % SAT variables: 7781
% 0.13/0.37  % SAT clauses: 6181
% 0.13/0.37  % WalkSAT solutions: 6176
% 0.13/0.37  % CDCL solutions: 0
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------