↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SEU172+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n029.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 : Tue Jul 19 14:12:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    element(sK27,powerset(sK25)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_subset_1)]) ).

cnf(g1,plain,
    in(sK26,subset_complement(sK25,sK27)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_subset_1)]) ).

cnf(g2,plain,
    in(sK26,sK27),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_subset_1)]) ).

cnf(g3,plain,
    ( ~ element(sK27,powerset(sK25))
    | sPE(subset_complement(sK25,subset_complement(sK25,sK27)),sK27) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k3_subset_1)]) ).

cnf(g4,plain,
    ( ~ element(sK27,powerset(sK25))
    | element(subset_complement(sK25,sK27),powerset(sK25)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_subset_1)]) ).

cnf(g5,plain,
    ( ~ in(sK26,sK27)
    | ~ in(sK26,subset_complement(sK25,sK27))
    | ~ disjoint(sK27,subset_complement(sK25,sK27)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0)]) ).

cnf(g6,plain,
    ( ~ sPE(subset_complement(sK25,subset_complement(sK25,sK27)),sK27)
    | subset(sK27,subset_complement(sK25,subset_complement(sK25,sK27))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0)]) ).

cnf(g7,plain,
    ( ~ subset(sK27,subset_complement(sK25,subset_complement(sK25,sK27)))
    | ~ element(sK27,powerset(sK25))
    | ~ element(subset_complement(sK25,sK27),powerset(sK25))
    | disjoint(sK27,subset_complement(sK25,sK27)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_subset_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : SEU172+2 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.08  % Command  : satcop --statistics %s
% 0.07/0.29  % Computer : n029.cluster.edu
% 0.07/0.29  % Model    : x86_64 x86_64
% 0.07/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.29  % Memory   : 8042.1875MB
% 0.07/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.29  % CPULimit : 300
% 0.07/0.29  % WCLimit  : 600
% 0.07/0.29  % DateTime : Sun Jun 19 06:18:14 EDT 2022
% 0.07/0.29  % CPUTime  : 
% 0.07/0.30  % symbols: 58
% 0.07/0.30  % clauses: 253
% 0.07/0.30  % start clauses: 3
% 0.07/0.30  % iterative deepening steps: 26
% 0.07/0.30  % maximum path limit: 2
% 0.07/0.30  % literal attempts: 6269
% 0.07/0.30  % depth failures: 5015
% 0.07/0.30  % regularity failures: 49
% 0.07/0.30  % tautology failures: 9
% 0.07/0.30  % reductions: 978
% 0.07/0.30  % extensions: 5263
% 0.07/0.30  % SAT variables: 4293
% 0.07/0.30  % SAT clauses: 4145
% 0.07/0.30  % WalkSAT solutions: 4143
% 0.07/0.30  % CDCL solutions: 0
% 0.07/0.30  % SZS status Theorem for theBenchmark
% 0.07/0.30  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------