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

View Problem - Process Solution

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

% Computer : n003.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:26 EDT 2022

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

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

cnf(g1,plain,
    leq(pv10,minus(n135300,n1)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0010)]) ).

cnf(g2,plain,
    ( ~ leq(n0,n0)
    | ~ leq(n0,minus(n5,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0010)]) ).

cnf(g3,plain,
    leq(n0,n0),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',reflexivity_leq)]) ).

cnf(g4,plain,
    sPE(minus(n5,n1),minus(n5,n1)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    leq(minus(n5,n1),minus(n5,n1)),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',reflexivity_leq)]) ).

cnf(g6,plain,
    gt(n5,n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_0)]) ).

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

cnf(g8,plain,
    ( ~ sPE(minus(n5,n1),pred(n5))
    | ~ sPE(minus(n5,n1),minus(n5,n1))
    | ~ leq(minus(n5,n1),minus(n5,n1))
    | leq(pred(n5),minus(n5,n1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    sPE(minus(n5,n1),pred(n5)),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',pred_minus_1)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n003.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 19:42:26 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 25.34/3.59  % symbols: 68
% 25.34/3.59  % clauses: 213
% 25.34/3.59  % start clauses: 3
% 25.34/3.59  % iterative deepening steps: 1321
% 25.34/3.59  % maximum path limit: 3
% 25.34/3.59  % literal attempts: 10431612
% 25.34/3.59  % depth failures: 10275581
% 25.34/3.59  % regularity failures: 9941
% 25.34/3.59  % tautology failures: 52567
% 25.34/3.59  % reductions: 13648
% 25.34/3.59  % extensions: 10416133
% 25.34/3.59  % SAT variables: 151345
% 25.34/3.59  % SAT clauses: 183663
% 25.34/3.59  % WalkSAT solutions: 183656
% 25.34/3.59  % CDCL solutions: 6
% 25.34/3.59  % SZS status Theorem for theBenchmark
% 25.34/3.59  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------