TSTP Solution File: SET169+3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SET169+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n023.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 15:06:56 EDT 2023

% Result   : Theorem 0.49s 1.16s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   61 (  10 unt;   0 def)
%            Number of atoms       :  179 (  20 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  216 (  98   ~;  92   |;  20   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   93 (   4 sgn;  60   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,union(X0,X1))
    <=> ( member(X2,X1)
        | member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X1)
        & member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ! [X2] :
          ( member(X2,X0)
        <=> member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).

fof(f9,conjecture,
    ! [X0,X1,X2] : intersection(X0,union(X1,X2)) = union(intersection(X0,X1),intersection(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_distributes_over_union) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1,X2] : intersection(X0,union(X1,X2)) = union(intersection(X0,X1),intersection(X0,X2)),
    inference(negated_conjecture,[],[f9]) ).

fof(f12,plain,
    ? [X0,X1,X2] : intersection(X0,union(X1,X2)) != union(intersection(X0,X1),intersection(X0,X2)),
    inference(ennf_transformation,[],[f10]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,union(X0,X1))
        | ( ~ member(X2,X1)
          & ~ member(X2,X0) ) )
      & ( member(X2,X1)
        | member(X2,X0)
        | ~ member(X2,union(X0,X1)) ) ),
    inference(nnf_transformation,[],[f1]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,union(X0,X1))
        | ( ~ member(X2,X1)
          & ~ member(X2,X0) ) )
      & ( member(X2,X1)
        | member(X2,X0)
        | ~ member(X2,union(X0,X1)) ) ),
    inference(flattening,[],[f13]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f16,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(flattening,[],[f15]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X2] :
            ( ( member(X2,X0)
              | ~ member(X2,X1) )
            & ( member(X2,X1)
              | ~ member(X2,X0) ) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f8]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(rectify,[],[f23]) ).

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

fof(f26,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ( ( ~ member(sK1(X0,X1),X1)
            | ~ member(sK1(X0,X1),X0) )
          & ( member(sK1(X0,X1),X1)
            | member(sK1(X0,X1),X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f24,f25]) ).

fof(f27,plain,
    ( ? [X0,X1,X2] : intersection(X0,union(X1,X2)) != union(intersection(X0,X1),intersection(X0,X2))
   => intersection(sK2,union(sK3,sK4)) != union(intersection(sK2,sK3),intersection(sK2,sK4)) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    intersection(sK2,union(sK3,sK4)) != union(intersection(sK2,sK3),intersection(sK2,sK4)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f12,f27]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | member(X2,X0)
      | ~ member(X2,union(X0,X1)) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( member(X2,union(X0,X1))
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f31,plain,
    ! [X2,X0,X1] :
      ( member(X2,union(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f32,plain,
    ! [X2,X0,X1] :
      ( member(X2,X0)
      | ~ member(X2,intersection(X0,X1)) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f33,plain,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ member(X2,intersection(X0,X1)) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f34,plain,
    ! [X2,X0,X1] :
      ( member(X2,intersection(X0,X1))
      | ~ member(X2,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( X0 = X1
      | member(sK1(X0,X1),X1)
      | member(sK1(X0,X1),X0) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ member(sK1(X0,X1),X1)
      | ~ member(sK1(X0,X1),X0) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f48,plain,
    intersection(sK2,union(sK3,sK4)) != union(intersection(sK2,sK3),intersection(sK2,sK4)),
    inference(cnf_transformation,[],[f28]) ).

cnf(c_49,plain,
    ( ~ member(X0,X1)
    | member(X0,union(X2,X1)) ),
    inference(cnf_transformation,[],[f31]) ).

cnf(c_50,plain,
    ( ~ member(X0,X1)
    | member(X0,union(X1,X2)) ),
    inference(cnf_transformation,[],[f30]) ).

cnf(c_51,plain,
    ( ~ member(X0,union(X1,X2))
    | member(X0,X1)
    | member(X0,X2) ),
    inference(cnf_transformation,[],[f29]) ).

cnf(c_52,plain,
    ( ~ member(X0,X1)
    | ~ member(X0,X2)
    | member(X0,intersection(X1,X2)) ),
    inference(cnf_transformation,[],[f34]) ).

cnf(c_53,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X2) ),
    inference(cnf_transformation,[],[f33]) ).

cnf(c_54,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X1) ),
    inference(cnf_transformation,[],[f32]) ).

cnf(c_64,plain,
    ( ~ member(sK1(X0,X1),X0)
    | ~ member(sK1(X0,X1),X1)
    | X0 = X1 ),
    inference(cnf_transformation,[],[f47]) ).

cnf(c_65,plain,
    ( X0 = X1
    | member(sK1(X0,X1),X0)
    | member(sK1(X0,X1),X1) ),
    inference(cnf_transformation,[],[f46]) ).

cnf(c_66,negated_conjecture,
    union(intersection(sK2,sK3),intersection(sK2,sK4)) != intersection(sK2,union(sK3,sK4)),
    inference(cnf_transformation,[],[f48]) ).

cnf(c_499,plain,
    ( union(intersection(sK2,sK3),intersection(sK2,sK4)) = intersection(sK2,union(sK3,sK4))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4))) ),
    inference(instantiation,[status(thm)],[c_65]) ).

cnf(c_521,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4)) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_716,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4))) ),
    inference(resolution,[status(thm)],[c_64,c_66]) ).

