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

View Problem - Process Solution

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

% Computer : n022.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:09 EDT 2024

% Result   : Theorem 0.49s 1.17s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   9 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   51 (  17   ~;  12   |;  20   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( leq(pv36,minus(n135300,n1))
      & leq(pv31,minus(n5,n1))
      & leq(n0,pv36)
      & leq(n0,pv31) )
   => ( leq(pv36,minus(n135300,n1))
      & leq(pv31,minus(n5,n1))
      & leq(n0,pv36)
      & leq(n0,pv31) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0015) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv36,minus(n135300,n1))
        & leq(pv31,minus(n5,n1))
        & leq(n0,pv36)
        & leq(n0,pv31) )
     => ( leq(pv36,minus(n135300,n1))
        & leq(pv31,minus(n5,n1))
        & leq(n0,pv36)
        & leq(n0,pv31) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f155,plain,
    ( ( ~ leq(pv36,minus(n135300,n1))
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(n0,pv36)
      | ~ leq(n0,pv31) )
    & leq(pv36,minus(n135300,n1))
    & leq(pv31,minus(n5,n1))
    & leq(n0,pv36)
    & leq(n0,pv31) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f156,plain,
    ( ( ~ leq(pv36,minus(n135300,n1))
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(n0,pv36)
      | ~ leq(n0,pv31) )
    & leq(pv36,minus(n135300,n1))
    & leq(pv31,minus(n5,n1))
    & leq(n0,pv36)
    & leq(n0,pv31) ),
    inference(flattening,[],[f155]) ).

fof(f333,plain,
    leq(n0,pv31),
    inference(cnf_transformation,[],[f156]) ).

fof(f334,plain,
    leq(n0,pv36),
    inference(cnf_transformation,[],[f156]) ).

fof(f335,plain,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[],[f156]) ).

fof(f336,plain,
    leq(pv36,minus(n135300,n1)),
    inference(cnf_transformation,[],[f156]) ).

fof(f337,plain,
    ( ~ leq(pv36,minus(n135300,n1))
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv36)
    | ~ leq(n0,pv31) ),
    inference(cnf_transformation,[],[f156]) ).

cnf(c_157,negated_conjecture,
    ( ~ leq(pv36,minus(n135300,n1))
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv36)
    | ~ leq(n0,pv31) ),
    inference(cnf_transformation,[],[f337]) ).

cnf(c_158,negated_conjecture,
    leq(pv36,minus(n135300,n1)),
    inference(cnf_transformation,[],[f336]) ).

cnf(c_159,negated_conjecture,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[],[f335]) ).

cnf(c_160,negated_conjecture,
    leq(n0,pv36),
    inference(cnf_transformation,[],[f334]) ).

cnf(c_161,negated_conjecture,
    leq(n0,pv31),
    inference(cnf_transformation,[],[f333]) ).

cnf(c_246,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_157,c_158,c_159,c_160,c_161]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV074+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.11/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Jun 20 19:51:54 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.49/1.17  % SZS status Started for theBenchmark.p
% 0.49/1.17  % SZS status Theorem for theBenchmark.p
% 0.49/1.17  
% 0.49/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.17  
% 0.49/1.17  ------  iProver source info
% 0.49/1.17  
% 0.49/1.17  git: date: 2024-06-12 09:56:46 +0000
% 0.49/1.17  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.49/1.17  git: non_committed_changes: false
% 0.49/1.17  
% 0.49/1.17  ------ Parsing...
% 0.49/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.49/1.17  
% 0.49/1.17  ------ Preprocessing...
% 0.49/1.17  
% 0.49/1.17  % SZS status Theorem for theBenchmark.p
% 0.49/1.17  
% 0.49/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.17  
% 0.49/1.17  
%------------------------------------------------------------------------------