TSTP Solution File: SWV139+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV139+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n029.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  : 300s
% DateTime : Mon Jun 24 17:09:28 EDT 2024

% Result   : Theorem 3.84s 1.08s
% Output   : CNFRefutation 3.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   55 (  26 unt;   0 def)
%            Number of atoms       :  196 (  13 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  203 (  62   ~;  54   |;  57   &)
%                                         (   1 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X1,X2)
        & leq(X0,X1) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( gt(X1,X0)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt1) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ( X0 != X1
        & leq(X0,X1) )
     => gt(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt2) ).

fof(f13,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> gt(succ(X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).

fof(f29,axiom,
    ! [X0] : succ(X0) = plus(X0,n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).

fof(f53,conjecture,
    ( ( ( gt(loopcounter,n0)
       => leq(s_worst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_best7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_worst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_sworst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_best7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_worst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_sworst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_best7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_worst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_best7) )
      & leq(n1,loopcounter)
      & leq(tptp_float_0_001,pv1341) )
   => leq(n0,s_best7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0009) ).

fof(f54,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => leq(s_worst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_sworst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_best7,n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_worst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_sworst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_best7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_worst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_sworst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_best7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_worst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_sworst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_best7) )
        & leq(n1,loopcounter)
        & leq(tptp_float_0_001,pv1341) )
     => leq(n0,s_best7) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f64,axiom,
    gt(n1,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_1_0) ).

fof(f84,axiom,
    n1 = succ(n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).

fof(f110,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f111,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(flattening,[],[f110]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | X0 = X1
      | ~ leq(X0,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | X0 = X1
      | ~ leq(X0,X1) ),
    inference(flattening,[],[f113]) ).

fof(f148,plain,
    ( ~ leq(n0,s_best7)
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & leq(n1,loopcounter)
    & leq(tptp_float_0_001,pv1341) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f149,plain,
    ( ~ leq(n0,s_best7)
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & leq(n1,loopcounter)
    & leq(tptp_float_0_001,pv1341) ),
    inference(flattening,[],[f148]) ).

fof(f170,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | ~ gt(succ(X1),X0) )
      & ( gt(succ(X1),X0)
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f218,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f220,plain,
    ! [X2,X0,X1] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f221,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(cnf_transformation,[],[f112]) ).

fof(f222,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | X0 = X1
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f114]) ).

fof(f227,plain,
    ! [X0,X1] :
      ( gt(succ(X1),X0)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f170]) ).

fof(f296,plain,
    ! [X0] : succ(X0) = plus(X0,n1),
    inference(cnf_transformation,[],[f29]) ).

fof(f327,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f149]) ).

fof(f334,plain,
    ( leq(n0,s_best7)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[],[f149]) ).

fof(f338,plain,
    ( leq(s_sworst7,n3)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[],[f149]) ).

fof(f340,plain,
    ~ leq(n0,s_best7),
    inference(cnf_transformation,[],[f149]) ).

fof(f350,plain,
    gt(n1,n0),
    inference(cnf_transformation,[],[f64]) ).

fof(f370,plain,
    n1 = succ(n0),
    inference(cnf_transformation,[],[f84]) ).

fof(f378,plain,
    ! [X0,X1] :
      ( gt(plus(X1,n1),X0)
      | ~ leq(X0,X1) ),
    inference(definition_unfolding,[],[f227,f296]) ).

fof(f396,plain,
    n1 = plus(n0,n1),
    inference(definition_unfolding,[],[f370,f296]) ).

cnf(c_51,plain,
    ~ gt(X0,X0),
    inference(cnf_transformation,[],[f218]) ).

cnf(c_53,plain,
    ( ~ leq(X0,X1)
    | ~ leq(X1,X2)
    | leq(X0,X2) ),
    inference(cnf_transformation,[],[f220]) ).

cnf(c_54,plain,
    ( ~ gt(X0,X1)
    | leq(X1,X0) ),
    inference(cnf_transformation,[],[f221]) ).

cnf(c_55,plain,
    ( ~ leq(X0,X1)
    | X0 = X1
    | gt(X1,X0) ),
    inference(cnf_transformation,[],[f222]) ).

cnf(c_61,plain,
    ( ~ leq(X0,X1)
    | gt(plus(X1,n1),X0) ),
    inference(cnf_transformation,[],[f378]) ).

cnf(c_157,negated_conjecture,
    ~ leq(n0,s_best7),
    inference(cnf_transformation,[],[f340]) ).

cnf(c_159,negated_conjecture,
    ( ~ gt(loopcounter,n0)
    | leq(s_sworst7,n3) ),
    inference(cnf_transformation,[],[f338]) ).

