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

View Problem - Process Solution

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

% Computer : n028.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:54:48 EDT 2022

% Result   : Theorem 1.61s 0.73s
% Output   : Proof 1.61s
% 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,
    ~ duplicatefreeP(sK47),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g4,plain,
    ( ~ ssList(sK49)
    | sPE(app(app(sK36(sK49),cons(sK34(sK49),sK37(sK49))),cons(sK35(sK49),sK38(sK49))),sK49)
    | duplicatefreeP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

cnf(g5,plain,
    ( ~ ssList(sK49)
    | ssList(sK38(sK49))
    | duplicatefreeP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

cnf(g6,plain,
    ( ~ ssList(sK49)
    | ssList(sK36(sK49))
    | duplicatefreeP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

cnf(g7,plain,
    ( ~ ssList(sK49)
    | ssList(sK37(sK49))
    | duplicatefreeP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

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

cnf(g9,plain,
    ( ~ ssList(sK49)
    | ssItem(sK34(sK49))
    | duplicatefreeP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

cnf(g10,plain,
    ( ~ ssList(sK49)
    | sPE(sK34(sK49),sK35(sK49))
    | duplicatefreeP(sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).

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

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

cnf(g13,plain,
    ( ~ sPE(sK34(sK49),sK35(sK49))
    | ~ ssItem(sK34(sK49))
    | ~ ssItem(sK35(sK49))
    | ~ lt(sK34(sK49),sK35(sK49)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax93)]) ).

cnf(g14,plain,
    ( ~ sPE(app(app(sK36(sK49),cons(sK34(sK49),sK37(sK49))),cons(sK35(sK49),sK38(sK49))),sK49)
    | ~ ssItem(sK34(sK49))
    | ~ ssItem(sK35(sK49))
    | ~ ssList(sK49)
    | ~ ssList(sK36(sK49))
    | ~ ssList(sK37(sK49))
    | ~ ssList(sK38(sK49))
    | ~ strictorderedP(sK49)
    | lt(sK34(sK49),sK35(sK49)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC181+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n028.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 : Sat Jun 11 20:09:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.61/0.73  % symbols: 79
% 1.61/0.73  % clauses: 273
% 1.61/0.73  % start clauses: 14
% 1.61/0.73  % iterative deepening steps: 161
% 1.61/0.73  % maximum path limit: 1
% 1.61/0.73  % literal attempts: 345458
% 1.61/0.73  % depth failures: 340316
% 1.61/0.73  % regularity failures: 112
% 1.61/0.73  % tautology failures: 874
% 1.61/0.73  % reductions: 334
% 1.61/0.73  % extensions: 342990
% 1.61/0.73  % SAT variables: 92909
% 1.61/0.73  % SAT clauses: 86983
% 1.61/0.73  % WalkSAT solutions: 86975
% 1.61/0.73  % CDCL solutions: 2
% 1.61/0.73  % SZS status Theorem for theBenchmark
% 1.61/0.73  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------