↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n015.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 02:39:09 PM UTC 2026

% Result   : Theorem 3.41s 1.36s
% Output   : CNFRefutation 3.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   51 (  20 unt;   2 def)
%            Number of atoms       :  138 (  34 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  136 (  55   ~;  46   |;  33   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn  30   !;  10   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] :
      ( ( aElement0(X1)
        & aElement0(X0) )
     => aElement0(sdtpldt0(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ( aElement0(X1)
        & aElement0(X0) )
     => aElement0(sdtasdt0(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).

fof(f39,axiom,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & ? [X0] :
        ( sdtasdt0(xc,X0) = xy
        & aElement0(X0) )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [X0] :
        ( sdtasdt0(xc,X0) = xx
        & aElement0(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).

fof(f40,axiom,
    ( sdtasdt0(xc,xu) = xx
    & aElement0(xu) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1956) ).

fof(f41,axiom,
    ( sdtasdt0(xc,xv) = xy
    & aElement0(xv) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1979) ).

fof(f42,axiom,
    sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2010) ).

fof(f43,axiom,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2043) ).

fof(f44,conjecture,
    ( ( aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
      | ? [X0] :
          ( sdtasdt0(xc,X0) = sdtasdt0(xz,xx)
          & aElement0(X0) ) )
    & ( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
      | ? [X0] :
          ( sdtasdt0(xc,X0) = sdtpldt0(xx,xy)
          & aElement0(X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f45,negated_conjecture,
    ~ ( ( aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
        | ? [X0] :
            ( sdtasdt0(xc,X0) = sdtasdt0(xz,xx)
            & aElement0(X0) ) )
      & ( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
        | ? [X0] :
            ( sdtasdt0(xc,X0) = sdtpldt0(xx,xy)
            & aElement0(X0) ) ) ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f53,plain,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & ? [X1] :
        ( xy = sdtasdt0(xc,X1)
        & aElement0(X1) )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [X0] :
        ( sdtasdt0(xc,X0) = xx
        & aElement0(X0) ) ),
    inference(rectify,[],[f39]) ).

fof(f54,plain,
    ~ ( ( aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
        | ? [X1] :
            ( sdtasdt0(xz,xx) = sdtasdt0(xc,X1)
            & aElement0(X1) ) )
      & ( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
        | ? [X0] :
            ( sdtasdt0(xc,X0) = sdtpldt0(xx,xy)
            & aElement0(X0) ) ) ),
    inference(rectify,[],[f45]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | aElement0(sdtpldt0(X0,X1)) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | aElement0(sdtpldt0(X0,X1)) ),
    inference(flattening,[],[f58]) ).

fof(f60,plain,
    ! [X0,X1] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | aElement0(sdtasdt0(X0,X1)) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | aElement0(sdtasdt0(X0,X1)) ),
    inference(flattening,[],[f60]) ).

fof(f105,plain,
    ( ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
      & ! [X1] :
          ( sdtasdt0(xz,xx) != sdtasdt0(xc,X1)
          | ~ aElement0(X1) ) )
    | ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
      & ! [X0] :
          ( sdtasdt0(xc,X0) != sdtpldt0(xx,xy)
          | ~ aElement0(X0) ) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f142,plain,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & xy = sdtasdt0(xc,sK23)
    & aElement0(sK23)
    & aElementOf0(xx,slsdtgt0(xc))
    & xx = sdtasdt0(xc,sK22)
    & aElement0(sK22) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK22,sK23]),skolemize(X0,sK22),skolemize(X1,sK23)],[f53]) ).

fof(f146,plain,
    ! [X0,X1] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | aElement0(sdtpldt0(X0,X1)) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | aElement0(sdtasdt0(X0,X1)) ),
    inference(cnf_transformation,[],[f61]) ).

fof(f233,plain,
    aElement0(xz),
    inference(cnf_transformation,[],[f142]) ).

fof(f241,plain,
    aElement0(xu),
    inference(cnf_transformation,[],[f40]) ).

fof(f243,plain,
    aElement0(xv),
    inference(cnf_transformation,[],[f41]) ).

fof(f244,plain,
    sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
    inference(cnf_transformation,[],[f42]) ).

fof(f245,plain,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(cnf_transformation,[],[f43]) ).

fof(f249,plain,
    ! [X0,X1] :
      ( sdtasdt0(xz,xx) != sdtasdt0(xc,X1)
      | ~ aElement0(X1)
      | sdtasdt0(xc,X0) != sdtpldt0(xx,xy)
      | ~ aElement0(X0) ),
    inference(cnf_transformation,[],[f105]) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i] :
      ( aElement0(sdtpldt0(X0,X1))
      | ~ aElement0(X1)
      | ~ aElement0(X0) ),
    inference(cnf_transformation,[],[f146]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i] :
      ( aElement0(sdtasdt0(X0,X1))
      | ~ aElement0(X1)
      | ~ aElement0(X0) ),
    inference(cnf_transformation,[],[f147]) ).

tcf(c_145,plain,
    aElement0(xz),
    inference(cnf_transformation,[],[f233]) ).

tcf(c_146,plain,
    aElement0(xu),
    inference(cnf_transformation,[],[f241]) ).

tcf(c_148,plain,
    aElement0(xv),
    inference(cnf_transformation,[],[f243]) ).

tcf(c_150,plain,
    sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy),
    inference(cnf_transformation,[],[f244]) ).

tcf(c_151,plain,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,xx),
    inference(cnf_transformation,[],[f245]) ).

