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

% Computer : n028.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 0.85s 1.22s
% Output   : CNFRefutation 0.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   8 unt;   0 def)
%            Number of atoms       :   48 (  13 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   53 (  26   ~;  15   |;  10   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   25 (   1 sgn  17   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    ! [X40,X41] :
      ( ~ r2(X40,X41)
      | ! [X42] :
          ( X41 != X42
          | ~ r1(X42) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7a) ).

fof(f12,conjecture,
    ! [X43] :
      ( ~ r1(X43)
      | ! [X38] :
          ( ~ r2(X43,X38)
          | X38 != X43 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerouneqone2) ).

fof(f13,negated_conjecture,
    ~ ! [X43] :
        ( ~ r1(X43)
        | ! [X38] :
            ( ~ r2(X43,X38)
            | X38 != X43 ) ),
    inference(negated_conjecture,[],[f12]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ! [X2] :
          ( X1 != X2
          | ~ r1(X2) ) ),
    inference(rectify,[],[f11]) ).

fof(f24,plain,
    ~ ! [X0] :
        ( ~ r1(X0)
        | ! [X1] :
            ( ~ r2(X0,X1)
            | X0 != X1 ) ),
    inference(rectify,[],[f13]) ).

fof(f25,plain,
    ? [X0] :
      ( r1(X0)
      & ? [X1] :
          ( r2(X0,X1)
          & X0 = X1 ) ),
    inference(ennf_transformation,[],[f24]) ).

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

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

fof(f56,plain,
    ( r1(sK20)
    & r2(sK20,sK21)
    & sK20 = sK21 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21])],[f25,f55,f54]) ).

fof(f95,plain,
    ! [X2,X0,X1] :
      ( ~ r2(X0,X1)
      | X1 != X2
      | ~ r1(X2) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f96,plain,
    sK20 = sK21,
    inference(cnf_transformation,[],[f56]) ).

fof(f97,plain,
    r2(sK20,sK21),
    inference(cnf_transformation,[],[f56]) ).

fof(f98,plain,
    r1(sK20),
    inference(cnf_transformation,[],[f56]) ).

fof(f102,plain,
    r1(sK21),
    inference(definition_unfolding,[],[f98,f96]) ).

fof(f103,plain,
    r2(sK21,sK21),
    inference(definition_unfolding,[],[f97,f96]) ).

fof(f113,plain,
    ! [X2,X0] :
      ( ~ r2(X0,X2)
      | ~ r1(X2) ),
    inference(equality_resolution,[],[f95]) ).

cnf(c_76,plain,
    ( ~ r2(X0,X1)
    | ~ r1(X1) ),
    inference(cnf_transformation,[],[f113]) ).

cnf(c_77,negated_conjecture,
    r1(sK21),
    inference(cnf_transformation,[],[f102]) ).

cnf(c_78,negated_conjecture,
    r2(sK21,sK21),
    inference(cnf_transformation,[],[f103]) ).

cnf(c_92,plain,
    ( ~ r2(sK21,sK21)
    | ~ r1(sK21) ),
    inference(instantiation,[status(thm)],[c_76]) ).

cnf(c_93,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_92,c_78,c_77]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUN088+3 : TPTP v8.1.2. Released v7.3.0.
% 0.08/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.36  % Computer : n028.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu May  2 22:04:18 EDT 2024
% 0.14/0.36  % CPUTime  : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.85/1.22  % SZS status Started for theBenchmark.p
% 0.85/1.22  % SZS status Theorem for theBenchmark.p
% 0.85/1.22  
% 0.85/1.22  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.85/1.22  
% 0.85/1.22  ------  iProver source info
% 0.85/1.22  
% 0.85/1.22  git: date: 2024-05-02 19:28:25 +0000
% 0.85/1.22  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.85/1.22  git: non_committed_changes: false
% 0.85/1.22  
% 0.85/1.22  ------ Parsing...
% 0.85/1.22  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.85/1.22  
% 0.85/1.22  ------ Preprocessing...
% 0.85/1.22  
% 0.85/1.22  % SZS status Theorem for theBenchmark.p
% 0.85/1.22  
% 0.85/1.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.85/1.22  
% 0.85/1.22  
%------------------------------------------------------------------------------