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

View Problem - Process Solution

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

% Computer : n022.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:01 EDT 2022

% Result   : Theorem 2.11s 0.71s
% Output   : Proof 2.76s
% 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(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,
    neq(sK48,nil),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).

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

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

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

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

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

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

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

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

cnf(g14,plain,
    ( ~ sPE(nil,cons(sK51,nil))
    | ~ ssItem(sK51)
    | ~ ssList(nil) ),
    inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax21)]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC217+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14  % Command  : satcop --statistics %s
% 0.15/0.36  % Computer : n022.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sat Jun 11 23:24:49 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 2.11/0.71  % symbols: 78
% 2.11/0.71  % clauses: 271
% 2.11/0.71  % start clauses: 12
% 2.11/0.71  % iterative deepening steps: 219
% 2.11/0.71  % maximum path limit: 1
% 2.11/0.71  % literal attempts: 633116
% 2.11/0.71  % depth failures: 546401
% 2.11/0.71  % regularity failures: 634
% 2.11/0.71  % tautology failures: 13941
% 2.11/0.71  % reductions: 74200
% 2.11/0.71  % extensions: 556340
% 2.11/0.71  % SAT variables: 246961
% 2.11/0.71  % SAT clauses: 254827
% 2.11/0.71  % WalkSAT solutions: 254814
% 2.11/0.71  % CDCL solutions: 7
% 2.11/0.71  % SZS status Theorem for theBenchmark
% 2.11/0.71  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------