↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n016.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:54:28 PM UTC 2026

% Result   : Theorem 3.68s 6.17s
% Output   : CNFRefutation 3.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   43 (  17 unt;   0 def)
%            Number of atoms       :  147 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  170 (  66   ~;  58   |;  38   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :  111 (   0 sgn  87   !;  24   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] :
      ( ! [X2] :
          ( model(X2,X0)
         => model(X2,X1) )
    <=> status(X0,X1,thm) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( ( ? [X4] :
            ( ~ model(X4,X0)
            & model(X4,X1) )
        & ! [X3] :
            ( model(X3,X0)
           => model(X3,X1) )
        & ? [X2] : model(X2,X0) )
    <=> status(X0,X1,wec) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',wec) ).

fof(f20,axiom,
    ! [X0,X1] :
      ( ? [X2,X3] :
          ( status(X2,X3,X1)
          & status(X2,X3,X0) )
    <=> mighta(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',mighta) ).

fof(f27,axiom,
    ? [X0] :
    ! [X1] : model(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',tautology) ).

fof(f32,axiom,
    ? [X0,X1,X2] :
      ( ? [X3] : model(X3,X2)
      & ~ model(X0,X2)
      & model(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).

fof(f33,conjecture,
    mighta(wec,thm),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta_wec_thm) ).

fof(f34,negated_conjecture,
    ~ mighta(wec,thm),
    inference(negated_conjecture,[status(cth)],[f33]) ).

fof(f35,plain,
    ~ mighta(wec,thm),
    inference(flattening,[],[f34]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ? [X2,X3] :
          ( status(X2,X3,X1)
          & status(X2,X3,X0) )
     => mighta(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f20]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( ! [X2,X3] :
          ( ~ status(X2,X3,X1)
          | ~ status(X2,X3,X0) )
      | mighta(X0,X1) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ~ model(X2,X0)
          | model(X2,X1) )
    <=> status(X0,X1,thm) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ( ? [X4] :
            ( ~ model(X4,X0)
            & model(X4,X1) )
        & ! [X3] :
            ( ~ model(X3,X0)
            | model(X3,X1) )
        & ? [X2] : model(X2,X0) )
    <=> status(X0,X1,wec) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ( ? [X2] :
            ( model(X2,X0)
            & ~ model(X2,X1) )
        | status(X0,X1,thm) )
      & ( ~ status(X0,X1,thm)
        | ! [X2] :
            ( ~ model(X2,X0)
            | model(X2,X1) ) ) ),
    inference(nnf_transformation,[],[f38]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ( ? [X3] :
            ( model(X3,X0)
            & ~ model(X3,X1) )
        | status(X0,X1,thm) )
      & ( ~ status(X0,X1,thm)
        | ! [X2] :
            ( ~ model(X2,X0)
            | model(X2,X1) ) ) ),
    inference(rectify,[],[f41]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ( ( model(sK0(X0,X1),X0)
          & ~ model(sK0(X0,X1),X1) )
        | status(X0,X1,thm) )
      & ( ~ status(X0,X1,thm)
        | ! [X2] :
            ( ~ model(X2,X0)
            | model(X2,X1) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f42]) ).

fof(f44,plain,
    ! [X0,X1] :
      ( ( ! [X4] :
            ( model(X4,X0)
            | ~ model(X4,X1) )
        | ? [X3] :
            ( model(X3,X0)
            & ~ model(X3,X1) )
        | ! [X2] : ~ model(X2,X0)
        | status(X0,X1,wec) )
      & ( ~ status(X0,X1,wec)
        | ( ? [X4] :
              ( ~ model(X4,X0)
              & model(X4,X1) )
          & ! [X3] :
              ( ~ model(X3,X0)
              | model(X3,X1) )
          & ? [X2] : model(X2,X0) ) ) ),
    inference(nnf_transformation,[],[f39]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ( ! [X4] :
            ( model(X4,X0)
            | ~ model(X4,X1) )
        | ? [X3] :
            ( model(X3,X0)
            & ~ model(X3,X1) )
        | ! [X2] : ~ model(X2,X0)
        | status(X0,X1,wec) )
      & ( ~ status(X0,X1,wec)
        | ( ? [X4] :
              ( ~ model(X4,X0)
              & model(X4,X1) )
          & ! [X3] :
              ( ~ model(X3,X0)
              | model(X3,X1) )
          & ? [X2] : model(X2,X0) ) ) ),
    inference(flattening,[],[f44]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ( ! [X7] :
            ( model(X7,X0)
            | ~ model(X7,X1) )
        | ? [X6] :
            ( model(X6,X0)
            & ~ model(X6,X1) )
        | ! [X5] : ~ model(X5,X0)
        | status(X0,X1,wec) )
      & ( ~ status(X0,X1,wec)
        | ( ? [X4] :
              ( ~ model(X4,X0)
              & model(X4,X1) )
          & ! [X3] :
              ( ~ model(X3,X0)
              | model(X3,X1) )
          & ? [X2] : model(X2,X0) ) ) ),
    inference(rectify,[],[f45]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( ( ! [X7] :
            ( model(X7,X0)
            | ~ model(X7,X1) )
        | ( model(sK3(X0,X1),X0)
          & ~ model(sK3(X0,X1),X1) )
        | ! [X5] : ~ model(X5,X0)
        | status(X0,X1,wec) )
      & ( ~ status(X0,X1,wec)
        | ( ~ model(sK2(X0,X1),X0)
          & model(sK2(X0,X1),X1)
          & ! [X3] :
              ( ~ model(X3,X0)
              | model(X3,X1) )
          & model(sK1(X0),X0) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0)),skolemize(X4,sK2(X0,X1)),skolemize(X6,sK3(X0,X1))],[f46]) ).

fof(f48,plain,
    ( model(sK7,sK6)
    & ~ model(sK4,sK6)
    & model(sK4,sK5) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f32]) ).

fof(f53,plain,
    ! [X1] : model(X1,sK21),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(X0,sK21)],[f27]) ).

fof(f54,plain,
    ~ mighta(wec,thm),
    inference(cnf_transformation,[],[f35]) ).

fof(f55,plain,
    ! [X2,X3,X0,X1] :
      ( ~ status(X2,X3,X1)
      | ~ status(X2,X3,X0)
      | mighta(X0,X1) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ~ model(sK0(X0,X1),X1)
      | status(X0,X1,thm) ),
    inference(cnf_transformation,[],[f43]) ).

fof(f60,plain,
    ! [X0,X1,X7,X5] :
      ( model(X7,X0)
      | ~ model(X7,X1)
      | ~ model(sK3(X0,X1),X1)
      | ~ model(X5,X0)
      | status(X0,X1,wec) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f65,plain,
    model(sK7,sK6),
    inference(cnf_transformation,[],[f48]) ).

fof(f66,plain,
    ~ model(sK4,sK6),
    inference(cnf_transformation,[],[f48]) ).

fof(f79,plain,
    ! [X1] : model(X1,sK21),
    inference(cnf_transformation,[],[f53]) ).

tcf(c_49,negated_conjecture,
    ~ mighta(wec,thm),
    inference(cnf_transformation,[],[f54]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( mighta(X2,X3)
      | ~ status(X0,X1,X3)
      | ~ status(X0,X1,X2) ),
    inference(cnf_transformation,[],[f55]) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i] :
      ( status(X0,X1,thm)
      | ~ model(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f57]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( model(X3,X0)
      | status(X0,X1,wec)
      | ~ model(X3,X1)
      | ~ model(X2,X0)
      | ~ model(sK3(X0,X1),X1) ),
    inference(cnf_transformation,[],[f60]) ).

tcf(c_61,plain,
    ~ model(sK4,sK6),
    inference(cnf_transformation,[],[f66]) ).

tcf(c_62,plain,
    model(sK7,sK6),
    inference(cnf_transformation,[],[f65]) ).

tcf(c_74,plain,
    ! [X0: $i] : model(X0,sK21),
    inference(cnf_transformation,[],[f79]) ).

tcf(c_178,plain,
    ! [X0: $i,X1: $i] :
      ( ~ status(X0,X1,thm)
      | ~ status(X0,X1,wec) ),
    inference(resolution,[status(thm)],[c_49,c_50]) ).

tcf(c_566,plain,
    ! [X0: $i] : status(X0,sK21,thm),
    inference(superposition,[status(thm)],[c_74,c_52]) ).

tcf(c_956,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( model(X2,X1)
      | status(X1,sK21,wec)
      | ~ model(X2,sK21)
      | ~ model(X0,X1) ),
    inference(superposition,[status(thm)],[c_74,c_58]) ).

tcf(c_957,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( model(X2,X1)
      | status(X1,sK21,wec)
      | ~ model(X0,X1) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_956,c_74]) ).

tcf(c_977,plain,
    ! [X0: $i] : ~ status(X0,sK21,wec),
    inference(superposition,[status(thm)],[c_566,c_178]) ).

tcf(c_1059,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( model(X2,X1)
      | ~ model(X0,X1) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_957,c_977]) ).

tcf(c_1069,plain,
    ! [X0: $i] : model(X0,sK6),
    inference(superposition,[status(thm)],[c_62,c_1059]) ).

tcf(c_1083,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_61,c_1069]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS260+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.36  % Computer : n016.cluster.edu
% 0.08/5.36  % Model    : x86_64 x86_64
% 0.08/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36  % Memory   : 8046.5625MB
% 0.08/5.36  % OS       : Linux 6.8.0-71-generic
% 0.08/5.36  % CPULimit : 300
% 0.08/5.36  % WCLimit  : 300
% 0.08/5.36  % DateTime : Wed Sep 23 19:55:20 UTC 2026
% 0.08/5.36  % CPUTime  : 
% 0.08/5.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.39  Running first-order theorem proving
% 0.08/5.39  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/5.40  
% 0.13/5.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.40  
% 0.13/5.40  % Detected problem language: tptp
% 0.13/5.41  % Proving...
% 3.68/6.17  % SZS status Started for theBenchmark.p
% 3.68/6.17  % SZS status Theorem for theBenchmark.p
% 3.68/6.17  
% 3.68/6.17  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.68/6.17  
% 3.68/6.17  % ------  iProver source info
% 3.68/6.17  
% 3.68/6.17  % git: date: 2026-07-19 20:42:38 +0200
% 3.68/6.17  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.68/6.17  % git: non_committed_changes: false
% 3.68/6.17  
% 3.68/6.17  % ------ Parsing...
% 3.68/6.17  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.68/6.17  
% 3.68/6.17  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.68/6.17  
% 3.68/6.17  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.68/6.17  % ------ Proving...
% 3.68/6.17  % ------ Problem Properties 
% 3.68/6.17  
% 3.68/6.17  % 
% 3.68/6.17  % clauses                               25
% 3.68/6.17  % conjectures                           0
% 3.68/6.17  % EPR                                   18
% 3.68/6.17  % Horn                                  22
% 3.68/6.17  % unary                                 13
% 3.68/6.17  % binary                                8
% 3.68/6.17  % lits                                  45
% 3.68/6.17  % lits eq                               0
% 3.68/6.17  % fd_pure                               0
% 3.68/6.17  % fd_pseudo                             0
% 3.68/6.17  % fd_cond                               0
% 3.68/6.17  % fd_pseudo_cond                        0
% 3.68/6.17  % AC symbols                            0
% 3.68/6.17  
% 3.68/6.17  % ------ Schedule dynamic 5 is on 
% 3.68/6.17  
% 3.68/6.17  % ------ no conjectures: strip conj schedule 
% 3.68/6.17  
% 3.68/6.17  % ------ no equalities: superposition off 
% 3.68/6.17  
% 3.68/6.17  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.68/6.17  
% 3.68/6.17  
% 3.68/6.17  % ------ 
% 3.68/6.17  % Current options:
% 3.68/6.17  % ------ 
% 3.68/6.17  
% 3.68/6.17  
% 3.68/6.17  % 
% 3.68/6.17  
% 3.68/6.17  % ------ Proving...
% 3.68/6.17  % 
% 3.68/6.17  
% 3.68/6.17  % SZS status Theorem for theBenchmark.p
% 3.68/6.17  
% 3.68/6.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/6.17  
% 3.68/6.17  
%------------------------------------------------------------------------------