TSTP Solution File: SET144+3 by iProver---3.9

View Problem - Process Solution

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

% Computer : n017.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:00:03 EDT 2024

% Result   : Theorem 10.41s 2.14s
% Output   : CNFRefutation 10.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   65 (   5 unt;   0 def)
%            Number of atoms       :  211 (  21 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  243 (  97   ~; 102   |;  32   &)
%                                         (   6 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :  122 (   7 sgn  80   !;  12   ?)

% 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(f3,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_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] :
      ( subset(X0,X1)
     => union(X0,intersection(X2,X1)) = intersection(union(X0,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th44) ).

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

fof(f11,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f12,plain,
    ? [X0,X1,X2] :
      ( union(X0,intersection(X2,X1)) != intersection(union(X0,X2),X1)
      & subset(X0,X1) ),
    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(f17,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f11]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f17]) ).

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

fof(f20,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK0(X0,X1),X1)
          & member(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f19]) ).

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] :
        ( union(X0,intersection(X2,X1)) != intersection(union(X0,X2),X1)
        & subset(X0,X1) )
   => ( union(sK2,intersection(sK4,sK3)) != intersection(union(sK2,sK4),sK3)
      & subset(sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    ( union(sK2,intersection(sK4,sK3)) != intersection(union(sK2,sK4),sK3)
    & subset(sK2,sK3) ),
    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(f35,plain,
    ! [X3,X0,X1] :
      ( member(X3,X1)
      | ~ member(X3,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f20]) ).

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,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f28]) ).

fof(f49,plain,
    union(sK2,intersection(sK4,sK3)) != intersection(union(sK2,sK4),sK3),
    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_57,plain,
    ( ~ member(X0,X1)
    | ~ subset(X1,X2)
    | member(X0,X2) ),
    inference(cnf_transformation,[],[f35]) ).

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(sK2,intersection(sK4,sK3)) != intersection(union(sK2,sK4),sK3),
    inference(cnf_transformation,[],[f49]) ).

cnf(c_67,negated_conjecture,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f48]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_12987,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_9543,c_7613,c_6696,c_4366,c_4346,c_3592,c_2776,c_2777,c_2773,c_1071,c_827,c_825,c_826,c_562,c_544,c_66,c_67]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET144+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu May  2 20:09:36 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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
% 10.41/2.14  % SZS status Started for theBenchmark.p
% 10.41/2.14  % SZS status Theorem for theBenchmark.p
% 10.41/2.14  
% 10.41/2.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.41/2.14  
% 10.41/2.14  ------  iProver source info
% 10.41/2.14  
% 10.41/2.14  git: date: 2024-05-02 19:28:25 +0000
% 10.41/2.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.41/2.14  git: non_committed_changes: false
% 10.41/2.14  
% 10.41/2.14  ------ Parsing...
% 10.41/2.14  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 10.41/2.14  
% 10.41/2.14  ------ 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 
% 10.41/2.14  
% 10.41/2.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 10.41/2.14  
% 10.41/2.14  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 10.41/2.14  ------ Proving...
% 10.41/2.14  ------ Problem Properties 
% 10.41/2.14  
% 10.41/2.14  
% 10.41/2.14  clauses                                 17
% 10.41/2.14  conjectures                             2
% 10.41/2.14  EPR                                     4
% 10.41/2.14  Horn                                    14
% 10.41/2.14  unary                                   5
% 10.41/2.14  binary                                  6
% 10.41/2.14  lits                                    35
% 10.41/2.14  lits eq                                 6
% 10.41/2.14  fd_pure                                 0
% 10.41/2.14  fd_pseudo                               0
% 10.41/2.14  fd_cond                                 0
% 10.41/2.14  fd_pseudo_cond                          3
% 10.41/2.14  AC symbols                              0
% 10.41/2.14  
% 10.41/2.14  ------ Input Options Time Limit: Unbounded
% 10.41/2.14  
% 10.41/2.14  
% 10.41/2.14  ------ 
% 10.41/2.14  Current options:
% 10.41/2.14  ------ 
% 10.41/2.14  
% 10.41/2.14  
% 10.41/2.14  
% 10.41/2.14  
% 10.41/2.14  ------ Proving...
% 10.41/2.14  
% 10.41/2.14  
% 10.41/2.14  % SZS status Theorem for theBenchmark.p
% 10.41/2.14  
% 10.41/2.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.41/2.14  
% 10.41/2.14  
%------------------------------------------------------------------------------