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

View Problem - Process Solution

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

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

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

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

cnf(g2,plain,
    ssList(sK50),
    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,
    ~ rearsegP(sK48,sK47),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

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

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

cnf(g8,plain,
    ( ~ ssList(sK48)
    | rearsegP(sK48,nil) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax51)]) ).

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

cnf(g10,plain,
    ( ~ ssList(sK48)
    | rearsegP(sK48,sK48) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax49)]) ).

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

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

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

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

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

cnf(g16,plain,
    ( ~ sPE(sK48,sK48)
    | ~ sPE(nil,sK49)
    | ~ rearsegP(sK48,nil)
    | rearsegP(sK48,sK49) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWC367+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 12:46:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.02/0.73  % symbols: 78
% 3.02/0.73  % clauses: 270
% 3.02/0.73  % start clauses: 9
% 3.02/0.73  % iterative deepening steps: 35
% 3.02/0.73  % maximum path limit: 2
% 3.02/0.73  % literal attempts: 127435
% 3.02/0.73  % depth failures: 124708
% 3.02/0.73  % regularity failures: 124
% 3.02/0.73  % tautology failures: 357
% 3.02/0.73  % reductions: 113
% 3.02/0.73  % extensions: 127076
% 3.02/0.73  % SAT variables: 111547
% 3.02/0.73  % SAT clauses: 98505
% 3.02/0.73  % WalkSAT solutions: 98495
% 3.02/0.73  % CDCL solutions: 2
% 3.02/0.73  % SZS status Theorem for theBenchmark
% 3.02/0.73  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------