cnf(c_163,negated_conjecture,
    ( ~ gt(loopcounter,n0)
    | leq(n0,s_best7) ),
    inference(cnf_transformation,[],[f334]) ).

cnf(c_170,negated_conjecture,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f327]) ).

cnf(c_181,plain,
    gt(n1,n0),
    inference(cnf_transformation,[],[f350]) ).

cnf(c_201,plain,
    plus(n0,n1) = n1,
    inference(cnf_transformation,[],[f396]) ).

cnf(c_314,negated_conjecture,
    ~ gt(loopcounter,n0),
    inference(global_subsumption_just,[status(thm)],[c_159,c_157,c_163]) ).

cnf(c_11209,negated_conjecture,
    ~ gt(loopcounter,n0),
    inference(demodulation,[status(thm)],[c_314]) ).

cnf(c_11211,negated_conjecture,
    leq(n1,loopcounter),
    inference(demodulation,[status(thm)],[c_170]) ).

cnf(c_14067,plain,
    leq(n0,n1),
    inference(superposition,[status(thm)],[c_181,c_54]) ).

cnf(c_14204,plain,
    ~ leq(plus(X0,n1),X0),
    inference(superposition,[status(thm)],[c_61,c_51]) ).

cnf(c_14258,plain,
    ~ leq(n1,n0),
    inference(superposition,[status(thm)],[c_201,c_14204]) ).

cnf(c_15497,plain,
    ( ~ leq(X0,n1)
    | leq(X0,loopcounter) ),
    inference(superposition,[status(thm)],[c_11211,c_53]) ).

cnf(c_16163,plain,
    leq(n0,loopcounter),
    inference(superposition,[status(thm)],[c_14067,c_15497]) ).

cnf(c_16231,plain,
    ( n0 = loopcounter
    | gt(loopcounter,n0) ),
    inference(superposition,[status(thm)],[c_16163,c_55]) ).

cnf(c_16232,plain,
    n0 = loopcounter,
    inference(forward_subsumption_resolution,[status(thm)],[c_16231,c_11209]) ).

cnf(c_16239,plain,
    leq(n1,n0),
    inference(demodulation,[status(thm)],[c_11211,c_16232]) ).

cnf(c_16240,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_16239,c_14258]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15  % Problem  : SWV139+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.08/0.15  % Command  : run_iprover %s %d THM
% 0.15/0.37  % Computer : n029.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Jun 20 19:28:09 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 0.24/0.47  Running first-order theorem proving
% 0.24/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.84/1.08  % SZS status Started for theBenchmark.p
% 3.84/1.08  % SZS status Theorem for theBenchmark.p
% 3.84/1.08  
% 3.84/1.08  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.84/1.08  
% 3.84/1.08  ------  iProver source info
% 3.84/1.08  
% 3.84/1.08  git: date: 2024-06-12 09:56:46 +0000
% 3.84/1.08  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.84/1.08  git: non_committed_changes: false
% 3.84/1.08  
% 3.84/1.08  ------ Parsing...
% 3.84/1.08  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.84/1.08  
% 3.84/1.08  ------ Preprocessing... sup_sim: 15  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 3.84/1.08  
% 3.84/1.08  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.84/1.08  
% 3.84/1.08  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.84/1.08  ------ Proving...
% 3.84/1.08  ------ Problem Properties 
% 3.84/1.08  
% 3.84/1.08  
% 3.84/1.08  clauses                                 144
% 3.84/1.08  conjectures                             4
% 3.84/1.08  EPR                                     40
% 3.84/1.08  Horn                                    94
% 3.84/1.08  unary                                   50
% 3.84/1.08  binary                                  34
% 3.84/1.08  lits                                    483
% 3.84/1.08  lits eq                                 113
% 3.84/1.08  fd_pure                                 0
% 3.84/1.08  fd_pseudo                               0
% 3.84/1.08  fd_cond                                 6
% 3.84/1.08  fd_pseudo_cond                          4
% 3.84/1.08  AC symbols                              0
% 3.84/1.08  
% 3.84/1.08  ------ Schedule dynamic 5 is on 
% 3.84/1.08  
% 3.84/1.08  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.84/1.08  
% 3.84/1.08  
% 3.84/1.08  ------ 
% 3.84/1.08  Current options:
% 3.84/1.08  ------ 
% 3.84/1.08  
% 3.84/1.08  
% 3.84/1.08  
% 3.84/1.08  
% 3.84/1.08  ------ Proving...
% 3.84/1.08  
% 3.84/1.08  
% 3.84/1.08  % SZS status Theorem for theBenchmark.p
% 3.84/1.08  
% 3.84/1.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.84/1.08  
% 3.84/1.09  
%------------------------------------------------------------------------------