↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n009.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 12:53:46 PM UTC 2026

% Result   : Theorem 2.79s 1.19s
% Output   : CNFRefutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   40 (  11 unt;   0 def)
%            Number of atoms       :  137 (  45 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  155 (  58   ~;  50   |;  25   &)
%                                         (   0 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   71 (   0 sgn  70   !;   1   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] :
      ( sorti2(X0)
     => ! [X1] :
          ( sorti2(X1)
         => sorti2(op2(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

fof(f3,axiom,
    ! [X0] :
      ( sorti1(X0)
     => op1(X0,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

fof(f4,axiom,
    ~ ! [X0] :
        ( sorti2(X0)
       => op2(X0,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

fof(f5,conjecture,
    ( ( ! [X1] :
          ( sorti2(X1)
         => sorti1(j(X1)) )
      & ! [X0] :
          ( sorti1(X0)
         => sorti2(h(X0)) ) )
   => ~ ( ! [X7] :
            ( sorti1(X7)
           => j(h(X7)) = X7 )
        & ! [X6] :
            ( sorti2(X6)
           => h(j(X6)) = X6 )
        & ! [X4] :
            ( sorti2(X4)
           => ! [X5] :
                ( sorti2(X5)
               => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
        & ! [X2] :
            ( sorti1(X2)
           => ! [X3] :
                ( sorti1(X3)
               => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f6,negated_conjecture,
    ~ ( ( ! [X1] :
            ( sorti2(X1)
           => sorti1(j(X1)) )
        & ! [X0] :
            ( sorti1(X0)
           => sorti2(h(X0)) ) )
     => ~ ( ! [X7] :
              ( sorti1(X7)
             => j(h(X7)) = X7 )
          & ! [X6] :
              ( sorti2(X6)
             => h(j(X6)) = X6 )
          & ! [X4] :
              ( sorti2(X4)
             => ! [X5] :
                  ( sorti2(X5)
                 => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
          & ! [X2] :
              ( sorti1(X2)
             => ! [X3] :
                  ( sorti1(X3)
                 => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f8,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | ! [X1] :
          ( ~ sorti2(X1)
          | sorti2(op2(X0,X1)) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ sorti1(X0)
      | op1(X0,X0) = X0 ),
    inference(ennf_transformation,[],[f3]) ).

fof(f10,plain,
    ? [X0] :
      ( sorti2(X0)
      & op2(X0,X0) != X0 ),
    inference(ennf_transformation,[],[f4]) ).

fof(f11,plain,
    ( ! [X1] :
        ( ~ sorti2(X1)
        | sorti1(j(X1)) )
    & ! [X0] :
        ( ~ sorti1(X0)
        | sorti2(h(X0)) )
    & ! [X7] :
        ( ~ sorti1(X7)
        | j(h(X7)) = X7 )
    & ! [X6] :
        ( ~ sorti2(X6)
        | h(j(X6)) = X6 )
    & ! [X4] :
        ( ~ sorti2(X4)
        | ! [X5] :
            ( ~ sorti2(X5)
            | j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
    & ! [X2] :
        ( ~ sorti1(X2)
        | ! [X3] :
            ( ~ sorti1(X3)
            | h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f12,plain,
    ( ! [X1] :
        ( ~ sorti2(X1)
        | sorti1(j(X1)) )
    & ! [X0] :
        ( ~ sorti1(X0)
        | sorti2(h(X0)) )
    & ! [X7] :
        ( ~ sorti1(X7)
        | j(h(X7)) = X7 )
    & ! [X6] :
        ( ~ sorti2(X6)
        | h(j(X6)) = X6 )
    & ! [X4] :
        ( ~ sorti2(X4)
        | ! [X5] :
            ( ~ sorti2(X5)
            | j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
    & ! [X2] :
        ( ~ sorti1(X2)
        | ! [X3] :
            ( ~ sorti1(X3)
            | h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ),
    inference(flattening,[],[f11]) ).

fof(f13,plain,
    ( sorti2(sK0)
    & sK0 != op2(sK0,sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10]) ).

fof(f14,plain,
    ( ! [X7] :
        ( ~ sorti2(X7)
        | sorti1(j(X7)) )
    & ! [X6] :
        ( ~ sorti1(X6)
        | sorti2(h(X6)) )
    & ! [X5] :
        ( ~ sorti1(X5)
        | j(h(X5)) = X5 )
    & ! [X4] :
        ( ~ sorti2(X4)
        | h(j(X4)) = X4 )
    & ! [X2] :
        ( ~ sorti2(X2)
        | ! [X3] :
            ( ~ sorti2(X3)
            | j(op2(X2,X3)) = op1(j(X2),j(X3)) ) )
    & ! [X0] :
        ( ~ sorti1(X0)
        | ! [X1] :
            ( ~ sorti1(X1)
            | h(op1(X0,X1)) = op2(h(X0),h(X1)) ) ) ),
    inference(rectify,[],[f12]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ sorti2(X0)
      | ~ sorti2(X1)
      | sorti2(op2(X0,X1)) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ sorti1(X0)
      | op1(X0,X0) = X0 ),
    inference(cnf_transformation,[],[f9]) ).

fof(f18,plain,
    sorti2(sK0),
    inference(cnf_transformation,[],[f13]) ).

fof(f19,plain,
    sK0 != op2(sK0,sK0),
    inference(cnf_transformation,[],[f13]) ).

fof(f20,plain,
    ! [X7] :
      ( ~ sorti2(X7)
      | sorti1(j(X7)) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f23,plain,
    ! [X4] :
      ( ~ sorti2(X4)
      | h(j(X4)) = X4 ),
    inference(cnf_transformation,[],[f14]) ).

fof(f24,plain,
    ! [X2,X3] :
      ( ~ sorti2(X2)
      | ~ sorti2(X3)
      | j(op2(X2,X3)) = op1(j(X2),j(X3)) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i] :
      ( sorti2(op2(X0,X1))
      | ~ sorti2(X1)
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_51,plain,
    ! [X0: $i] :
      ( ( op1(X0,X0) = X0 )
      | ~ sorti1(X0) ),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_52,plain,
    op2(sK0,sK0) != sK0,
    inference(cnf_transformation,[],[f19]) ).

tcf(c_53,plain,
    sorti2(sK0),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_55,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( op1(j(X0),j(X1)) = j(op2(X0,X1)) )
      | ~ sorti2(X1)
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_56,negated_conjecture,
    ! [X0: $i] :
      ( ( h(j(X0)) = X0 )
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_59,negated_conjecture,
    ! [X0: $i] :
      ( sorti1(j(X0))
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_168,negated_conjecture,
    ! [X0: $i] :
      ( sorti1(j(X0))
      | ~ sorti2(X0) ),
    inference(demodulation,[status(thm)],[c_59]) ).

tcf(c_171,negated_conjecture,
    ! [X0: $i] :
      ( ( h(j(X0)) = X0 )
      | ~ sorti2(X0) ),
    inference(demodulation,[status(thm)],[c_56]) ).

tcf(c_172,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( op1(j(X0),j(X1)) = j(op2(X0,X1)) )
      | ~ sorti2(X1)
      | ~ sorti2(X0) ),
    inference(demodulation,[status(thm)],[c_55]) ).

tcf(c_438,plain,
    ! [X0: $i] :
      ( ( op1(j(X0),j(sK0)) = j(op2(X0,sK0)) )
      | ~ sorti2(X0) ),
    inference(superposition,[status(thm)],[c_53,c_172]) ).

tcf(c_440,plain,
    h(j(sK0)) = sK0,
    inference(superposition,[status(thm)],[c_53,c_171]) ).

tcf(c_447,plain,
    ! [X0: $i] :
      ( ( op1(j(X0),j(X0)) = j(X0) )
      | ~ sorti2(X0) ),
    inference(superposition,[status(thm)],[c_168,c_51]) ).

tcf(c_494,plain,
    ! [X0: $i,X1: $i] :
      ( ( h(j(op2(X0,X1))) = op2(X0,X1) )
      | ~ sorti2(X1)
      | ~ sorti2(X0) ),
    inference(superposition,[status(thm)],[c_50,c_171]) ).

tcf(c_513,plain,
    op1(j(sK0),j(sK0)) = j(sK0),
    inference(superposition,[status(thm)],[c_53,c_447]) ).

tcf(c_562,plain,
    op1(j(sK0),j(sK0)) = j(op2(sK0,sK0)),
    inference(superposition,[status(thm)],[c_53,c_438]) ).

tcf(c_564,plain,
    j(op2(sK0,sK0)) = j(sK0),
    inference(light_normalisation,[status(thm)],[c_562,c_513]) ).

tcf(c_655,plain,
    ! [X0: $i] :
      ( ( h(j(op2(X0,sK0))) = op2(X0,sK0) )
      | ~ sorti2(X0) ),
    inference(superposition,[status(thm)],[c_53,c_494]) ).

tcf(c_729,plain,
    h(j(op2(sK0,sK0))) = op2(sK0,sK0),
    inference(superposition,[status(thm)],[c_53,c_655]) ).

tcf(c_731,plain,
    op2(sK0,sK0) = sK0,
    inference(light_normalisation,[status(thm)],[c_729,c_440,c_564]) ).

tcf(c_732,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_731,c_52]) ).


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