cnf(c_730,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4)))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_731,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4)))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4)) ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_913,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_914,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK3) ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_1271,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),X0)
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(X0,union(sK3,sK4))) ),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_1272,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2)
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4))) ),
    inference(instantiation,[status(thm)],[c_1271]) ).

cnf(c_1279,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK3)
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK4) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_1284,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4)))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3)) ),
    inference(resolution,[status(thm)],[c_716,c_50]) ).

cnf(c_1294,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,union(sK3,sK4)))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4)) ),
    inference(resolution,[status(thm)],[c_716,c_49]) ).

cnf(c_1783,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),X0)
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK4)
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(X0,sK4)) ),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_1784,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2)
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK4)
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4)) ),
    inference(instantiation,[status(thm)],[c_1783]) ).

cnf(c_2150,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_2151,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4))
    | member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK4) ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_2787,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2) ),
    inference(resolution,[status(thm)],[c_1284,c_52]) ).

cnf(c_2788,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4)) ),
    inference(global_subsumption_just,[status(thm)],[c_2787,c_913,c_1272,c_1284]) ).

cnf(c_2789,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK3)) ),
    inference(renaming,[status(thm)],[c_2788]) ).

cnf(c_2866,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2) ),
    inference(resolution,[status(thm)],[c_1294,c_52]) ).

cnf(c_2867,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4)) ),
    inference(global_subsumption_just,[status(thm)],[c_2866,c_2150,c_2866]) ).

cnf(c_2868,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),intersection(sK2,sK4)) ),
    inference(renaming,[status(thm)],[c_2867]) ).

cnf(c_5987,plain,
    ( ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK2)
    | ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK3) ),
    inference(resolution,[status(thm)],[c_2789,c_52]) ).

cnf(c_5988,plain,
    ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),union(sK3,sK4)),
    inference(global_subsumption_just,[status(thm)],[c_5987,c_66,c_499,c_521,c_730,c_1279,c_1784,c_2789,c_2868,c_5987]) ).

cnf(c_5991,plain,
    ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK3),
    inference(resolution,[status(thm)],[c_5988,c_50]) ).

cnf(c_6002,plain,
    ~ member(sK1(union(intersection(sK2,sK3),intersection(sK2,sK4)),intersection(sK2,union(sK3,sK4))),sK4),
    inference(resolution,[status(thm)],[c_5988,c_49]) ).

cnf(c_6003,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_6002,c_5991,c_5988,c_2151,c_914,c_731,c_521,c_499,c_66]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET169+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sat Aug 26 10:34:41 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.49/1.16  % SZS status Started for theBenchmark.p
% 0.49/1.16  % SZS status Theorem for theBenchmark.p
% 0.49/1.16  
% 0.49/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.49/1.16  
% 0.49/1.16  ------  iProver source info
% 0.49/1.16  
% 0.49/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.49/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.49/1.16  git: non_committed_changes: false
% 0.49/1.16  git: last_make_outside_of_git: false
% 0.49/1.16  
% 0.49/1.16  ------ Parsing...
% 0.49/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.49/1.16  
% 0.49/1.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 0.49/1.16  
% 0.49/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.49/1.16  
% 0.49/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.49/1.16  ------ Proving...
% 0.49/1.16  ------ Problem Properties 
% 0.49/1.16  
% 0.49/1.16  
% 0.49/1.16  clauses                                 16
% 0.49/1.16  conjectures                             1
% 0.49/1.16  EPR                                     3
% 0.49/1.16  Horn                                    13
% 0.49/1.16  unary                                   4
% 0.49/1.16  binary                                  6
% 0.49/1.16  lits                                    34
% 0.49/1.16  lits eq                                 6
% 0.49/1.16  fd_pure                                 0
% 0.49/1.16  fd_pseudo                               0
% 0.49/1.16  fd_cond                                 0
% 0.49/1.16  fd_pseudo_cond                          3
% 0.49/1.16  AC symbols                              0
% 0.49/1.16  
% 0.49/1.16  ------ Input Options Time Limit: Unbounded
% 0.49/1.16  
% 0.49/1.16  
% 0.49/1.16  ------ 
% 0.49/1.16  Current options:
% 0.49/1.16  ------ 
% 0.49/1.16  
% 0.49/1.16  
% 0.49/1.16  
% 0.49/1.16  
% 0.49/1.16  ------ Proving...
% 0.49/1.16  
% 0.49/1.16  
% 0.49/1.16  % SZS status Theorem for theBenchmark.p
% 0.49/1.16  
% 0.49/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.16  
% 0.49/1.17  
%------------------------------------------------------------------------------