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

View Problem - Process Solution

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

% Computer : n026.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:40 EDT 2022

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

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

cnf(g1,plain,
    leq(n1,loopcounter),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0010)]) ).

cnf(g2,plain,
    ( ~ gt(loopcounter,n0)
    | leq(n0,s_sworst7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0010)]) ).

cnf(g3,plain,
    ~ leq(n0,s_sworst7),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0010)]) ).

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

cnf(g5,plain,
    ( ~ leq(n0,loopcounter)
    | sPE(n0,loopcounter)
    | gt(loopcounter,n0) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',leq_gt2)]) ).

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

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

cnf(g8,plain,
    ( ~ leq(pv1341,pv1341)
    | ~ leq(tptp_float_0_001,pv1341)
    | ~ leq(n0,n0)
    | ~ leq(n0,n0)
    | sPE(a_select3(tptp_const_array2(dim(tptp_float_0_001,pv1341),dim(n0,n0),n0),pv1341,n0),n0) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',const_array2_select)]) ).

cnf(g9,plain,
    ( ~ sPE(a_select3(tptp_const_array2(dim(tptp_float_0_001,pv1341),dim(n0,n0),n0),pv1341,n0),n0)
    | sPE(n0,a_select3(tptp_const_array2(dim(tptp_float_0_001,pv1341),dim(n0,n0),n0),pv1341,n0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(n0,a_select3(tptp_const_array2(dim(tptp_float_0_001,pv1341),dim(n0,n0),n0),pv1341,n0))
    | ~ sPE(a_select3(tptp_const_array2(dim(tptp_float_0_001,pv1341),dim(n0,n0),n0),pv1341,n0),n0)
    | sPE(n0,n0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g13,plain,
    ( ~ gt(succ(loopcounter),n1)
    | ~ gt(n1,n0)
    | gt(succ(loopcounter),n0) ),
    inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',transitivity_gt)]) ).

cnf(g14,plain,
    ( ~ sPE(n1,n1)
    | ~ sPE(loopcounter,n0)
    | ~ leq(n1,loopcounter)
    | leq(n1,n0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    sPE(n1,n1),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g18,plain,
    ( ~ sPE(n1,loopcounter)
    | ~ sPE(n0,n0)
    | ~ gt(n1,n0)
    | gt(loopcounter,n0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    gt(n1,n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0)]) ).

cnf(g20,plain,
    ( ~ sPE(n1,n0)
    | ~ sPE(n0,loopcounter)
    | sPE(n1,loopcounter) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV140+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun 16 07:02:38 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 2.92/0.71  % symbols: 72
% 2.92/0.71  % clauses: 218
% 2.92/0.71  % start clauses: 15
% 2.92/0.71  % iterative deepening steps: 294
% 2.92/0.71  % maximum path limit: 2
% 2.92/0.71  % literal attempts: 815018
% 2.92/0.71  % depth failures: 727829
% 2.92/0.71  % regularity failures: 912
% 2.92/0.71  % tautology failures: 87904
% 2.92/0.71  % reductions: 58532
% 2.92/0.71  % extensions: 752300
% 2.92/0.71  % SAT variables: 64560
% 2.92/0.71  % SAT clauses: 88537
% 2.92/0.71  % WalkSAT solutions: 88533
% 2.92/0.71  % CDCL solutions: 3
% 2.92/0.71  % SZS status Theorem for theBenchmark
% 2.92/0.71  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------