↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET964+1 : TPTP v8.1.0. Released v3.2.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 05:05:16 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(sK9,empty_set),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_zfmisc_1)]) ).

cnf(g1,plain,
    ( subset(cartesian_product2(sK9,sK10),cartesian_product2(sK9,sK11))
    | subset(cartesian_product2(sK10,sK9),cartesian_product2(sK11,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_zfmisc_1)]) ).

cnf(g2,plain,
    ~ subset(sK10,sK11),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_zfmisc_1)]) ).

cnf(g3,plain,
    ( sPE(sK9,empty_set)
    | in(sK0(sK9),sK9) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0)]) ).

cnf(g4,plain,
    ( in(sK6(sK10,sK11),sK10)
    | subset(sK10,sK11) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g5,plain,
    ( ~ in(sK6(sK10,sK11),sK11)
    | subset(sK10,sK11) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g6,plain,
    ( ~ in(sK0(sK9),sK9)
    | ~ in(sK0(sK9),sK9)
    | in(ordered_pair(sK0(sK9),sK0(sK9)),cartesian_product2(sK9,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1)]) ).

cnf(g7,plain,
    sPE(sK9,sK9),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( sPE(cartesian_product2(sK9,sK9),empty_set)
    | in(sK0(cartesian_product2(sK9,sK9)),cartesian_product2(sK9,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0)]) ).

cnf(g9,plain,
    ( ~ sPE(cartesian_product2(sK9,sK9),empty_set)
    | ~ in(ordered_pair(sK0(sK9),sK0(sK9)),cartesian_product2(sK9,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0)]) ).

cnf(g10,plain,
    ( ~ sPE(sK9,sK9)
    | ~ sPE(sK9,sK9)
    | sPE(cartesian_product2(sK9,sK9),cartesian_product2(sK9,sK9)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(cartesian_product2(sK9,sK9),cartesian_product2(sK9,sK9))
    | ~ in(sK0(cartesian_product2(sK9,sK9)),cartesian_product2(sK9,sK9))
    | in(sK2(sK9,sK9,cartesian_product2(sK9,sK9),sK0(cartesian_product2(sK9,sK9))),sK9) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1)]) ).

cnf(g12,plain,
    ( ~ in(ordered_pair(sK0(sK9),sK6(sK10,sK11)),cartesian_product2(sK9,sK11))
    | in(sK6(sK10,sK11),sK11) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1)]) ).

cnf(g13,plain,
    ( ~ in(ordered_pair(sK0(sK9),sK6(sK10,sK11)),cartesian_product2(sK9,sK10))
    | ~ subset(cartesian_product2(sK9,sK10),cartesian_product2(sK9,sK11))
    | in(ordered_pair(sK0(sK9),sK6(sK10,sK11)),cartesian_product2(sK9,sK11)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g14,plain,
    ( ~ in(sK0(sK9),sK9)
    | ~ in(sK6(sK10,sK11),sK10)
    | in(ordered_pair(sK0(sK9),sK6(sK10,sK11)),cartesian_product2(sK9,sK10)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1)]) ).

cnf(g15,plain,
    ( ~ in(ordered_pair(sK6(sK10,sK11),sK2(sK9,sK9,cartesian_product2(sK9,sK9),sK0(cartesian_product2(sK9,sK9)))),cartesian_product2(sK10,sK9))
    | ~ subset(cartesian_product2(sK10,sK9),cartesian_product2(sK11,sK9))
    | in(ordered_pair(sK6(sK10,sK11),sK2(sK9,sK9,cartesian_product2(sK9,sK9),sK0(cartesian_product2(sK9,sK9)))),cartesian_product2(sK11,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g16,plain,
    ( ~ in(sK6(sK10,sK11),sK10)
    | ~ in(sK2(sK9,sK9,cartesian_product2(sK9,sK9),sK0(cartesian_product2(sK9,sK9))),sK9)
    | in(ordered_pair(sK6(sK10,sK11),sK2(sK9,sK9,cartesian_product2(sK9,sK9),sK0(cartesian_product2(sK9,sK9)))),cartesian_product2(sK10,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1)]) ).

cnf(g17,plain,
    ( ~ in(ordered_pair(sK6(sK10,sK11),sK2(sK9,sK9,cartesian_product2(sK9,sK9),sK0(cartesian_product2(sK9,sK9)))),cartesian_product2(sK11,sK9))
    | in(sK6(sK10,sK11),sK11) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET964+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 08:35:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.40/0.77  % symbols: 23
% 3.40/0.77  % clauses: 47
% 3.40/0.77  % start clauses: 3
% 3.40/0.77  % iterative deepening steps: 1042
% 3.40/0.77  % maximum path limit: 4
% 3.40/0.77  % literal attempts: 979854
% 3.40/0.77  % depth failures: 685513
% 3.40/0.77  % regularity failures: 56116
% 3.40/0.77  % tautology failures: 35129
% 3.40/0.77  % reductions: 68603
% 3.40/0.77  % extensions: 909276
% 3.40/0.77  % SAT variables: 67307
% 3.40/0.77  % SAT clauses: 75638
% 3.40/0.78  % WalkSAT solutions: 75637
% 3.40/0.78  % CDCL solutions: 0
% 3.40/0.78  % SZS status Theorem for theBenchmark
% 3.40/0.78  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------