↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SEU020+1 : TPTP v9.3.1. Released v3.2.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 02:55:05 PM UTC 2026

% Result   : Theorem 3.55s 11.53s
% Output   : CNFRefutation 3.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   51 (  31 unt;   3 def)
%            Number of atoms       :  164 (  23 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  170 (  70   ~;  63   |;  27   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 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  :    9 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn  28   !;   6   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f29,axiom,
    ! [X0] :
      ( ( function(X0)
        & relation(X0) )
     => ! [X1] :
          ( ( function(X1)
            & relation(X1) )
         => ( relation_dom(relation_composition(X1,X0)) = relation_dom(X1)
           => subset(relation_rng(X1),relation_dom(X0)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_funct_1) ).

fof(f32,axiom,
    ! [X0] :
      ( ( function(X0)
        & relation(X0) )
     => ! [X1] :
          ( ( function(X1)
            & relation(X1) )
         => ( ( subset(relation_rng(X1),relation_dom(X0))
              & one_to_one(relation_composition(X1,X0)) )
           => one_to_one(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_funct_1) ).

fof(f34,axiom,
    ! [X0] : one_to_one(identity_relation(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t52_funct_1) ).

fof(f35,conjecture,
    ! [X0] :
      ( ( function(X0)
        & relation(X0) )
     => ( ? [X1] :
            ( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
            & function(X1)
            & relation(X1) )
       => one_to_one(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_funct_1) ).

fof(f36,negated_conjecture,
    ~ ! [X0] :
        ( ( function(X0)
          & relation(X0) )
       => ( ? [X1] :
              ( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
              & function(X1)
              & relation(X1) )
         => one_to_one(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f35]) ).

fof(f39,axiom,
    ! [X0] :
      ( relation_rng(identity_relation(X0)) = X0
      & relation_dom(identity_relation(X0)) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t71_relat_1) ).

fof(f64,plain,
    ! [X0] :
      ( ~ function(X0)
      | ~ relation(X0)
      | ! [X1] :
          ( ~ function(X1)
          | ~ relation(X1)
          | relation_dom(relation_composition(X1,X0)) != relation_dom(X1)
          | subset(relation_rng(X1),relation_dom(X0)) ) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f65,plain,
    ! [X0] :
      ( ~ function(X0)
      | ~ relation(X0)
      | ! [X1] :
          ( ~ function(X1)
          | ~ relation(X1)
          | relation_dom(relation_composition(X1,X0)) != relation_dom(X1)
          | subset(relation_rng(X1),relation_dom(X0)) ) ),
    inference(flattening,[],[f64]) ).

fof(f68,plain,
    ! [X0] :
      ( ~ function(X0)
      | ~ relation(X0)
      | ! [X1] :
          ( ~ function(X1)
          | ~ relation(X1)
          | ~ subset(relation_rng(X1),relation_dom(X0))
          | ~ one_to_one(relation_composition(X1,X0))
          | one_to_one(X1) ) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f69,plain,
    ! [X0] :
      ( ~ function(X0)
      | ~ relation(X0)
      | ! [X1] :
          ( ~ function(X1)
          | ~ relation(X1)
          | ~ subset(relation_rng(X1),relation_dom(X0))
          | ~ one_to_one(relation_composition(X1,X0))
          | one_to_one(X1) ) ),
    inference(flattening,[],[f68]) ).

fof(f72,plain,
    ? [X0] :
      ( function(X0)
      & relation(X0)
      & ? [X1] :
          ( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
          & function(X1)
          & relation(X1) )
      & ~ one_to_one(X0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f73,plain,
    ? [X0] :
      ( function(X0)
      & relation(X0)
      & ? [X1] :
          ( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
          & function(X1)
          & relation(X1) )
      & ~ one_to_one(X0) ),
    inference(flattening,[],[f72]) ).

fof(f88,plain,
    ( function(sK9)
    & relation(sK9)
    & relation_composition(sK9,sK10) = identity_relation(relation_dom(sK9))
    & function(sK10)
    & relation(sK10)
    & ~ one_to_one(sK9) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X0,sK9),skolemize(X1,sK10)],[f73]) ).

fof(f130,plain,
    ! [X0,X1] :
      ( ~ function(X0)
      | ~ relation(X0)
      | ~ function(X1)
      | ~ relation(X1)
      | relation_dom(relation_composition(X1,X0)) != relation_dom(X1)
      | subset(relation_rng(X1),relation_dom(X0)) ),
    inference(cnf_transformation,[],[f65]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( ~ function(X0)
      | ~ relation(X0)
      | ~ function(X1)
      | ~ relation(X1)
      | ~ subset(relation_rng(X1),relation_dom(X0))
      | ~ one_to_one(relation_composition(X1,X0))
      | one_to_one(X1) ),
    inference(cnf_transformation,[],[f69]) ).

fof(f136,plain,
    ! [X0] : one_to_one(identity_relation(X0)),
    inference(cnf_transformation,[],[f34]) ).

fof(f137,plain,
    function(sK9),
    inference(cnf_transformation,[],[f88]) ).

fof(f138,plain,
    relation(sK9),
    inference(cnf_transformation,[],[f88]) ).

fof(f139,plain,
    relation_composition(sK9,sK10) = identity_relation(relation_dom(sK9)),
    inference(cnf_transformation,[],[f88]) ).

fof(f140,plain,
    function(sK10),
    inference(cnf_transformation,[],[f88]) ).

fof(f141,plain,
    relation(sK10),
    inference(cnf_transformation,[],[f88]) ).

fof(f142,plain,
    ~ one_to_one(sK9),
    inference(cnf_transformation,[],[f88]) ).

fof(f146,plain,
    ! [X0] : relation_dom(identity_relation(X0)) = X0,
    inference(cnf_transformation,[],[f39]) ).

tcf(c_90,plain,
    ! [X0: $i,X1: $i] :
      ( subset(relation_rng(X0),relation_dom(X1))
      | ~ relation(X1)
      | ~ relation(X0)
      | ~ function(X1)
      | ~ function(X0)
      | ( relation_dom(relation_composition(X0,X1)) != relation_dom(X0) ) ),
    inference(cnf_transformation,[],[f130]) ).

tcf(c_94,plain,
    ! [X0: $i,X1: $i] :
      ( one_to_one(X0)
      | ~ relation(X1)
      | ~ relation(X0)
      | ~ function(X1)
      | ~ function(X0)
      | ~ one_to_one(relation_composition(X0,X1))
      | ~ subset(relation_rng(X0),relation_dom(X1)) ),
    inference(cnf_transformation,[],[f134]) ).

tcf(c_96,plain,
    ! [X0: $i] : one_to_one(identity_relation(X0)),
    inference(cnf_transformation,[],[f136]) ).

tcf(c_97,negated_conjecture,
    ~ one_to_one(sK9),
    inference(cnf_transformation,[],[f142]) ).

tcf(c_98,negated_conjecture,
    relation(sK10),
    inference(cnf_transformation,[],[f141]) ).

tcf(c_99,negated_conjecture,
    function(sK10),
    inference(cnf_transformation,[],[f140]) ).

tcf(c_100,negated_conjecture,
    relation_composition(sK9,sK10) = identity_relation(relation_dom(sK9)),
    inference(cnf_transformation,[],[f139]) ).

tcf(c_101,negated_conjecture,
    relation(sK9),
    inference(cnf_transformation,[],[f138]) ).

tcf(c_102,negated_conjecture,
    function(sK9),
    inference(cnf_transformation,[],[f137]) ).

tcf(c_105,plain,
    ! [X0: $i] : relation_dom(identity_relation(X0)) = X0,
    inference(cnf_transformation,[],[f146]) ).

tcf(c_1869,definition,
    iPr_def_10 = relation_composition(sK9,sK10),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_1870,definition,
    iPr_def_11 = relation_dom(sK9),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_1871,definition,
    iPr_def_12 = identity_relation(iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_1872,negated_conjecture,
    function(sK9),
    inference(demodulation,[status(thm)],[c_102]) ).

tcf(c_1873,negated_conjecture,
    relation(sK9),
    inference(demodulation,[status(thm)],[c_101]) ).

tcf(c_1874,negated_conjecture,
    iPr_def_10 = iPr_def_12,
    inference(demodulation,[status(thm)],[c_100,c_1870,c_1871,c_1869]) ).

tcf(c_1875,negated_conjecture,
    function(sK10),
    inference(demodulation,[status(thm)],[c_99]) ).

tcf(c_1876,negated_conjecture,
    relation(sK10),
    inference(demodulation,[status(thm)],[c_98]) ).

tcf(c_1877,negated_conjecture,
    ~ one_to_one(sK9),
    inference(demodulation,[status(thm)],[c_97]) ).

tcf(c_2786,plain,
    identity_relation(iPr_def_11) = iPr_def_10,
    inference(light_normalisation,[status(thm)],[c_1871,c_1874]) ).

tcf(c_2787,plain,
    one_to_one(iPr_def_10),
    inference(superposition,[status(thm)],[c_2786,c_96]) ).

tcf(c_2813,plain,
    relation_dom(iPr_def_10) = iPr_def_11,
    inference(superposition,[status(thm)],[c_2786,c_105]) ).

tcf(c_3605,plain,
    ( subset(relation_rng(sK9),relation_dom(sK10))
    | ~ relation(sK10)
    | ~ relation(sK9)
    | ~ function(sK10)
    | ~ function(sK9)
    | ( relation_dom(sK9) != relation_dom(iPr_def_10) ) ),
    inference(superposition,[status(thm)],[c_1869,c_90]) ).

tcf(c_3606,plain,
    ( subset(relation_rng(sK9),relation_dom(sK10))
    | ~ relation(sK10)
    | ~ relation(sK9)
    | ~ function(sK10)
    | ~ function(sK9) ),
    inference(ground_joinability,[status(thm)],[c_3605,c_1870,c_2813]) ).

tcf(c_3607,plain,
    subset(relation_rng(sK9),relation_dom(sK10)),
    inference(forward_subsumption_resolution,[status(thm)],[c_3606,c_1876,c_1873,c_1875,c_1872]) ).

tcf(c_3608,plain,
    ( one_to_one(sK9)
    | ~ relation(sK10)
    | ~ relation(sK9)
    | ~ function(sK10)
    | ~ function(sK9)
    | ~ one_to_one(relation_composition(sK9,sK10)) ),
    inference(superposition,[status(thm)],[c_3607,c_94]) ).

tcf(c_3609,plain,
    ( one_to_one(sK9)
    | ~ one_to_one(iPr_def_10)
    | ~ relation(sK10)
    | ~ relation(sK9)
    | ~ function(sK10)
    | ~ function(sK9) ),
    inference(light_normalisation,[status(thm)],[c_3608,c_1869]) ).

tcf(c_3610,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3609,c_1877,c_2787,c_1876,c_1873,c_1875,c_1872]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU020+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/10.59  % Computer : n003.cluster.edu
% 0.10/10.59  % Model    : x86_64 x86_64
% 0.10/10.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.59  % Memory   : 8046.5625MB
% 0.10/10.59  % OS       : Linux 6.8.0-71-generic
% 0.10/10.59  % CPULimit : 300
% 0.10/10.59  % WCLimit  : 300
% 0.10/10.59  % DateTime : Thu Sep 24 12:37:32 UTC 2026
% 0.14/10.60  % CPUTime  : 
% 0.14/10.60  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.64  Running first-order theorem proving
% 0.14/10.64  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.14/10.65  
% 0.14/10.65  % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.65  
% 0.14/10.65  % Detected problem language: tptp
% 0.14/10.66  % Proving...
% 3.55/11.53  % SZS status Started for theBenchmark.p
% 3.55/11.53  % SZS status Theorem for theBenchmark.p
% 3.55/11.53  
% 3.55/11.53  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.55/11.53  
% 3.55/11.53  % ------  iProver source info
% 3.55/11.53  
% 3.55/11.53  % git: date: 2026-07-19 20:42:38 +0200
% 3.55/11.53  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.55/11.53  % git: non_committed_changes: false
% 3.55/11.53  
% 3.55/11.53  % ------ Parsing...
% 3.55/11.53  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.55/11.53  
% 3.55/11.53  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.55/11.53  
% 3.55/11.53  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.55/11.53  
% 3.55/11.53  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.55/11.53  % ------ Proving...
% 3.55/11.53  % ------ Problem Properties 
% 3.55/11.53  
% 3.55/11.53  % 
% 3.55/11.53  % clauses                               58
% 3.55/11.53  % conjectures                           6
% 3.55/11.53  % EPR                                   28
% 3.55/11.53  % Horn                                  56
% 3.55/11.53  % unary                                 30
% 3.55/11.53  % binary                                14
% 3.55/11.53  % lits                                  109
% 3.55/11.53  % lits eq                               9
% 3.55/11.53  % fd_pure                               0
% 3.55/11.53  % fd_pseudo                             0
% 3.55/11.53  % fd_cond                               1
% 3.55/11.53  % fd_pseudo_cond                        1
% 3.55/11.53  % AC symbols                            0
% 3.55/11.53  
% 3.55/11.53  % ------ Schedule dynamic 5 is on 
% 3.55/11.53  
% 3.55/11.53  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.55/11.53  
% 3.55/11.53  
% 3.55/11.53  % ------ 
% 3.55/11.53  % Current options:
% 3.55/11.53  % ------ 
% 3.55/11.53  
% 3.55/11.53  
% 3.55/11.53  % 
% 3.55/11.53  
% 3.55/11.53  % ------ Proving...
% 3.55/11.53  % 
% 3.55/11.53  
% 3.55/11.53  % SZS status Theorem for theBenchmark.p
% 3.55/11.53  
% 3.55/11.53  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.55/11.53  
% 3.55/11.53  
%------------------------------------------------------------------------------