↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n008.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.18s 0.41s
% Output   : Proof 0.18s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sPE(unordered_pair(sK10,sK11),unordered_pair(sK12,sK13)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1)]) ).

cnf(g1,plain,
    ~ sPE(sK10,sK12),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1)]) ).

cnf(g2,plain,
    ~ sPE(sK10,sK13),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1)]) ).

cnf(g3,plain,
    ( ~ sPE(unordered_pair(sK10,sK11),unordered_pair(sK12,sK13))
    | sPE(unordered_pair(sK12,sK13),unordered_pair(sK10,sK11)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ sPE(unordered_pair(sK10,sK11),unordered_pair(sK12,sK13))
    | ~ in(sK10,unordered_pair(sK10,sK11))
    | sPE(sK10,sK12)
    | sPE(sK10,sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

cnf(g5,plain,
    ( sPE(sK10,sK10)
    | in(sK14(sK10,sK10),sK10)
    | in(sK14(sK10,sK10),sK10) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski)]) ).

cnf(g6,plain,
    ( ~ in(sK14(sK10,sK10),sK10)
    | ~ in(sK14(sK10,sK10),sK10)
    | sPE(sK10,sK10) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski)]) ).

cnf(g7,plain,
    ( ~ sPE(sK10,sK10)
    | ~ sPE(unordered_pair(sK12,sK13),unordered_pair(sK10,sK11))
    | ~ in(sK10,unordered_pair(sK12,sK13))
    | in(sK10,unordered_pair(sK10,sK11)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(unordered_pair(sK12,sK13),unordered_pair(sK10,sK11))
    | ~ sPE(sK10,sK10)
    | in(sK10,unordered_pair(sK12,sK13)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU151+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n008.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 Jun 19 14:44:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.41  % symbols: 37
% 0.18/0.41  % clauses: 156
% 0.18/0.41  % start clauses: 3
% 0.18/0.41  % iterative deepening steps: 69
% 0.18/0.41  % maximum path limit: 2
% 0.18/0.41  % literal attempts: 37943
% 0.18/0.41  % depth failures: 25354
% 0.18/0.41  % regularity failures: 160
% 0.18/0.41  % tautology failures: 80
% 0.18/0.41  % reductions: 11116
% 0.18/0.41  % extensions: 26688
% 0.18/0.41  % SAT variables: 25985
% 0.18/0.41  % SAT clauses: 21877
% 0.18/0.41  % WalkSAT solutions: 21869
% 0.18/0.41  % CDCL solutions: 0
% 0.18/0.41  % SZS status Theorem for theBenchmark
% 0.18/0.41  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------