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

View Problem - Process Solution

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

% Computer : n009.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:26 EDT 2022

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

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

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

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

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

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

cnf(g5,plain,
    ( ~ ssList(sK47)
    | ssList(sK33(sK47))
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g6,plain,
    ( ~ ssList(sK47)
    | ssList(sK32(sK47))
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g7,plain,
    ( ~ ssList(sK47)
    | ssList(sK31(sK47))
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g8,plain,
    ( ~ ssList(sK47)
    | sPE(app(app(sK31(sK47),cons(sK29(sK47),sK32(sK47))),cons(sK30(sK47),sK33(sK47))),sK47)
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g9,plain,
    ( ~ ssList(sK47)
    | ssItem(sK29(sK47))
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g10,plain,
    ( ~ ssList(sK47)
    | ssItem(sK30(sK47))
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

cnf(g11,plain,
    ( ~ ssList(sK47)
    | ~ lt(sK29(sK47),sK30(sK47))
    | strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

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

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

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

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

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

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

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

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

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

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

cnf(g22,plain,
    ( ~ sPE(app(app(sK31(sK47),cons(sK29(sK47),sK32(sK47))),cons(sK30(sK47),sK33(sK47))),sK47)
    | ~ ssItem(sK29(sK47))
    | ~ ssItem(sK30(sK47))
    | ~ ssList(sK47)
    | ~ ssList(sK31(sK47))
    | ~ ssList(sK32(sK47))
    | ~ ssList(sK33(sK47))
    | ~ totalorderedP(sK47)
    | leq(sK29(sK47),sK30(sK47)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).

cnf(g23,plain,
    ( ~ sPE(sK29(sK47),sK30(sK47))
    | ~ sPE(app(app(sK31(sK47),cons(sK29(sK47),sK32(sK47))),cons(sK30(sK47),sK33(sK47))),sK47)
    | ~ ssItem(sK29(sK47))
    | ~ ssItem(sK30(sK47))
    | ~ ssList(sK47)
    | ~ ssList(sK31(sK47))
    | ~ ssList(sK32(sK47))
    | ~ ssList(sK33(sK47))
    | ~ duplicatefreeP(sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

cnf(g24,plain,
    ( ~ ssItem(sK29(sK47))
    | ~ ssItem(sK30(sK47))
    | ~ leq(sK29(sK47),sK30(sK47))
    | sPE(sK29(sK47),sK30(sK47))
    | lt(sK29(sK47),sK30(sK47)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax93)]) ).

cnf(g25,plain,
    strictorderedP(nil),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax69)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC287+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n009.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 12 14:11:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.53  % symbols: 79
% 0.18/0.53  % clauses: 272
% 0.18/0.53  % start clauses: 11
% 0.18/0.53  % iterative deepening steps: 247
% 0.18/0.53  % maximum path limit: 2
% 0.18/0.53  % literal attempts: 460880
% 0.18/0.53  % depth failures: 355306
% 0.18/0.53  % regularity failures: 233
% 0.18/0.53  % tautology failures: 12794
% 0.18/0.53  % reductions: 99018
% 0.18/0.53  % extensions: 359298
% 0.18/0.53  % SAT variables: 104206
% 0.18/0.53  % SAT clauses: 102605
% 0.18/0.53  % WalkSAT solutions: 102602
% 0.18/0.53  % CDCL solutions: 1
% 0.18/0.53  % SZS status Theorem for theBenchmark
% 0.18/0.53  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------