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

% Computer : n009.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 : Thu Aug 31 17:05:39 EDT 2023

% Result   : Theorem 0.85s 1.15s
% Output   : CNFRefutation 0.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   28 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   23 (  11   ~;   4   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :    9 (   0 sgn;   5   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f39,axiom,
    ! [X0] :
      ( one_sorted_str(X0)
     => cast_as_carrier_subset(X0) = the_carrier(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_pre_topc) ).

fof(f40,conjecture,
    ! [X0] :
      ( one_sorted_str(X0)
     => cast_as_carrier_subset(X0) = the_carrier(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_pre_topc) ).

fof(f41,negated_conjecture,
    ~ ! [X0] :
        ( one_sorted_str(X0)
       => cast_as_carrier_subset(X0) = the_carrier(X0) ),
    inference(negated_conjecture,[],[f40]) ).

fof(f82,plain,
    ! [X0] :
      ( cast_as_carrier_subset(X0) = the_carrier(X0)
      | ~ one_sorted_str(X0) ),
    inference(ennf_transformation,[],[f39]) ).

fof(f83,plain,
    ? [X0] :
      ( cast_as_carrier_subset(X0) != the_carrier(X0)
      & one_sorted_str(X0) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f94,plain,
    ( ? [X0] :
        ( cast_as_carrier_subset(X0) != the_carrier(X0)
        & one_sorted_str(X0) )
   => ( cast_as_carrier_subset(sK5) != the_carrier(sK5)
      & one_sorted_str(sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f95,plain,
    ( cast_as_carrier_subset(sK5) != the_carrier(sK5)
    & one_sorted_str(sK5) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f83,f94]) ).

fof(f150,plain,
    ! [X0] :
      ( cast_as_carrier_subset(X0) = the_carrier(X0)
      | ~ one_sorted_str(X0) ),
    inference(cnf_transformation,[],[f82]) ).

fof(f151,plain,
    one_sorted_str(sK5),
    inference(cnf_transformation,[],[f95]) ).

fof(f152,plain,
    cast_as_carrier_subset(sK5) != the_carrier(sK5),
    inference(cnf_transformation,[],[f95]) ).

cnf(c_103,plain,
    ( ~ one_sorted_str(X0)
    | cast_as_carrier_subset(X0) = the_carrier(X0) ),
    inference(cnf_transformation,[],[f150]) ).

cnf(c_104,negated_conjecture,
    cast_as_carrier_subset(sK5) != the_carrier(sK5),
    inference(cnf_transformation,[],[f152]) ).

cnf(c_105,negated_conjecture,
    one_sorted_str(sK5),
    inference(cnf_transformation,[],[f151]) ).

cnf(c_559,plain,
    ( X0 != sK5
    | cast_as_carrier_subset(X0) = the_carrier(X0) ),
    inference(resolution_lifted,[status(thm)],[c_103,c_105]) ).

cnf(c_560,plain,
    cast_as_carrier_subset(sK5) = the_carrier(sK5),
    inference(unflattening,[status(thm)],[c_559]) ).

cnf(c_561,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_560,c_104]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU306+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n009.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 : Wed Aug 23 22:12:21 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.85/1.15  % SZS status Started for theBenchmark.p
% 0.85/1.15  % SZS status Theorem for theBenchmark.p
% 0.85/1.15  
% 0.85/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.85/1.15  
% 0.85/1.15  ------  iProver source info
% 0.85/1.15  
% 0.85/1.15  git: date: 2023-05-31 18:12:56 +0000
% 0.85/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.85/1.15  git: non_committed_changes: false
% 0.85/1.15  git: last_make_outside_of_git: false
% 0.85/1.15  
% 0.85/1.15  ------ Parsing...
% 0.85/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.85/1.15  
% 0.85/1.15  ------ Preprocessing... sup_sim: 0  sf_s  rm: 40 0s  sf_e  pe_s  pe:1:0s
% 0.85/1.15  
% 0.85/1.15  % SZS status Theorem for theBenchmark.p
% 0.85/1.15  
% 0.85/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.85/1.15  
% 0.85/1.15  
%------------------------------------------------------------------------------