%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWV165+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n005.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 : Wed Jul 20 21:27:44 EDT 2022

% Result   : Theorem 14.19s 2.17s
% Output   : Proof 14.58s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    leq(n0,sK27),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0001)]) ).

cnf(g1,plain,
    leq(sK27,tptp_minus_1),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0001)]) ).

cnf(g2,plain,
    ~ sPE(uninit,init),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0001)]) ).

cnf(g3,plain,
    ( ~ leq(sK27,n0)
    | ~ leq(n0,sK27)
    | sPE(sK27,n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0)]) ).

cnf(g4,plain,
    ( ~ leq(sK27,tptp_minus_1)
    | gt(succ(tptp_minus_1),sK27) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',leq_succ_gt_equiv)]) ).

cnf(g5,plain,
    ( ~ sPE(plus(sK27,n5),succ(succ(succ(succ(succ(sK27))))))
    | ~ sPE(a_select3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),init,succ(succ(succ(succ(succ(sK27)))))),sK27)
    | sPE(uninit,init)
    | sPE(a_select3(tptp_update3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),uninit,plus(sK27,n5),sK27),init,succ(succ(succ(succ(succ(sK27)))))),sK27) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',sel3_update_2)]) ).

cnf(g6,plain,
    sPE(a_select3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),init,succ(succ(succ(succ(succ(sK27)))))),sK27),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',sel3_update_1)]) ).

cnf(g7,plain,
    sPE(plus(sK27,n5),succ(succ(succ(succ(succ(sK27)))))),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',succ_plus_5_r)]) ).

cnf(g8,plain,
    ( ~ sPE(a_select3(tptp_update3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),uninit,plus(sK27,n5),sK27),init,succ(succ(succ(succ(succ(sK27)))))),sK27)
    | sPE(sK27,a_select3(tptp_update3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),uninit,plus(sK27,n5),sK27),init,succ(succ(succ(succ(succ(sK27))))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(sK27,a_select3(tptp_update3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),uninit,plus(sK27,n5),sK27),init,succ(succ(succ(succ(succ(sK27)))))))
    | ~ sPE(a_select3(tptp_update3(tptp_update3(sK27,init,succ(succ(succ(succ(succ(sK27))))),sK27),uninit,plus(sK27,n5),sK27),init,succ(succ(succ(succ(succ(sK27)))))),sK27)
    | sPE(sK27,sK27) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ gt(n0,sK27)
    | leq(sK27,n0) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',leq_gt1)]) ).

cnf(g11,plain,
    sPE(succ(tptp_minus_1),n0),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',succ_tptp_minus_1)]) ).

cnf(g12,plain,
    ~ gt(n0,n0),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',irreflexivity_gt)]) ).

cnf(g13,plain,
    ( ~ sPE(succ(tptp_minus_1),n0)
    | ~ sPE(sK27,sK27)
    | ~ gt(succ(tptp_minus_1),sK27)
    | gt(n0,sK27) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(succ(tptp_minus_1),n0)
    | ~ sPE(sK27,n0)
    | ~ gt(succ(tptp_minus_1),sK27)
    | gt(n0,n0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV165+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n005.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 : Wed Jun 15 11:34:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 14.19/2.17  % symbols: 69
% 14.19/2.17  % clauses: 206
% 14.19/2.17  % start clauses: 3
% 14.19/2.17  % iterative deepening steps: 1204
% 14.19/2.17  % maximum path limit: 3
% 14.19/2.17  % literal attempts: 4583105
% 14.19/2.17  % depth failures: 4436322
% 14.19/2.17  % regularity failures: 3225
% 14.19/2.17  % tautology failures: 447209
% 14.19/2.17  % reductions: 77784
% 14.19/2.17  % extensions: 4504287
% 14.19/2.17  % SAT variables: 601882
% 14.19/2.17  % SAT clauses: 612628
% 14.19/2.17  % WalkSAT solutions: 612618
% 14.19/2.17  % CDCL solutions: 6
% 14.19/2.17  % SZS status Theorem for theBenchmark
% 14.19/2.17  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------