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

View Problem - Process Solution

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

% Computer : n018.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 03:04:47 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,conjecture,
    ! [X0,X1] :
      ( in(X0,X1)
     => subset(X0,union(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t92_zfmisc_1) ).

fof(f5,negated_conjecture,
    ~ ! [X0,X1] :
        ( in(X0,X1)
       => subset(X0,union(X1)) ),
    inference(negated_conjecture,[],[f4]) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( in(X0,X1)
     => subset(X0,union(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).

fof(f9,plain,
    ? [X0,X1] :
      ( ~ subset(X0,union(X1))
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( subset(X0,union(X1))
      | ~ in(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f11,plain,
    ( ? [X0,X1] :
        ( ~ subset(X0,union(X1))
        & in(X0,X1) )
   => ( ~ subset(sK0,union(sK1))
      & in(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ( ~ subset(sK0,union(sK1))
    & in(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11]) ).

fof(f15,plain,
    in(sK0,sK1),
    inference(cnf_transformation,[],[f12]) ).

fof(f16,plain,
    ~ subset(sK0,union(sK1)),
    inference(cnf_transformation,[],[f12]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( subset(X0,union(X1))
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_51,negated_conjecture,
    ~ subset(sK0,union(sK1)),
    inference(cnf_transformation,[],[f16]) ).

cnf(c_52,negated_conjecture,
    in(sK0,sK1),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_53,plain,
    ( ~ in(X0,X1)
    | subset(X0,union(X1)) ),
    inference(cnf_transformation,[],[f17]) ).

cnf(c_71,plain,
    ~ in(sK0,sK1),
    inference(resolution,[status(thm)],[c_51,c_53]) ).

cnf(c_72,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_71,c_52]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SEU163+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n018.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 17:45:01 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  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.55/1.22  % SZS status Started for theBenchmark.p
% 0.55/1.22  % SZS status Theorem for theBenchmark.p
% 0.55/1.22  
% 0.55/1.22  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.55/1.22  
% 0.55/1.22  ------  iProver source info
% 0.55/1.22  
% 0.55/1.22  git: date: 2024-05-02 19:28:25 +0000
% 0.55/1.22  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.55/1.22  git: non_committed_changes: false
% 0.55/1.22  
% 0.55/1.22  ------ Parsing...
% 0.55/1.22  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.55/1.22  
% 0.55/1.22  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s 
% 0.55/1.22  
% 0.55/1.22  % SZS status Theorem for theBenchmark.p
% 0.55/1.22  
% 0.55/1.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.55/1.22  
% 0.55/1.22  
%------------------------------------------------------------------------------