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

% Computer : n023.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:49 EDT 2022

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

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

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

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

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

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

cnf(g5,plain,
    ssList(sK51),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

cnf(g6,plain,
    sPE(app(sK49,sK51),sK50),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

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

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

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

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

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

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

cnf(g13,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK49)
    | ~ ssList(sK51)
    | ~ frontsegP(sK49,sK49)
    | frontsegP(app(sK49,sK51),sK49) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax43)]) ).

cnf(g14,plain,
    ( ~ sPE(app(sK49,sK51),sK50)
    | ~ sPE(sK49,sK49)
    | ~ frontsegP(app(sK49,sK51),sK49)
    | frontsegP(sK50,sK49) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ ssList(sK48)
    | ~ ssList(sK49)
    | ~ ssList(sK47)
    | ~ frontsegP(sK48,sK49)
    | ~ frontsegP(sK49,sK47)
    | frontsegP(sK48,sK47) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax40)]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC351+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n023.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 20:35:21 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.41  % symbols: 78
% 0.20/0.41  % clauses: 272
% 0.20/0.41  % start clauses: 13
% 0.20/0.41  % iterative deepening steps: 69
% 0.20/0.41  % maximum path limit: 1
% 0.20/0.41  % literal attempts: 99856
% 0.20/0.41  % depth failures: 98501
% 0.20/0.41  % regularity failures: 9
% 0.20/0.41  % tautology failures: 192
% 0.20/0.41  % reductions: 75
% 0.20/0.41  % extensions: 98989
% 0.20/0.41  % SAT variables: 17492
% 0.20/0.41  % SAT clauses: 19293
% 0.20/0.41  % WalkSAT solutions: 19288
% 0.20/0.41  % CDCL solutions: 0
% 0.20/0.41  % SZS status Theorem for theBenchmark
% 0.20/0.41  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------