TSTP Solution File: NUN088+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : NUN088+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 02:53:21 EDT 2024

% Result   : Theorem 3.10s 1.22s
% Output   : CNFRefutation 3.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   72 (  32   ~;  21   |;  16   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   32 (   1 sgn  18   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f18,axiom,
    ! [X64,X65] :
      ( ~ r2(X64,X65)
      | ! [X66] :
          ( ~ r1(X66)
          | ~ id(X66,X65) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).

fof(f19,conjecture,
    ! [X62] :
      ( ! [X46] :
          ( ~ r2(X46,X62)
          | ~ r1(X46) )
      | ! [X45] :
          ( ~ r1(X45)
          | ~ id(X45,X62) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerounidone) ).

fof(f20,negated_conjecture,
    ~ ! [X62] :
        ( ! [X46] :
            ( ~ r2(X46,X62)
            | ~ r1(X46) )
        | ! [X45] :
            ( ~ r1(X45)
            | ~ id(X45,X62) ) ),
    inference(negated_conjecture,[],[f19]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ! [X2] :
          ( ~ r1(X2)
          | ~ id(X2,X1) ) ),
    inference(rectify,[],[f18]) ).

fof(f38,plain,
    ~ ! [X0] :
        ( ! [X1] :
            ( ~ r2(X1,X0)
            | ~ r1(X1) )
        | ! [X2] :
            ( ~ r1(X2)
            | ~ id(X2,X0) ) ),
    inference(rectify,[],[f20]) ).

fof(f39,plain,
    ? [X0] :
      ( ? [X1] :
          ( r2(X1,X0)
          & r1(X1) )
      & ? [X2] :
          ( r1(X2)
          & id(X2,X0) ) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f68,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( r2(X1,X0)
            & r1(X1) )
        & ? [X2] :
            ( r1(X2)
            & id(X2,X0) ) )
   => ( ? [X1] :
          ( r2(X1,sK20)
          & r1(X1) )
      & ? [X2] :
          ( r1(X2)
          & id(X2,sK20) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f69,plain,
    ( ? [X1] :
        ( r2(X1,sK20)
        & r1(X1) )
   => ( r2(sK21,sK20)
      & r1(sK21) ) ),
    introduced(choice_axiom,[]) ).

fof(f70,plain,
    ( ? [X2] :
        ( r1(X2)
        & id(X2,sK20) )
   => ( r1(sK22)
      & id(sK22,sK20) ) ),
    introduced(choice_axiom,[]) ).

fof(f71,plain,
    ( r2(sK21,sK20)
    & r1(sK21)
    & r1(sK22)
    & id(sK22,sK20) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22])],[f39,f70,f69,f68]) ).

fof(f129,plain,
    ! [X2,X0,X1] :
      ( ~ r2(X0,X1)
      | ~ r1(X2)
      | ~ id(X2,X1) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f130,plain,
    id(sK22,sK20),
    inference(cnf_transformation,[],[f71]) ).

fof(f131,plain,
    r1(sK22),
    inference(cnf_transformation,[],[f71]) ).

fof(f133,plain,
    r2(sK21,sK20),
    inference(cnf_transformation,[],[f71]) ).

cnf(c_90,plain,
    ( ~ id(X0,X1)
    | ~ r2(X2,X1)
    | ~ r1(X0) ),
    inference(cnf_transformation,[],[f129]) ).

cnf(c_91,negated_conjecture,
    r2(sK21,sK20),
    inference(cnf_transformation,[],[f133]) ).

cnf(c_93,negated_conjecture,
    r1(sK22),
    inference(cnf_transformation,[],[f131]) ).

cnf(c_94,negated_conjecture,
    id(sK22,sK20),
    inference(cnf_transformation,[],[f130]) ).

cnf(c_450,plain,
    ( ~ id(X0,sK20)
    | ~ r2(sK21,sK20)
    | ~ r1(X0) ),
    inference(instantiation,[status(thm)],[c_90]) ).

cnf(c_548,plain,
    ( ~ id(sK22,sK20)
    | ~ r2(sK21,sK20)
    | ~ r1(sK22) ),
    inference(instantiation,[status(thm)],[c_450]) ).

cnf(c_549,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_548,c_91,c_94,c_93]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUN088+1 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  2 22:10:05 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.10/1.22  % SZS status Started for theBenchmark.p
% 3.10/1.22  % SZS status Theorem for theBenchmark.p
% 3.10/1.22  
% 3.10/1.22  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.10/1.22  
% 3.10/1.22  ------  iProver source info
% 3.10/1.22  
% 3.10/1.22  git: date: 2024-05-02 19:28:25 +0000
% 3.10/1.22  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.10/1.22  git: non_committed_changes: false
% 3.10/1.22  
% 3.10/1.22  ------ Parsing...
% 3.10/1.22  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.10/1.22  
% 3.10/1.22  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.10/1.22  
% 3.10/1.22  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.10/1.22  ------ Proving...
% 3.10/1.22  ------ Problem Properties 
% 3.10/1.22  
% 3.10/1.22  
% 3.10/1.22  clauses                                 46
% 3.10/1.22  conjectures                             4
% 3.10/1.22  EPR                                     19
% 3.10/1.22  Horn                                    42
% 3.10/1.22  unary                                   22
% 3.10/1.22  binary                                  13
% 3.10/1.22  lits                                    92
% 3.10/1.22  lits eq                                 0
% 3.10/1.22  fd_pure                                 0
% 3.10/1.22  fd_pseudo                               0
% 3.10/1.22  fd_cond                                 0
% 3.10/1.22  fd_pseudo_cond                          0
% 3.10/1.22  AC symbols                              0
% 3.10/1.22  
% 3.10/1.22  ------ Schedule dynamic 5 is on 
% 3.10/1.22  
% 3.10/1.22  ------ no equalities: superposition off 
% 3.10/1.22  
% 3.10/1.22  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.10/1.22  
% 3.10/1.22  
% 3.10/1.22  ------ 
% 3.10/1.22  Current options:
% 3.10/1.22  ------ 
% 3.10/1.22  
% 3.10/1.22  
% 3.10/1.22  
% 3.10/1.22  
% 3.10/1.22  ------ Proving...
% 3.10/1.22  
% 3.10/1.22  
% 3.10/1.22  % SZS status Theorem for theBenchmark.p
% 3.10/1.22  
% 3.10/1.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.10/1.22  
% 3.10/1.22  
%------------------------------------------------------------------------------