TSTP Solution File: NUN080+2 by iProver---3.9

View Problem - Process Solution

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

% Computer : n019.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:18 EDT 2024

% Result   : Theorem 0.49s 1.17s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (   8 unt;   0 def)
%            Number of atoms       :  114 (  39 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  145 (  63   ~;  39   |;  40   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   99 (   7 sgn  52   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ? [X0] :
    ! [X1] :
      ( ( X0 = X1
        & r1(X1) )
      | ( X0 != X1
        & ~ r1(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f2,axiom,
    ! [X2] :
    ? [X3] :
    ! [X4] :
      ( ( X3 = X4
        & r2(X2,X4) )
      | ( X3 != X4
        & ~ r2(X2,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f3,axiom,
    ! [X5,X6] :
    ? [X7] :
    ! [X8] :
      ( ( X7 = X8
        & r3(X5,X6,X8) )
      | ( X7 != X8
        & ~ r3(X5,X6,X8) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(f12,conjecture,
    ? [X38,X21,X22] :
      ( ? [X15] :
          ( ? [X16] :
              ( ? [X24] :
                  ( r2(X24,X16)
                  & r1(X24) )
              & r2(X16,X15) )
          & r3(X38,X15,X22) )
      & X21 = X22 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xplustwoeqy) ).

fof(f13,negated_conjecture,
    ~ ? [X38,X21,X22] :
        ( ? [X15] :
            ( ? [X16] :
                ( ? [X24] :
                    ( r2(X24,X16)
                    & r1(X24) )
                & r2(X16,X15) )
            & r3(X38,X15,X22) )
        & X21 = X22 ),
    inference(negated_conjecture,[],[f12]) ).

fof(f14,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( X1 = X2
        & r2(X0,X2) )
      | ( X1 != X2
        & ~ r2(X0,X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f15,plain,
    ! [X0,X1] :
    ? [X2] :
    ! [X3] :
      ( ( X2 = X3
        & r3(X0,X1,X3) )
      | ( X2 != X3
        & ~ r3(X0,X1,X3) ) ),
    inference(rectify,[],[f3]) ).

fof(f24,plain,
    ~ ? [X0,X1,X2] :
        ( ? [X3] :
            ( ? [X4] :
                ( ? [X5] :
                    ( r2(X5,X4)
                    & r1(X5) )
                & r2(X4,X3) )
            & r3(X0,X3,X2) )
        & X1 = X2 ),
    inference(rectify,[],[f13]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ! [X3] :
          ( ! [X4] :
              ( ! [X5] :
                  ( ~ r2(X5,X4)
                  | ~ r1(X5) )
              | ~ r2(X4,X3) )
          | ~ r3(X0,X3,X2) )
      | X1 != X2 ),
    inference(ennf_transformation,[],[f24]) ).

fof(f26,plain,
    ( ? [X0] :
      ! [X1] :
        ( ( X0 = X1
          & r1(X1) )
        | ( X0 != X1
          & ~ r1(X1) ) )
   => ! [X1] :
        ( ( sK0 = X1
          & r1(X1) )
        | ( sK0 != X1
          & ~ r1(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f27,plain,
    ! [X1] :
      ( ( sK0 = X1
        & r1(X1) )
      | ( sK0 != X1
        & ~ r1(X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f26]) ).

fof(f28,plain,
    ! [X0] :
      ( ? [X1] :
        ! [X2] :
          ( ( X1 = X2
            & r2(X0,X2) )
          | ( X1 != X2
            & ~ r2(X0,X2) ) )
     => ! [X2] :
          ( ( sK1(X0) = X2
            & r2(X0,X2) )
          | ( sK1(X0) != X2
            & ~ r2(X0,X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ! [X0,X2] :
      ( ( sK1(X0) = X2
        & r2(X0,X2) )
      | ( sK1(X0) != X2
        & ~ r2(X0,X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f28]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( ? [X2] :
        ! [X3] :
          ( ( X2 = X3
            & r3(X0,X1,X3) )
          | ( X2 != X3
            & ~ r3(X0,X1,X3) ) )
     => ! [X3] :
          ( ( sK2(X0,X1) = X3
            & r3(X0,X1,X3) )
          | ( sK2(X0,X1) != X3
            & ~ r3(X0,X1,X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f31,plain,
    ! [X0,X1,X3] :
      ( ( sK2(X0,X1) = X3
        & r3(X0,X1,X3) )
      | ( sK2(X0,X1) != X3
        & ~ r3(X0,X1,X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f15,f30]) ).

fof(f55,plain,
    ! [X1] :
      ( r1(X1)
      | sK0 != X1 ),
    inference(cnf_transformation,[],[f27]) ).

fof(f59,plain,
    ! [X2,X0] :
      ( r2(X0,X2)
      | sK1(X0) != X2 ),
    inference(cnf_transformation,[],[f29]) ).

fof(f63,plain,
    ! [X3,X0,X1] :
      ( r3(X0,X1,X3)
      | sK2(X0,X1) != X3 ),
    inference(cnf_transformation,[],[f31]) ).

fof(f93,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ r2(X5,X4)
      | ~ r1(X5)
      | ~ r2(X4,X3)
      | ~ r3(X0,X3,X2)
      | X1 != X2 ),
    inference(cnf_transformation,[],[f25]) ).

fof(f98,plain,
    r1(sK0),
    inference(equality_resolution,[],[f55]) ).

fof(f100,plain,
    ! [X0] : r2(X0,sK1(X0)),
    inference(equality_resolution,[],[f59]) ).

fof(f102,plain,
    ! [X0,X1] : r3(X0,X1,sK2(X0,X1)),
    inference(equality_resolution,[],[f63]) ).

fof(f107,plain,
    ! [X2,X3,X0,X4,X5] :
      ( ~ r2(X5,X4)
      | ~ r1(X5)
      | ~ r2(X4,X3)
      | ~ r3(X0,X3,X2) ),
    inference(equality_resolution,[],[f93]) ).

cnf(c_50,plain,
    r1(sK0),
    inference(cnf_transformation,[],[f98]) ).

cnf(c_52,plain,
    r2(X0,sK1(X0)),
    inference(cnf_transformation,[],[f100]) ).

cnf(c_54,plain,
    r3(X0,X1,sK2(X0,X1)),
    inference(cnf_transformation,[],[f102]) ).

cnf(c_77,negated_conjecture,
    ( ~ r3(X0,X1,X2)
    | ~ r2(X3,X4)
    | ~ r2(X4,X1)
    | ~ r1(X3) ),
    inference(cnf_transformation,[],[f107]) ).

cnf(c_271,plain,
    ( sK2(X1,X3) != X4
    | X0 != X1
    | X2 != X3
    | ~ r2(X5,X6)
    | ~ r2(X6,X2)
    | ~ r1(X5) ),
    inference(resolution_lifted,[status(thm)],[c_77,c_54]) ).

cnf(c_272,plain,
    ( ~ r2(X0,X1)
    | ~ r2(X1,X2)
    | ~ r1(X0) ),
    inference(unflattening,[status(thm)],[c_271]) ).

cnf(c_982,plain,
    ( ~ r2(X0,X1)
    | ~ r1(X0) ),
    inference(superposition,[status(thm)],[c_52,c_272]) ).

cnf(c_989,plain,
    ~ r1(X0),
    inference(superposition,[status(thm)],[c_52,c_982]) ).

cnf(c_990,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_989]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUN080+2 : TPTP v8.1.2. Released v7.3.0.
% 0.08/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 21:42:29 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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
% 0.49/1.17  % SZS status Started for theBenchmark.p
% 0.49/1.17  % SZS status Theorem for theBenchmark.p
% 0.49/1.17  
% 0.49/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.17  
% 0.49/1.17  ------  iProver source info
% 0.49/1.17  
% 0.49/1.17  git: date: 2024-05-02 19:28:25 +0000
% 0.49/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.49/1.17  git: non_committed_changes: false
% 0.49/1.17  
% 0.49/1.17  ------ Parsing...
% 0.49/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.49/1.17  
% 0.49/1.17  ------ Preprocessing... sup_sim: 1  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 2  sf_s  rm: 3 0s  sf_e  pe_s  pe_e 
% 0.49/1.17  
% 0.49/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.49/1.17  
% 0.49/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.49/1.17  ------ Proving...
% 0.49/1.17  ------ Problem Properties 
% 0.49/1.17  
% 0.49/1.17  
% 0.49/1.17  clauses                                 25
% 0.49/1.17  conjectures                             0
% 0.49/1.17  EPR                                     5
% 0.49/1.17  Horn                                    21
% 0.49/1.17  unary                                   16
% 0.49/1.17  binary                                  7
% 0.49/1.17  lits                                    36
% 0.49/1.17  lits eq                                 15
% 0.49/1.17  fd_pure                                 0
% 0.49/1.17  fd_pseudo                               0
% 0.49/1.17  fd_cond                                 1
% 0.49/1.17  fd_pseudo_cond                          2
% 0.49/1.17  AC symbols                              0
% 0.49/1.17  
% 0.49/1.17  ------ Schedule dynamic 5 is on 
% 0.49/1.17  
% 0.49/1.17  ------ no conjectures: strip conj schedule 
% 0.49/1.17  
% 0.49/1.17  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.49/1.17  
% 0.49/1.17  
% 0.49/1.17  ------ 
% 0.49/1.17  Current options:
% 0.49/1.17  ------ 
% 0.49/1.17  
% 0.49/1.17  
% 0.49/1.17  
% 0.49/1.17  
% 0.49/1.17  ------ Proving...
% 0.49/1.17  
% 0.49/1.17  
% 0.49/1.17  % SZS status Theorem for theBenchmark.p
% 0.49/1.17  
% 0.49/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.17  
% 0.49/1.17  
%------------------------------------------------------------------------------