TSTP Solution File: SWV123+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SWV123+1 : TPTP v8.1.2. 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 : Thu Aug 31 22:31:14 EDT 2023

% Result   : Theorem 0.48s 1.19s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   6 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :   41 (   5   ~;   0   |;  22   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 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(f51,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).

fof(f53,conjecture,
    ( geq(minus(n3,n1),n0)
   => ( geq(minus(n6,n1),n0)
     => ( ( geq(minus(n999,n1),n0)
          & geq(n2,n0) )
       => ( geq(minus(n6,n1),n0)
         => ( geq(minus(n6,n1),n0)
           => ( geq(minus(n6,n1),n0)
             => ( ( geq(minus(n999,n1),n0)
                  & geq(minus(n3,n1),n0) )
               => true ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0016) ).

fof(f54,negated_conjecture,
    ~ ( geq(minus(n3,n1),n0)
     => ( geq(minus(n6,n1),n0)
       => ( ( geq(minus(n999,n1),n0)
            & geq(n2,n0) )
         => ( geq(minus(n6,n1),n0)
           => ( geq(minus(n6,n1),n0)
             => ( geq(minus(n6,n1),n0)
               => ( ( geq(minus(n999,n1),n0)
                    & geq(minus(n3,n1),n0) )
                 => true ) ) ) ) ) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f166,plain,
    ( ~ true
    & geq(minus(n999,n1),n0)
    & geq(minus(n3,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n999,n1),n0)
    & geq(n2,n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n3,n1),n0) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f167,plain,
    ( ~ true
    & geq(minus(n999,n1),n0)
    & geq(minus(n3,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n999,n1),n0)
    & geq(n2,n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n3,n1),n0) ),
    inference(flattening,[],[f166]) ).

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

fof(f357,plain,
    ~ true,
    inference(cnf_transformation,[],[f167]) ).

cnf(c_157,plain,
    true,
    inference(cnf_transformation,[],[f346]) ).

cnf(c_159,negated_conjecture,
    ~ true,
    inference(cnf_transformation,[],[f357]) ).

cnf(c_218,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_159,c_157]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV123+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n022.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 : Tue Aug 29 05:17:54 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.19  % SZS status Started for theBenchmark.p
% 0.48/1.19  % SZS status Theorem for theBenchmark.p
% 0.48/1.19  
% 0.48/1.19  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.19  
% 0.48/1.19  ------  iProver source info
% 0.48/1.19  
% 0.48/1.19  git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.19  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.19  git: non_committed_changes: false
% 0.48/1.19  git: last_make_outside_of_git: false
% 0.48/1.19  
% 0.48/1.19  ------ Parsing...
% 0.48/1.19  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.48/1.19  
% 0.48/1.19  ------ Preprocessing...
% 0.48/1.19  
% 0.48/1.19  % SZS status Theorem for theBenchmark.p
% 0.48/1.19  
% 0.48/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.19  
% 0.48/1.19  
%------------------------------------------------------------------------------