↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n018.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:25 PM UTC 2026

% Result   : Theorem 3.63s 1.28s
% Output   : CNFRefutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   45 (  16 unt;   0 def)
%            Number of atoms       :  117 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  123 (  51   ~;  47   |;  18   &)
%                                         (   5 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :  101 (   0 sgn  87   !;  14   ?;  23   :)

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

fof(f18,axiom,
    ! [X0,X1] :
      ( ( ! [X3] : model(X3,not(X1))
        & ! [X2] : model(X2,X0) )
    <=> status(X0,X1,uns) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',uns) ).

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

fof(f26,axiom,
    ! [X0,X1] :
      ( model(X0,X1)
    <=> ~ model(X0,not(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',not) ).

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

fof(f29,axiom,
    ? [X0] :
    ! [X1] : ~ model(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',contradiction) ).

fof(f33,conjecture,
    nota(uns,thm),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nota_uns_thm) ).

fof(f34,negated_conjecture,
    ~ nota(uns,thm),
    inference(negated_conjecture,[status(cth)],[f33]) ).

fof(f35,plain,
    ~ nota(uns,thm),
    inference(flattening,[],[f34]) ).

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

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

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

fof(f62,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,[],[f39]) ).

fof(f63,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,[],[f62]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ( ( model(sK9(X0,X1),X0)
          & ~ model(sK9(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,[sK9]),skolemize(X3,sK9(X0,X1))],[f63]) ).

fof(f110,plain,
    ! [X0,X1] :
      ( ( ? [X3] : ~ model(X3,not(X1))
        | ? [X2] : ~ model(X2,X0)
        | status(X0,X1,uns) )
      & ( ~ status(X0,X1,uns)
        | ( ! [X3] : model(X3,not(X1))
          & ! [X2] : model(X2,X0) ) ) ),
    inference(nnf_transformation,[],[f18]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( ( ? [X3] : ~ model(X3,not(X1))
        | ? [X2] : ~ model(X2,X0)
        | status(X0,X1,uns) )
      & ( ~ status(X0,X1,uns)
        | ( ! [X3] : model(X3,not(X1))
          & ! [X2] : model(X2,X0) ) ) ),
    inference(flattening,[],[f110]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( ( ? [X5] : ~ model(X5,not(X1))
        | ? [X4] : ~ model(X4,X0)
        | status(X0,X1,uns) )
      & ( ~ status(X0,X1,uns)
        | ( ! [X3] : model(X3,not(X1))
          & ! [X2] : model(X2,X0) ) ) ),
    inference(rectify,[],[f111]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( ( ~ model(sK38(X1),not(X1))
        | ~ model(sK37(X0),X0)
        | status(X0,X1,uns) )
      & ( ~ status(X0,X1,uns)
        | ( ! [X3] : model(X3,not(X1))
          & ! [X2] : model(X2,X0) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK37,sK38]),skolemize(X4,sK37(X0)),skolemize(X5,sK38(X1))],[f112]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ( ~ model(X0,X1)
        | ~ model(X0,not(X1)) )
      & ( model(X0,not(X1))
        | model(X0,X1) ) ),
    inference(nnf_transformation,[],[f26]) ).

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

fof(f122,plain,
    ! [X1] : ~ model(X1,sK45),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK45]),skolemize(X0,sK45)],[f29]) ).

fof(f141,plain,
    ! [X2,X0,X1] :
      ( ~ status(X0,X1,thm)
      | ~ model(X2,X0)
      | model(X2,X1) ),
    inference(cnf_transformation,[],[f64]) ).

fof(f191,plain,
    ! [X0,X1] :
      ( ~ model(sK38(X1),not(X1))
      | ~ model(sK37(X0),X0)
      | status(X0,X1,uns) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f199,plain,
    ! [X2,X3,X0,X1] :
      ( status(X2,X3,X1)
      | ~ status(X2,X3,X0)
      | nota(X0,X1) ),
    inference(cnf_transformation,[],[f46]) ).

fof(f203,plain,
    ! [X0,X1] :
      ( model(X0,not(X1))
      | model(X0,X1) ),
    inference(cnf_transformation,[],[f119]) ).

fof(f204,plain,
    ! [X1] : model(X1,sK41),
    inference(cnf_transformation,[],[f120]) ).

fof(f207,plain,
    ! [X1] : ~ model(X1,sK45),
    inference(cnf_transformation,[],[f122]) ).

fof(f219,plain,
    ~ nota(uns,thm),
    inference(cnf_transformation,[],[f35]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( model(X2,X1)
      | ~ model(X2,X0)
      | ~ status(X0,X1,thm) ),
    inference(cnf_transformation,[],[f141]) ).

tcf(c_116,plain,
    ! [X0: $i,X1: $i] :
      ( status(X1,X0,uns)
      | ~ model(sK37(X1),X1)
      | ~ model(sK38(X0),not(X0)) ),
    inference(cnf_transformation,[],[f191]) ).

tcf(c_122,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( nota(X2,X3)
      | status(X0,X1,X3)
      | ~ status(X0,X1,X2) ),
    inference(cnf_transformation,[],[f199]) ).

tcf(c_125,plain,
    ! [X0: $i,X1: $i] :
      ( model(X0,X1)
      | model(X0,not(X1)) ),
    inference(cnf_transformation,[],[f203]) ).

tcf(c_127,plain,
    ! [X0: $i] : model(X0,sK41),
    inference(cnf_transformation,[],[f204]) ).

tcf(c_130,plain,
    ! [X0: $i] : ~ model(X0,sK45),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_142,negated_conjecture,
    ~ nota(uns,thm),
    inference(cnf_transformation,[],[f219]) ).

tcf(c_973,plain,
    ! [X0: $i,X1: $i] :
      ( status(X0,X1,thm)
      | ~ status(X0,X1,uns) ),
    inference(resolution,[status(thm)],[c_122,c_142]) ).

tcf(c_1023,plain,
    ! [X0: $i,X1: $i] :
      ( ~ status(X0,X1,uns)
      | status(X0,X1,thm) ),
    inference(prop_impl_just,[status(thm)],[c_973]) ).

tcf(c_1024,plain,
    ! [X0: $i,X1: $i] :
      ( status(X0,X1,thm)
      | ~ status(X0,X1,uns) ),
    inference(renaming,[status(thm)],[c_1023]) ).

tcf(c_3348,plain,
    ! [X0: $i,X1: $i] :
      ( status(X0,X1,uns)
      | model(sK38(X1),X1)
      | ~ model(sK37(X0),X0) ),
    inference(superposition,[status(thm)],[c_125,c_116]) ).

tcf(c_6228,plain,
    ! [X0: $i] :
      ( status(sK41,X0,uns)
      | model(sK38(X0),X0) ),
    inference(superposition,[status(thm)],[c_127,c_3348]) ).

tcf(c_7113,plain,
    status(sK41,sK45,uns),
    inference(superposition,[status(thm)],[c_6228,c_130]) ).

tcf(c_7343,plain,
    status(sK41,sK45,thm),
    inference(superposition,[status(thm)],[c_7113,c_1024]) ).

tcf(c_7349,plain,
    ! [X0: $i] :
      ( model(X0,sK45)
      | ~ model(X0,sK41) ),
    inference(superposition,[status(thm)],[c_7343,c_62]) ).

tcf(c_7350,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_7349,c_130,c_127]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS216+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n018.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 19:45:02 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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.14/0.41  
% 0.14/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41  
% 0.14/0.41  % Detected problem language: tptp
% 0.14/0.42  % Proving...
% 3.63/1.28  % SZS status Started for theBenchmark.p
% 3.63/1.28  % SZS status Theorem for theBenchmark.p
% 3.63/1.28  
% 3.63/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.63/1.28  
% 3.63/1.28  % ------  iProver source info
% 3.63/1.28  
% 3.63/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 3.63/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.63/1.28  % git: non_committed_changes: false
% 3.63/1.28  
% 3.63/1.28  % ------ Parsing...
% 3.63/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.63/1.28  
% 3.63/1.28  % ------ 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.63/1.28  
% 3.63/1.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.63/1.28  % ------ Proving...
% 3.63/1.28  % ------ Problem Properties 
% 3.63/1.28  
% 3.63/1.28  % 
% 3.63/1.28  % clauses                               91
% 3.63/1.28  % conjectures                           0
% 3.63/1.28  % EPR                                   39
% 3.63/1.28  % Horn                                  72
% 3.63/1.28  % unary                                 13
% 3.63/1.28  % binary                                47
% 3.63/1.28  % lits                                  220
% 3.63/1.28  % lits eq                               0
% 3.63/1.28  % fd_pure                               0
% 3.63/1.28  % fd_pseudo                             0
% 3.63/1.28  % fd_cond                               0
% 3.63/1.28  % fd_pseudo_cond                        0
% 3.63/1.28  % AC symbols                            0
% 3.63/1.28  
% 3.63/1.28  % ------ Schedule dynamic 5 is on 
% 3.63/1.28  
% 3.63/1.28  % ------ no conjectures: strip conj schedule 
% 3.63/1.28  
% 3.63/1.28  % ------ no equalities: superposition off 
% 3.63/1.28  
% 3.63/1.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.63/1.28  
% 3.63/1.28  
% 3.63/1.28  % ------ 
% 3.63/1.28  % Current options:
% 3.63/1.28  % ------ 
% 3.63/1.28  
% 3.63/1.28  
% 3.63/1.28  % 
% 3.63/1.28  
% 3.63/1.28  % ------ Proving...
% 3.63/1.28  % 
% 3.63/1.28  
% 3.63/1.28  % SZS status Theorem for theBenchmark.p
% 3.63/1.28  
% 3.63/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.28  
% 3.63/1.28  
%------------------------------------------------------------------------------