tcf(c_152,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ aElement0(X1)
      | ~ aElement0(X0)
      | ( sdtasdt0(xc,X1) != sdtasdt0(xz,xx) )
      | ( sdtasdt0(xc,X0) != sdtpldt0(xx,xy) ) ),
    inference(cnf_transformation,[],[f249]) ).

tcf(c_5228,negated_conjecture,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | ( sdtasdt0(xc,X0) != sdtasdt0(xz,xx) )
      | ~ aElement0(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_152]) ).

tcf(c_5229,negated_conjecture,
    ! [X0: $i] :
      ( ~ iPr_def_11
      | ( sdtasdt0(xc,X0) != sdtpldt0(xx,xy) )
      | ~ aElement0(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_152]) ).

tcf(c_5230,negated_conjecture,
    ( iPr_def_11
    | iPr_def_10 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_152]) ).

tcf(c_5231,definition,
    iPr_def_12 = sdtpldt0(xx,xy),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_5233,definition,
    iPr_def_14 = sdtasdt0(xz,xx),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_5237,negated_conjecture,
    ( iPr_def_11
    | iPr_def_10 ),
    inference(demodulation,[status(thm)],[c_5230]) ).

tcf(c_5238,negated_conjecture,
    ! [X0: $i] :
      ( ~ iPr_def_11
      | ~ aElement0(X0)
      | ( sdtasdt0(xc,X0) != iPr_def_12 ) ),
    inference(demodulation,[status(thm)],[c_5229]) ).

tcf(c_5239,negated_conjecture,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | ~ aElement0(X0)
      | ( sdtasdt0(xc,X0) != iPr_def_14 ) ),
    inference(demodulation,[status(thm)],[c_5228]) ).

tcf(c_7430,plain,
    sdtasdt0(xc,sdtpldt0(xu,xv)) = iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_150,c_5231]) ).

tcf(c_7435,plain,
    ( ~ iPr_def_11
    | ~ aElement0(sdtpldt0(xu,xv)) ),
    inference(superposition,[status(thm)],[c_7430,c_5238]) ).

tcf(c_7452,plain,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = iPr_def_14,
    inference(light_normalisation,[status(thm)],[c_151,c_5233]) ).

tcf(c_7456,plain,
    ( ~ iPr_def_10
    | ~ aElement0(sdtasdt0(xu,xz)) ),
    inference(superposition,[status(thm)],[c_7452,c_5239]) ).

