↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n021.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:14:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    r2_hidden(sK1311,k2_xboole_0(sK1313,sK1314)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_latsum_1)]) ).

cnf(g1,plain,
    r2_hidden(sK1312,k2_xboole_0(sK1313,sK1314)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_latsum_1)]) ).

cnf(g2,plain,
    ( ~ r2_hidden(sK1311,k4_xboole_0(sK1313,sK1314))
    | ~ r2_hidden(sK1312,k4_xboole_0(sK1313,sK1314)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_latsum_1)]) ).

cnf(g3,plain,
    ( ~ r2_hidden(sK1311,sK1314)
    | ~ r2_hidden(sK1312,sK1314) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_latsum_1)]) ).

cnf(g4,plain,
    ( ~ r2_hidden(sK1311,k4_xboole_0(sK1313,sK1314))
    | ~ r2_hidden(sK1312,sK1314) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_latsum_1)]) ).

cnf(g5,plain,
    ( ~ r2_hidden(sK1311,sK1314)
    | ~ r2_hidden(sK1312,k4_xboole_0(sK1313,sK1314)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_latsum_1)]) ).

cnf(g6,plain,
    ( r2_hidden(sK1312,sK1314)
    | r1_xboole_0(k1_tarski(sK1312),sK1314) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+6.ax',t56_zfmisc_1)]) ).

cnf(g7,plain,
    ( ~ r1_tarski(k1_tarski(sK1312),k4_xboole_0(sK1313,sK1314))
    | r2_hidden(sK1312,k4_xboole_0(sK1313,sK1314)) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+6.ax',t37_zfmisc_1)]) ).

cnf(g8,plain,
    ( ~ sPE(k4_xboole_0(sK1313,sK1314),k4_xboole_0(sK1313,sK1314))
    | ~ r2_hidden(sK1311,sK1313)
    | r2_hidden(sK1311,sK1314)
    | r2_hidden(sK1311,k4_xboole_0(sK1313,sK1314)) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+2.ax',d4_xboole_0)]) ).

cnf(g9,plain,
    sPE(k4_xboole_0(sK1313,sK1314),k4_xboole_0(sK1313,sK1314)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    sPE(k2_xboole_0(sK1313,sK1314),k2_xboole_0(sK1313,sK1314)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(k2_xboole_0(sK1313,sK1314),k2_xboole_0(sK1314,sK1313))
    | ~ r2_hidden(sK1311,k2_xboole_0(sK1313,sK1314))
    | r2_hidden(sK1311,sK1314)
    | r2_hidden(sK1311,sK1313) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+2.ax',d2_xboole_0)]) ).

cnf(g12,plain,
    sPE(k2_xboole_0(sK1313,sK1314),k2_xboole_0(sK1314,sK1313)),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+2.ax',commutativity_k2_xboole_0)]) ).

cnf(g13,plain,
    ( ~ r1_tarski(k1_tarski(sK1312),sK1313)
    | ~ r1_xboole_0(k1_tarski(sK1312),sK1314)
    | r1_tarski(k1_tarski(sK1312),k4_xboole_0(sK1313,sK1314)) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+4.ax',t86_xboole_1)]) ).

cnf(g14,plain,
    ( ~ sPE(k2_xboole_0(sK1313,sK1314),k2_xboole_0(sK1313,sK1314))
    | ~ r2_hidden(sK1312,k2_xboole_0(sK1313,sK1314))
    | r2_hidden(sK1312,sK1313)
    | r2_hidden(sK1312,sK1314) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+2.ax',d2_xboole_0)]) ).

cnf(g15,plain,
    ( ~ r2_hidden(sK1312,sK1313)
    | r1_tarski(k1_tarski(sK1312),sK1313) ),
    inference(ground_cnf,[],[file('Axioms/SET007/SET007+6.ax',t37_zfmisc_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU406+2 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n021.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 : Sat Jun 18 21:34:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 12.96/2.11  % symbols: 2412
% 12.96/2.11  % clauses: 10661
% 12.96/2.11  % start clauses: 6
% 12.96/2.11  % iterative deepening steps: 196
% 12.96/2.11  % maximum path limit: 2
% 12.96/2.11  % literal attempts: 773351
% 12.96/2.11  % depth failures: 509956
% 12.96/2.11  % regularity failures: 358
% 12.96/2.11  % tautology failures: 2295
% 12.96/2.11  % reductions: 255823
% 12.96/2.11  % extensions: 517036
% 12.96/2.11  % SAT variables: 669551
% 12.96/2.11  % SAT clauses: 533430
% 12.96/2.11  % WalkSAT solutions: 533422
% 12.96/2.11  % CDCL solutions: 1
% 12.96/2.11  % SZS status Theorem for theBenchmark
% 12.96/2.11  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------