↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n003.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.67s 1.22s
% Output   : CNFRefutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   54 (  18 unt;   0 def)
%            Number of atoms       :  173 (  58 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  197 (  78   ~;  67   |;  32   &)
%                                         (   0 <=>;  20  =>;   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  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   78 (   0 sgn  74   !;   4   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
      ( sorti1(X0)
     => ! [X1] :
          ( sorti1(X1)
         => sorti1(op1(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

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

fof(f4,axiom,
    ~ ( ? [X1] :
          ( op2(X1,X1) != X1
          & sorti2(X1) )
      & ? [X0] :
          ( op2(X0,X0) = X0
          & sorti2(X0) ) ),
    file('/export/starexec/sandbox/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/sandbox/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(f7,plain,
    ! [X0] :
      ( ~ sorti1(X0)
      | ! [X1] :
          ( ~ sorti1(X1)
          | sorti1(op1(X0,X1)) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f9,plain,
    ( ! [X1] :
        ( op2(X1,X1) = X1
        | ~ sorti2(X1) )
    | ! [X0] :
        ( op2(X0,X0) != X0
        | ~ sorti2(X0) ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f10,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(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(flattening,[],[f10]) ).

fof(f12,plain,
    ( sK1 != op1(sK1,sK1)
    & sorti1(sK1)
    & sK0 = op1(sK0,sK0)
    & sorti1(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).

fof(f13,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,[],[f11]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ sorti1(X0)
      | ~ sorti1(X1)
      | sorti1(op1(X0,X1)) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f16,plain,
    sK1 != op1(sK1,sK1),
    inference(cnf_transformation,[],[f12]) ).

fof(f17,plain,
    sorti1(sK1),
    inference(cnf_transformation,[],[f12]) ).

fof(f18,plain,
    sK0 = op1(sK0,sK0),
    inference(cnf_transformation,[],[f12]) ).

fof(f19,plain,
    sorti1(sK0),
    inference(cnf_transformation,[],[f12]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( op2(X1,X1) = X1
      | ~ sorti2(X1)
      | op2(X0,X0) != X0
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f22,plain,
    ! [X6] :
      ( ~ sorti1(X6)
      | sorti2(h(X6)) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f23,plain,
    ! [X5] :
      ( ~ sorti1(X5)
      | j(h(X5)) = X5 ),
    inference(cnf_transformation,[],[f13]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ sorti1(X0)
      | ~ sorti1(X1)
      | h(op1(X0,X1)) = op2(h(X0),h(X1)) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] :
      ( sorti1(op1(X0,X1))
      | ~ sorti1(X1)
      | ~ sorti1(X0) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_51,plain,
    sorti1(sK0),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_52,plain,
    op1(sK0,sK0) = sK0,
    inference(cnf_transformation,[],[f18]) ).

tcf(c_53,plain,
    sorti1(sK1),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_54,plain,
    op1(sK1,sK1) != sK1,
    inference(cnf_transformation,[],[f16]) ).

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

tcf(c_56,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( op2(h(X0),h(X1)) = h(op1(X0,X1)) )
      | ~ sorti1(X1)
      | ~ sorti1(X0) ),
    inference(cnf_transformation,[],[f26]) ).

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

tcf(c_60,negated_conjecture,
    ! [X0: $i] :
      ( sorti2(h(X0))
      | ~ sorti1(X0) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_63,plain,
    ( sorti2(h(sK0))
    | ~ sorti1(sK0) ),
    inference(instantiation,[status(thm)],[c_60]) ).

tcf(c_181,plain,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | ( op2(X0,X0) = X0 )
      | ~ sorti2(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_55]) ).

tcf(c_182,plain,
    ! [X0: $i] :
      ( ~ iPr_def_11
      | ( op2(X0,X0) != X0 )
      | ~ sorti2(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_55]) ).

tcf(c_183,plain,
    ( iPr_def_11
    | iPr_def_10 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_55]) ).

tcf(c_185,negated_conjecture,
    ! [X0: $i] :
      ( sorti2(h(X0))
      | ~ sorti1(X0) ),
    inference(demodulation,[status(thm)],[c_60]) ).

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

tcf(c_189,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( op2(h(X0),h(X1)) = h(op1(X0,X1)) )
      | ~ sorti1(X1)
      | ~ sorti1(X0) ),
    inference(demodulation,[status(thm)],[c_56]) ).

tcf(c_488,plain,
    ! [X0: $i] :
      ( ( op2(h(X0),h(sK0)) = h(op1(X0,sK0)) )
      | ~ sorti1(X0) ),
    inference(superposition,[status(thm)],[c_51,c_189]) ).

tcf(c_497,plain,
    ! [X0: $i] :
      ( ( op2(h(X0),h(sK1)) = h(op1(X0,sK1)) )
      | ~ sorti1(X0) ),
    inference(superposition,[status(thm)],[c_53,c_189]) ).

tcf(c_500,plain,
    j(h(sK1)) = sK1,
    inference(superposition,[status(thm)],[c_53,c_186]) ).

tcf(c_538,plain,
    op2(h(sK0),h(sK0)) = h(op1(sK0,sK0)),
    inference(superposition,[status(thm)],[c_51,c_488]) ).

tcf(c_541,plain,
    op2(h(sK0),h(sK0)) = h(sK0),
    inference(light_normalisation,[status(thm)],[c_538,c_52]) ).

tcf(c_550,plain,
    op2(h(sK1),h(sK1)) = h(op1(sK1,sK1)),
    inference(superposition,[status(thm)],[c_53,c_497]) ).

tcf(c_609,plain,
    ! [X0: $i,X1: $i] :
      ( ( j(h(op1(X0,X1))) = op1(X0,X1) )
      | ~ sorti1(X1)
      | ~ sorti1(X0) ),
    inference(superposition,[status(thm)],[c_49,c_186]) ).

tcf(c_715,plain,
    ! [X0: $i] :
      ( ( op2(h(X0),h(X0)) = h(X0) )
      | ~ iPr_def_10
      | ~ sorti1(X0) ),
    inference(superposition,[status(thm)],[c_185,c_181]) ).

tcf(c_819,plain,
    ( ( op2(h(sK1),h(sK1)) = h(sK1) )
    | ~ iPr_def_10 ),
    inference(superposition,[status(thm)],[c_53,c_715]) ).

tcf(c_821,plain,
    ( ( h(op1(sK1,sK1)) = h(sK1) )
    | ~ iPr_def_10 ),
    inference(light_normalisation,[status(thm)],[c_819,c_550]) ).

tcf(c_845,plain,
    ! [X0: $i] :
      ( ( j(h(op1(X0,sK1))) = op1(X0,sK1) )
      | ~ sorti1(X0) ),
    inference(superposition,[status(thm)],[c_53,c_609]) ).

tcf(c_1033,plain,
    ( ~ iPr_def_11
    | ~ sorti2(h(sK0)) ),
    inference(superposition,[status(thm)],[c_541,c_182]) ).

tcf(c_1133,plain,
    ~ iPr_def_11,
    inference(global_subsumption_just,[status(thm)],[c_1033,c_51,c_63,c_1033]) ).

tcf(c_1135,plain,
    iPr_def_10,
    inference(backward_subsumption_resolution,[status(thm)],[c_183,c_1133]) ).

tcf(c_1136,plain,
    h(op1(sK1,sK1)) = h(sK1),
    inference(backward_subsumption_resolution,[status(thm)],[c_821,c_1135]) ).

tcf(c_1817,plain,
    j(h(op1(sK1,sK1))) = op1(sK1,sK1),
    inference(superposition,[status(thm)],[c_53,c_845]) ).

tcf(c_1820,plain,
    op1(sK1,sK1) = sK1,
    inference(light_normalisation,[status(thm)],[c_1817,c_500,c_1136]) ).

tcf(c_1821,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1820,c_54]) ).


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