tcf(c_7574,plain,
    ( ~ iPr_def_11
    | ~ aElement0(xv)
    | ~ aElement0(xu) ),
    inference(superposition,[status(thm)],[c_52,c_7435]) ).

tcf(c_7575,plain,
    ~ iPr_def_11,
    inference(forward_subsumption_resolution,[status(thm)],[c_7574,c_148,c_146]) ).

tcf(c_7576,plain,
    iPr_def_10,
    inference(backward_subsumption_resolution,[status(thm)],[c_5237,c_7575]) ).

tcf(c_7585,plain,
    ~ aElement0(sdtasdt0(xu,xz)),
    inference(global_subsumption_just,[status(thm)],[c_7456,c_7456,c_7576]) ).

tcf(c_7587,plain,
    ( ~ aElement0(xu)
    | ~ aElement0(xz) ),
    inference(superposition,[status(thm)],[c_53,c_7585]) ).

tcf(c_7588,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_7587,c_146,c_145]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : RNG105+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.41  % Computer : n015.cluster.edu
% 0.13/0.41  % Model    : x86_64 x86_64
% 0.13/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41  % Memory   : 8046.5625MB
% 0.13/0.41  % OS       : Linux 6.8.0-71-generic
% 0.13/0.41  % CPULimit : 300
% 0.13/0.41  % WCLimit  : 300
% 0.13/0.41  % DateTime : Thu Sep 24 08:18:55 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.46  Running first-order theorem proving
% 0.13/0.46  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.13/0.48  
% 0.13/0.48  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.48  
% 0.13/0.48  % Detected problem language: tptp
% 0.21/0.49  % Proving...
% 3.41/1.36  % SZS status Started for theBenchmark.p
% 3.41/1.36  % SZS status Theorem for theBenchmark.p
% 3.41/1.36  
% 3.41/1.36  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.41/1.36  
% 3.41/1.36  % ------  iProver source info
% 3.41/1.36  
% 3.41/1.36  % git: date: 2026-07-19 20:42:38 +0200
% 3.41/1.36  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.41/1.36  % git: non_committed_changes: false
% 3.41/1.36  
% 3.41/1.36  % ------ Parsing...
% 3.41/1.36  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.41/1.36  
% 3.41/1.36  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 3.41/1.36  
% 3.41/1.36  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.41/1.36  
% 3.41/1.36  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.41/1.36  % ------ Proving...
% 3.41/1.36  % ------ Problem Properties 
% 3.41/1.36  
% 3.41/1.36  % 
% 3.41/1.36  % clauses                               107
% 3.41/1.36  % conjectures                           6
% 3.41/1.36  % EPR                                   20
% 3.41/1.36  % Horn                                  83
% 3.41/1.36  % unary                                 20
% 3.41/1.36  % binary                                16
% 3.41/1.36  % lits                                  352
% 3.41/1.36  % lits eq                               55
% 3.41/1.36  % fd_pure                               0
% 3.41/1.36  % fd_pseudo                             0
% 3.41/1.36  % fd_cond                               3
% 3.41/1.36  % fd_pseudo_cond                        11
% 3.41/1.36  % AC symbols                            0
% 3.41/1.36  
% 3.41/1.36  % ------ Schedule dynamic 5 is on 
% 3.41/1.36  
% 3.41/1.36  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.36  
% 3.41/1.36  
% 3.41/1.36  % ------ 
% 3.41/1.36  % Current options:
% 3.41/1.36  % ------ 
% 3.41/1.36  
% 3.41/1.36  
% 3.41/1.36  % 
% 3.41/1.36  
% 3.41/1.36  % ------ Proving...
% 3.41/1.36  % 
% 3.41/1.36  
% 3.41/1.36  % SZS status Theorem for theBenchmark.p
% 3.41/1.36  
% 3.41/1.36  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.36  
% 3.41/1.36  
%------------------------------------------------------------------------------