↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : DAT057_1 : TPTP v9.3.1. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 01:13:56 PM UTC 2026

% Result   : Theorem 0.39s 1.16s
% Output   : CNFRefutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   18 (  10   ~;   5   |;   2   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   14 (   0 atm;   0 fun;   0 num;  14 var)
%            Number of types       :    1 (   0 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-3 aty)
%            Number of variables   :   28 (   0 sgn  24   !;   4   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    mkarray: array ).

tff(func_def_1,type,
    none: data ).

tff(func_def_2,type,
    put: ( data * ( $int * array ) ) > array ).

tff(func_def_3,type,
    get: ( $int * array ) > data ).

tff(func_def_4,type,
    sK0: ( array * array ) > $int ).

tff(func_def_5,type,
    sK1: data ).

tff(func_def_6,type,
    sK2: array ).

tff(func_def_7,type,
    sK3: $int ).

tff(func_def_8,type,
    sK4: $int ).

tff(f3,axiom,
    ! [X0: $int,X1: data,X2: array,X3: $int] :
      ( ( X3 != X0 )
     => ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_19) ).

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

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

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

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

tff(f13,plain,
    ( ( sK3 != sK4 )
    & ( get(put(sK2,sK3,sK1),sK4) != get(sK2,sK4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4)],[f9]) ).

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

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

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

tcf(c_51,plain,
    ! [X0_int: $int,X0_data: data,X0_array: array,X1_int: $int] :
      ( ( X0_int = X1_int )
      | ( get(put(X0_array,X0_int,X0_data),X1_int) = get(X0_array,X1_int) ) ),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_54,negated_conjecture,
    get(put(sK2,sK3,sK1),sK4) != get(sK2,sK4),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_55,negated_conjecture,
    sK3 != sK4,
    inference(cnf_transformation,[],[f20]) ).

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

tcf(c_172,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_171,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT057_1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36  % Computer : n019.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 10:22:49 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40  Running TFA theorem proving
% 0.08/0.40  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.41  
% 0.08/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41  
% 0.08/0.41  % Detected problem language: tptp
% 0.08/0.42  % Proving...
% 0.39/1.16  % SZS status Started for theBenchmark.p
% 0.39/1.16  % SZS status Theorem for theBenchmark.p
% 0.39/1.16  
% 0.39/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.39/1.16  
% 0.39/1.16  % ------  iProver source info
% 0.39/1.16  
% 0.39/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 0.39/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.39/1.16  % git: non_committed_changes: false
% 0.39/1.16  
% 0.39/1.16  % ------ Parsing...
% 0.39/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.39/1.16  
% 0.39/1.16  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 0.39/1.16  
% 0.39/1.16  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 0.39/1.16  
% 0.39/1.16  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.39/1.16  % ------ Proving...
% 0.39/1.16  % ------ Problem Properties 
% 0.39/1.16  
% 0.39/1.16  % 
% 0.39/1.16  % clauses                               7
% 0.39/1.16  % conjectures                           2
% 0.39/1.16  % EPR                                   1
% 0.39/1.16  % Horn                                  6
% 0.39/1.16  % unary                                 5
% 0.39/1.16  % binary                                2
% 0.39/1.16  % lits                                  9
% 0.39/1.16  % lits eq                               9
% 0.39/1.16  % fd_pure                               0
% 0.39/1.16  % fd_pseudo                             0
% 0.39/1.16  % fd_cond                               0
% 0.39/1.16  % fd_pseudo_cond                        2
% 0.39/1.16  % AC symbols                            0
% 0.39/1.16  
% 0.39/1.16  % ------ Input Options Time Limit: Unbounded
% 0.39/1.16  
% 0.39/1.16  
% 0.39/1.16  % ------ 
% 0.39/1.16  % Current options:
% 0.39/1.16  % ------ 
% 0.39/1.16  
% 0.39/1.16  
% 0.39/1.16  % 
% 0.39/1.16  
% 0.39/1.16  % ------ Proving...
% 0.39/1.16  % 
% 0.39/1.16  
% 0.39/1.16  % SZS status Theorem for theBenchmark.p
% 0.39/1.16  
% 0.39/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.39/1.16  
% 0.39/1.16  
%------------------------------------------------------------------------------