TSTP Solution File: SWC271+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWC271+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n018.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:20 EDT 2022

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

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

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

cnf(g2,plain,
    strictorderedP(sK49),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

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

cnf(g4,plain,
    ( ~ ssList(sK49)
    | ssList(sK28(sK49))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g5,plain,
    ( ~ ssList(sK49)
    | ssList(sK26(sK49))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g6,plain,
    ( ~ ssList(sK49)
    | ~ leq(sK24(sK49),sK25(sK49))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g7,plain,
    ( ~ ssList(sK49)
    | sPE(app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),sK49)
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g8,plain,
    ( ~ ssList(sK49)
    | ssItem(sK24(sK49))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g9,plain,
    ( ~ ssList(sK49)
    | ssList(sK27(sK49))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g10,plain,
    ( ~ ssList(sK49)
    | ssItem(sK25(sK49))
    | totalorderedP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

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

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

cnf(g13,plain,
    ( ~ sPE(app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),sK49)
    | ~ ssItem(sK24(sK49))
    | ~ ssItem(sK25(sK49))
    | ~ ssList(sK49)
    | ~ ssList(sK26(sK49))
    | ~ ssList(sK27(sK49))
    | ~ ssList(sK28(sK49))
    | ~ strictorderedP(sK49)
    | lt(sK24(sK49),sK25(sK49)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g14,plain,
    ( ~ ssItem(sK24(sK49))
    | ~ ssItem(sK25(sK49))
    | ~ lt(sK24(sK49),sK25(sK49))
    | leq(sK24(sK49),sK25(sK49)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax93)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SWC271+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n018.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 12 19:39:27 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.43  % symbols: 77
% 0.19/0.43  % clauses: 269
% 0.19/0.43  % start clauses: 10
% 0.19/0.43  % iterative deepening steps: 39
% 0.19/0.43  % maximum path limit: 1
% 0.19/0.43  % literal attempts: 73578
% 0.19/0.43  % depth failures: 72002
% 0.19/0.43  % regularity failures: 55
% 0.19/0.43  % tautology failures: 276
% 0.19/0.43  % reductions: 103
% 0.19/0.43  % extensions: 73204
% 0.19/0.43  % SAT variables: 47205
% 0.19/0.43  % SAT clauses: 43849
% 0.19/0.43  % WalkSAT solutions: 43848
% 0.19/0.43  % CDCL solutions: 0
% 0.19/0.43  % SZS status Theorem for theBenchmark
% 0.19/0.43  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------