%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWC348+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:55:48 EDT 2022

% Result   : Theorem 0.10s 0.45s
% Output   : Proof 0.10s
% 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,
    ssList(sK50),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

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

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

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

cnf(g5,plain,
    ( ~ neq(sK50,nil)
    | singletonP(sK49) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g6,plain,
    ( ~ segmentP(sK48,sK47)
    | ~ strictorderedP(sK47) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g7,plain,
    ( ~ ssList(sK49)
    | ~ singletonP(sK49)
    | ssItem(sK4(sK49)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax4)]) ).

cnf(g8,plain,
    ( ~ ssList(sK49)
    | segmentP(sK49,nil) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax57)]) ).

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

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

cnf(g11,plain,
    ( ~ ssList(sK49)
    | ~ singletonP(sK49)
    | sPE(cons(sK4(sK49),nil),sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax4)]) ).

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

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

cnf(g14,plain,
    ( ~ ssList(sK50)
    | ~ ssList(nil)
    | sPE(sK50,nil)
    | neq(sK50,nil) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).

cnf(g15,plain,
    ssList(nil),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).

cnf(g16,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK49)
    | ~ segmentP(nil,sK49)
    | ~ segmentP(sK49,nil)
    | sPE(nil,sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax54)]) ).

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

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

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

cnf(g20,plain,
    ( ~ sPE(sK50,nil)
    | ~ sPE(sK49,sK49)
    | ~ segmentP(sK50,sK49)
    | segmentP(nil,sK49) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g22,plain,
    ( ~ ssItem(sK4(sK49))
    | strictorderedP(cons(sK4(sK49),nil)) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax68)]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07  % Problem  : SWC348+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.07  % Command  : satcop --statistics %s
% 0.06/0.25  % Computer : n028.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Sat Jun 11 20:48:20 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.10/0.45  % symbols: 77
% 0.10/0.45  % clauses: 268
% 0.10/0.45  % start clauses: 9
% 0.10/0.45  % iterative deepening steps: 30
% 0.10/0.45  % maximum path limit: 2
% 0.10/0.45  % literal attempts: 119861
% 0.10/0.45  % depth failures: 117018
% 0.10/0.45  % regularity failures: 127
% 0.10/0.45  % tautology failures: 596
% 0.10/0.45  % reductions: 313
% 0.10/0.45  % extensions: 119359
% 0.10/0.45  % SAT variables: 99776
% 0.10/0.45  % SAT clauses: 90197
% 0.10/0.45  % WalkSAT solutions: 90186
% 0.10/0.45  % CDCL solutions: 4
% 0.10/0.45  % SZS status Theorem for theBenchmark
% 0.10/0.45  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------