TSTP Solution File: DAT057_1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : DAT057_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n011.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 02:14:18 EDT 2024

% Result   : Theorem 1.31s 1.20s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   90 (  29 equ)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :   29 (  16   ~;   6   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   60 (  60 fml;   0 var)
%            Number arithmetic     :   18 (   0 atm;   0 fun;   0 num;  18 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   40 (   1 sgn  28   !;   8   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f3,axiom,
    ! [X3: $int,X2: data,X1: array,X0: $int] :
      ( ( X0 != X3 )
     => ( get(put(X1,X3,X2),X0) = get(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_19) ).

tff(f6,conjecture,
    ! [X2: data,X1: array,X0: $int,X3: $int] :
      ( ( X0 = X3 )
      | ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_1) ).

tff(f7,negated_conjecture,
    ~ ! [X2: data,X1: array,X0: $int,X3: $int] :
        ( ( X0 = X3 )
        | ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
    inference(negated_conjecture,[],[f6]) ).

tff(f9,plain,
    ! [X0: $int,X1: data,X2: array,X3: $int] :
      ( ( X0 != X3 )
     => ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
    inference(rectify,[],[f3]) ).

tff(f12,plain,
    ~ ! [X0: data,X1: array,X2: $int,X3: $int] :
        ( ( X2 = X3 )
        | ( get(X1,X3) = get(put(X1,X2,X0),X3) ) ),
    inference(rectify,[],[f7]) ).

tff(f13,plain,
    ! [X0: $int,X1: data,X2: array,X3: $int] :
      ( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
      | ( X0 = X3 ) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f14,plain,
    ? [X0: data,X1: array,X2: $int,X3: $int] :
      ( ( X2 != X3 )
      & ( get(X1,X3) != get(put(X1,X2,X0),X3) ) ),
    inference(ennf_transformation,[],[f12]) ).

tff(f19,plain,
    ( ? [X0: data,X1: array,X2: $int,X3: $int] :
        ( ( X2 != X3 )
        & ( get(X1,X3) != get(put(X1,X2,X0),X3) ) )
   => ( ( sK3 != sK4 )
      & ( get(sK2,sK4) != get(put(sK2,sK3,sK1),sK4) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f20,plain,
    ( ( sK3 != sK4 )
    & ( get(sK2,sK4) != get(put(sK2,sK3,sK1),sK4) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f14,f19]) ).

tff(f23,plain,
    ! [X2: array,X3: $int,X0: $int,X1: data] :
      ( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
      | ( X0 = X3 ) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f27,plain,
    get(sK2,sK4) != get(put(sK2,sK3,sK1),sK4),
    inference(cnf_transformation,[],[f20]) ).

tff(f28,plain,
    sK3 != sK4,
    inference(cnf_transformation,[],[f20]) ).

cnf(c_51,plain,
    ( get(put(X0_14,X0_3,X0_13),X1_3) = get(X0_14,X1_3)
    | X0_3 = X1_3 ),
    inference(cnf_transformation,[],[f23]) ).

cnf(c_54,negated_conjecture,
    sK3 != sK4,
    inference(cnf_transformation,[],[f28]) ).

cnf(c_55,negated_conjecture,
    get(put(sK2,sK3,sK1),sK4) != get(sK2,sK4),
    inference(cnf_transformation,[],[f27]) ).

cnf(c_171,plain,
    sK3 = sK4,
    inference(superposition,[status(thm)],[c_51,c_55]) ).

cnf(c_172,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_171,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : DAT057_1 : TPTP v8.1.2. Released v5.5.0.
% 0.04/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.36  % Computer : n011.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu May  2 18:49:48 EDT 2024
% 0.14/0.36  % CPUTime  : 
% 0.21/0.49  Running TFA theorem proving
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.31/1.20  % SZS status Started for theBenchmark.p
% 1.31/1.20  % SZS status Theorem for theBenchmark.p
% 1.31/1.20  
% 1.31/1.20  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.31/1.20  
% 1.31/1.20  ------  iProver source info
% 1.31/1.20  
% 1.31/1.20  git: date: 2024-05-02 19:28:25 +0000
% 1.31/1.20  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.31/1.20  git: non_committed_changes: false
% 1.31/1.20  
% 1.31/1.20  ------ Parsing...
% 1.31/1.20  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.31/1.20  
% 1.31/1.20  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.31/1.20  
% 1.31/1.20  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.31/1.20  
% 1.31/1.20  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.31/1.20  ------ Proving...
% 1.31/1.20  ------ Problem Properties 
% 1.31/1.20  
% 1.31/1.20  
% 1.31/1.20  clauses                                 7
% 1.31/1.20  conjectures                             2
% 1.31/1.20  EPR                                     1
% 1.31/1.20  Horn                                    6
% 1.31/1.20  unary                                   5
% 1.31/1.20  binary                                  2
% 1.31/1.20  lits                                    9
% 1.31/1.20  lits eq                                 9
% 1.31/1.20  fd_pure                                 0
% 1.31/1.20  fd_pseudo                               0
% 1.31/1.20  fd_cond                                 0
% 1.31/1.20  fd_pseudo_cond                          2
% 1.31/1.20  AC symbols                              0
% 1.31/1.20  
% 1.31/1.20  ------ Input Options Time Limit: Unbounded
% 1.31/1.20  
% 1.31/1.20  
% 1.31/1.20  ------ 
% 1.31/1.20  Current options:
% 1.31/1.20  ------ 
% 1.31/1.20  
% 1.31/1.20  
% 1.31/1.20  
% 1.31/1.20  
% 1.31/1.20  ------ Proving...
% 1.31/1.20  
% 1.31/1.20  
% 1.31/1.20  % SZS status Theorem for theBenchmark.p
% 1.31/1.20  
% 1.31/1.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.31/1.20  
% 1.31/1.20  
%------------------------------------------------------------------------------