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

View Problem - Process Solution

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

% Computer : n015.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 101.91s 13.17s
% Output   : Proof 101.91s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

cnf(g2,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(g3,plain,
    ( ~ gt(n0,sK27)
    | leq(sK27,pred(n0)) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',leq_gt_pred)]) ).

cnf(g4,plain,
    ( ~ leq(n0,pred(n0))
    | gt(n0,n0) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',leq_gt_pred)]) ).

cnf(g5,plain,
    sPE(sK27,sK27),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ leq(n0,sK27)
    | ~ leq(sK27,pred(n0))
    | leq(n0,pred(n0)) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',transitivity_leq)]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV163+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n015.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 : Tue Jun 14 18:47:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 101.91/13.17  % symbols: 76
% 101.91/13.17  % clauses: 219
% 101.91/13.17  % start clauses: 6
% 101.91/13.17  % iterative deepening steps: 1774
% 101.91/13.17  % maximum path limit: 3
% 101.91/13.17  % literal attempts: 47507073
% 101.91/13.17  % depth failures: 46941291
% 101.91/13.17  % regularity failures: 18177
% 101.91/13.17  % tautology failures: 293031
% 101.91/13.17  % reductions: 44229
% 101.91/13.17  % extensions: 47457784
% 101.91/13.17  % SAT variables: 498729
% 101.91/13.17  % SAT clauses: 571301
% 101.91/13.17  % WalkSAT solutions: 571292
% 101.91/13.17  % CDCL solutions: 8
% 101.91/13.17  % SZS status Theorem for theBenchmark
% 101.91/13.17  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------