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

% 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  : 300s
% DateTime : Fri May  3 03:13:26 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

fof(f53,conjecture,
    ( ( leq(pv31,minus(n5,n1))
      & leq(n0,pv31) )
   => ( ( n0 = pv70
       => true )
      & ( n0 != pv70
       => ( leq(pv31,minus(n5,n1))
          & leq(n0,pv31) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0019) ).

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

fof(f147,plain,
    ( ( ( ~ true
        & n0 = pv70 )
      | ( ( ~ leq(pv31,minus(n5,n1))
          | ~ leq(n0,pv31) )
        & n0 != pv70 ) )
    & leq(pv31,minus(n5,n1))
    & leq(n0,pv31) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f148,plain,
    ( ( ( ~ true
        & n0 = pv70 )
      | ( ( ~ leq(pv31,minus(n5,n1))
          | ~ leq(n0,pv31) )
        & n0 != pv70 ) )
    & leq(pv31,minus(n5,n1))
    & leq(n0,pv31) ),
    inference(flattening,[],[f147]) ).

fof(f324,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f326,plain,
    leq(n0,pv31),
    inference(cnf_transformation,[],[f148]) ).

fof(f327,plain,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[],[f148]) ).

fof(f331,plain,
    ( ~ true
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31) ),
    inference(cnf_transformation,[],[f148]) ).

cnf(c_156,plain,
    true,
    inference(cnf_transformation,[],[f324]) ).

cnf(c_158,negated_conjecture,
    ( ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31)
    | ~ true ),
    inference(cnf_transformation,[],[f331]) ).

cnf(c_161,negated_conjecture,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[],[f327]) ).

cnf(c_162,negated_conjecture,
    leq(n0,pv31),
    inference(cnf_transformation,[],[f326]) ).

cnf(c_230,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_158,c_161,c_162,c_156]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem  : SWV078+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n003.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri May  3 00:39:20 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/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
% 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-05-02 19:28:25 +0000
% 0.49/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 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  
%------------------------------------------------------------------------------