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

View Problem - Process Solution

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

% Computer : n024.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:53:57 EDT 2022

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(g20,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(g21,plain,
    ( ~ sPE(nil,sK48)
    | ~ sPE(sK48,sK47)
    | sPE(nil,sK47) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.14/0.34  % Computer : n024.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 12 05:11:04 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.37  % symbols: 77
% 0.20/0.37  % clauses: 268
% 0.20/0.37  % start clauses: 9
% 0.20/0.37  % iterative deepening steps: 22
% 0.20/0.37  % maximum path limit: 1
% 0.20/0.37  % literal attempts: 18683
% 0.20/0.37  % depth failures: 18491
% 0.20/0.37  % regularity failures: 1
% 0.20/0.37  % tautology failures: 30
% 0.20/0.37  % reductions: 0
% 0.20/0.37  % extensions: 18547
% 0.20/0.37  % SAT variables: 7538
% 0.20/0.37  % SAT clauses: 9062
% 0.20/0.37  % WalkSAT solutions: 9055
% 0.20/0.37  % CDCL solutions: 0
% 0.20/0.37  % SZS status Theorem for theBenchmark
% 0.20/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------