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

View Problem - Process Solution

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

% Computer : n020.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.36s 0.66s
% Output   : Proof 2.36s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

cnf(g3,plain,
    ~ leq(n0,s_best7),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0009)]) ).

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

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

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

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

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

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

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

cnf(g11,plain,
    ( ~ sPE(n0,a_select2(tptp_const_array1(dim(tptp_float_0_001,pv1341),n0),tptp_float_0_001))
    | ~ sPE(a_select2(tptp_const_array1(dim(tptp_float_0_001,pv1341),n0),tptp_float_0_001),n0)
    | sPE(n0,n0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

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

cnf(g16,plain,
    ( ~ sPE(n0,loopcounter)
    | ~ sPE(n0,n0)
    | ~ leq(n0,n0)
    | leq(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/sandbox2/benchmark/theBenchmark.p',finite_domain_0)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV139+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n020.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 20:14:34 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.36/0.66  % symbols: 72
% 2.36/0.66  % clauses: 218
% 2.36/0.66  % start clauses: 15
% 2.36/0.66  % iterative deepening steps: 239
% 2.36/0.66  % maximum path limit: 2
% 2.36/0.66  % literal attempts: 559389
% 2.36/0.66  % depth failures: 501796
% 2.36/0.66  % regularity failures: 555
% 2.36/0.66  % tautology failures: 62655
% 2.36/0.66  % reductions: 39252
% 2.36/0.66  % extensions: 516753
% 2.36/0.66  % SAT variables: 56146
% 2.36/0.66  % SAT clauses: 72492
% 2.36/0.66  % WalkSAT solutions: 72484
% 2.36/0.66  % CDCL solutions: 6
% 2.36/0.66  % SZS status Theorem for theBenchmark
% 2.36/0.66  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------