↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n003.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:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sPE(singleton(sK13),unordered_pair(sK14,sK15)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1)]) ).

cnf(g1,plain,
    ~ sPE(sK14,sK15),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1)]) ).

cnf(g2,plain,
    ( ~ sPE(singleton(sK13),unordered_pair(sK14,sK15))
    | sPE(sK13,sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1)]) ).

cnf(g3,plain,
    ( ~ sPE(singleton(sK13),unordered_pair(sK14,sK15))
    | ~ sPE(set_difference(sK15,empty_set),sK15)
    | in(set_difference(sK15,empty_set),singleton(sK13)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

cnf(g4,plain,
    sPE(set_difference(sK15,empty_set),sK15),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_boole)]) ).

cnf(g5,plain,
    ( ~ sPE(singleton(sK13),singleton(sK14))
    | ~ in(set_difference(sK15,empty_set),singleton(sK13))
    | sPE(set_difference(sK15,empty_set),sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski)]) ).

cnf(g6,plain,
    ( ~ sPE(sK13,sK14)
    | sPE(singleton(sK13),singleton(sK14)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ sPE(sK14,set_difference(sK15,empty_set))
    | ~ sPE(set_difference(sK15,empty_set),sK15)
    | sPE(sK14,sK15) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(set_difference(sK15,empty_set),sK14)
    | sPE(sK14,set_difference(sK15,empty_set)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU150+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 20 00:08:29 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.38  % symbols: 36
% 0.20/0.38  % clauses: 154
% 0.20/0.38  % start clauses: 2
% 0.20/0.38  % iterative deepening steps: 58
% 0.20/0.38  % maximum path limit: 2
% 0.20/0.38  % literal attempts: 23279
% 0.20/0.38  % depth failures: 14495
% 0.20/0.38  % regularity failures: 48
% 0.20/0.38  % tautology failures: 36
% 0.20/0.38  % reductions: 8197
% 0.20/0.38  % extensions: 15020
% 0.20/0.38  % SAT variables: 17931
% 0.20/0.38  % SAT clauses: 14594
% 0.20/0.38  % WalkSAT solutions: 14591
% 0.20/0.38  % CDCL solutions: 0
% 0.20/0.38  % SZS status Theorem for theBenchmark
% 0.20/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------