↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n020.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 21:55:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sPE(sK47,sK49),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g1,plain,
    ~ totalorderedP(sK47),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g2,plain,
    ( ssItem(sK51)
    | sP0 ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g3,plain,
    ( sPE(cons(sK51,nil),sK49)
    | sP0 ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g4,plain,
    ( ~ sPE(sK47,sK49)
    | sPE(sK49,sK47) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ sPE(sK49,sK47)
    | ~ totalorderedP(sK49)
    | totalorderedP(sK47) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( sPE(nil,sK49)
    | ~ sP0 ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g7,plain,
    ( ~ sPE(cons(sK51,nil),sK49)
    | ~ totalorderedP(cons(sK51,nil))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    totalorderedP(nil),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax66)]) ).

cnf(g9,plain,
    ( ~ sPE(nil,sK49)
    | ~ totalorderedP(nil)
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ ssItem(sK51)
    | totalorderedP(cons(sK51,nil)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax65)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC259+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 00:06:35 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.50  % symbols: 81
% 0.20/0.50  % clauses: 275
% 0.20/0.50  % start clauses: 14
% 0.20/0.50  % iterative deepening steps: 279
% 0.20/0.50  % maximum path limit: 1
% 0.20/0.50  % literal attempts: 339702
% 0.20/0.50  % depth failures: 333669
% 0.20/0.50  % regularity failures: 41
% 0.20/0.50  % tautology failures: 440
% 0.20/0.50  % reductions: 326
% 0.20/0.50  % extensions: 335591
% 0.20/0.50  % SAT variables: 46914
% 0.20/0.50  % SAT clauses: 44038
% 0.20/0.50  % WalkSAT solutions: 44038
% 0.20/0.50  % CDCL solutions: 0
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------