TSTP Solution File: ARI608_1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : ARI608_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n027.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 : Wed Aug 30 17:41:28 EDT 2023

% Result   : Theorem 0.47s 1.16s
% Output   : CNFRefutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :  106 (   0 equ)
%            Maximal formula atoms :    5 (   5 avg)
%            Number of connectives :   46 (  19   ~;   9   |;  12   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   60 (  60 fml;   0 var)
%            Number arithmetic     :   48 (  33 atm;   0 fun;   0 num;  15 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   21 (   0 sgn;  15   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f1,conjecture,
    ( ( $less(b,c)
      & $lesseq(a,b)
      & ! [X0: $int,X1: $int] :
          ( $lesseq(X0,X1)
         => $lesseq(f(X0),f(X1)) ) )
   => $lesseq(f(a),f(c)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_mon_implies_trans) ).

tff(f2,negated_conjecture,
    ~ ( ( $less(b,c)
        & $lesseq(a,b)
        & ! [X0: $int,X1: $int] :
            ( $lesseq(X0,X1)
           => $lesseq(f(X0),f(X1)) ) )
     => $lesseq(f(a),f(c)) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f3,plain,
    ~ ( ( $less(b,c)
        & ~ $less(b,a)
        & ! [X0: $int,X1: $int] :
            ( ~ $less(X1,X0)
           => ~ $less(f(X1),f(X0)) ) )
     => ~ $less(f(c),f(a)) ),
    inference(theory_normalization,[],[f2]) ).

tff(f10,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( ~ $less(X0,X1)
      | ~ $less(X1,X2)
      | $less(X0,X2) ),
    introduced(theory_axiom_146,[]) ).

tff(f16,plain,
    ( $less(f(c),f(a))
    & $less(b,c)
    & ~ $less(b,a)
    & ! [X0: $int,X1: $int] :
        ( ~ $less(f(X1),f(X0))
        | $less(X1,X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f17,plain,
    ( $less(f(c),f(a))
    & $less(b,c)
    & ~ $less(b,a)
    & ! [X0: $int,X1: $int] :
        ( ~ $less(f(X1),f(X0))
        | $less(X1,X0) ) ),
    inference(flattening,[],[f16]) ).

tff(f18,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(f(X1),f(X0))
      | $less(X1,X0) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f19,plain,
    ~ $less(b,a),
    inference(cnf_transformation,[],[f17]) ).

tff(f20,plain,
    $less(b,c),
    inference(cnf_transformation,[],[f17]) ).

tff(f21,plain,
    $less(f(c),f(a)),
    inference(cnf_transformation,[],[f17]) ).

cnf(c_54,plain,
    ( ~ $less_int(X0_3,X1_3)
    | ~ $less_int(X1_3,X2_3)
    | $less_int(X0_3,X2_3) ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_61,negated_conjecture,
    $less_int(f(c),f(a)),
    inference(cnf_transformation,[],[f21]) ).

cnf(c_62,negated_conjecture,
    $less_int(b,c),
    inference(cnf_transformation,[],[f20]) ).

cnf(c_63,negated_conjecture,
    ~ $less_int(b,a),
    inference(cnf_transformation,[],[f19]) ).

cnf(c_64,negated_conjecture,
    ( ~ $less_int(f(X0_3),f(X1_3))
    | $less_int(X0_3,X1_3) ),
    inference(cnf_transformation,[],[f18]) ).

cnf(c_565,plain,
    $less_int(c,a),
    inference(superposition,[status(thm)],[c_61,c_64]) ).

cnf(c_732,plain,
    ( ~ $less_int(c,X0_3)
    | $less_int(b,X0_3) ),
    inference(superposition,[status(thm)],[c_62,c_54]) ).

cnf(c_896,plain,
    $less_int(b,a),
    inference(superposition,[status(thm)],[c_565,c_732]) ).

cnf(c_902,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_896,c_63]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : ARI608_1 : TPTP v8.1.2. Released v5.1.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n027.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 18:59:08 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  Running TFA theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.16  % SZS status Started for theBenchmark.p
% 0.47/1.16  % SZS status Theorem for theBenchmark.p
% 0.47/1.16  
% 0.47/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.16  
% 0.47/1.16  ------  iProver source info
% 0.47/1.16  
% 0.47/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.16  git: non_committed_changes: false
% 0.47/1.16  git: last_make_outside_of_git: false
% 0.47/1.16  
% 0.47/1.16  ------ Parsing...
% 0.47/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.47/1.16  
% 0.47/1.16  ------ Preprocessing... sup_sim: 1  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 
% 0.47/1.16  
% 0.47/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.47/1.16  
% 0.47/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.47/1.16  ------ Proving...
% 0.47/1.16  ------ Problem Properties 
% 0.47/1.16  
% 0.47/1.16  
% 0.47/1.16  clauses                                 16
% 0.47/1.16  conjectures                             4
% 0.47/1.16  EPR                                     6
% 0.47/1.16  Horn                                    14
% 0.47/1.16  unary                                   11
% 0.47/1.16  binary                                  3
% 0.47/1.16  lits                                    23
% 0.47/1.16  lits eq                                 7
% 0.47/1.16  fd_pure                                 0
% 0.47/1.16  fd_pseudo                               0
% 0.47/1.16  fd_cond                                 0
% 0.47/1.16  fd_pseudo_cond                          1
% 0.47/1.16  AC symbols                              1
% 0.47/1.16  
% 0.47/1.16  ------ Input Options Time Limit: Unbounded
% 0.47/1.16  
% 0.47/1.16  
% 0.47/1.16  ------ 
% 0.47/1.16  Current options:
% 0.47/1.16  ------ 
% 0.47/1.16  
% 0.47/1.16  
% 0.47/1.16  
% 0.47/1.16  
% 0.47/1.16  ------ Proving...
% 0.47/1.16  
% 0.47/1.16  
% 0.47/1.16  % SZS status Theorem for theBenchmark.p
% 0.47/1.16  
% 0.47/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.16  
% 0.47/1.16  
%------------------------------------------------------------------------------