↑ Up

Metis---2.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : SET576+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n014.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  : 600s
% DateTime : Tue Jul 19 03:35:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(intersect_defn,axiom,
    ! [B,C] :
      ( intersect(B,C)
    <=> ? [D] :
          ( member(D,B)
          & member(D,C) ) ) ).

fof(disjoint_defn,axiom,
    ! [B,C] :
      ( disjoint(B,C)
    <=> ~ intersect(B,C) ) ).

fof(prove_th17,conjecture,
    ! [B,C] :
      ( ! [D] :
          ( member(D,B)
         => ~ member(D,C) )
     => disjoint(B,C) ) ).

fof(subgoal_0,plain,
    ! [B,C] :
      ( ! [D] :
          ( member(D,B)
         => ~ member(D,C) )
     => disjoint(B,C) ),
    inference(strip,[],[prove_th17]) ).

fof(negate_0_0,plain,
    ~ ! [B,C] :
        ( ! [D] :
            ( member(D,B)
           => ~ member(D,C) )
       => disjoint(B,C) ),
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ? [B,C] :
      ( ~ disjoint(B,C)
      & ! [D] :
          ( ~ member(D,B)
          | ~ member(D,C) ) ),
    inference(canonicalize,[],[negate_0_0]) ).

fof(normalize_0_1,plain,
    ! [B,C] :
      ( ~ intersect(B,C)
    <=> ! [D] :
          ( ~ member(D,B)
          | ~ member(D,C) ) ),
    inference(canonicalize,[],[intersect_defn]) ).

fof(normalize_0_2,plain,
    ! [B,C] :
      ( ~ intersect(B,C)
    <=> ! [D] :
          ( ~ member(D,B)
          | ~ member(D,C) ) ),
    inference(specialize,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    ? [B,C] :
      ( ~ disjoint(B,C)
      & ~ intersect(B,C) ),
    inference(simplify,[],[normalize_0_0,normalize_0_2]) ).

fof(normalize_0_4,plain,
    ( ~ disjoint(skolemFOFtoCNF_B,skolemFOFtoCNF_C)
    & ~ intersect(skolemFOFtoCNF_B,skolemFOFtoCNF_C) ),
    inference(skolemize,[],[normalize_0_3]) ).

fof(normalize_0_5,plain,
    ~ intersect(skolemFOFtoCNF_B,skolemFOFtoCNF_C),
    inference(conjunct,[],[normalize_0_4]) ).

fof(normalize_0_6,plain,
    ! [B,C] :
      ( ~ disjoint(B,C)
    <=> intersect(B,C) ),
    inference(canonicalize,[],[disjoint_defn]) ).

fof(normalize_0_7,plain,
    ! [B,C] :
      ( ~ disjoint(B,C)
    <=> intersect(B,C) ),
    inference(specialize,[],[normalize_0_6]) ).

fof(normalize_0_8,plain,
    ! [B,C] :
      ( ( ~ disjoint(B,C)
        | ~ intersect(B,C) )
      & ( disjoint(B,C)
        | intersect(B,C) ) ),
    inference(clausify,[],[normalize_0_7]) ).

fof(normalize_0_9,plain,
    ! [B,C] :
      ( disjoint(B,C)
      | intersect(B,C) ),
    inference(conjunct,[],[normalize_0_8]) ).

fof(normalize_0_10,plain,
    ~ disjoint(skolemFOFtoCNF_B,skolemFOFtoCNF_C),
    inference(conjunct,[],[normalize_0_4]) ).

cnf(refute_0_0,plain,
    ~ intersect(skolemFOFtoCNF_B,skolemFOFtoCNF_C),
    inference(canonicalize,[],[normalize_0_5]) ).

cnf(refute_0_1,plain,
    ( disjoint(B,C)
    | intersect(B,C) ),
    inference(canonicalize,[],[normalize_0_9]) ).

cnf(refute_0_2,plain,
    ( disjoint(skolemFOFtoCNF_B,skolemFOFtoCNF_C)
    | intersect(skolemFOFtoCNF_B,skolemFOFtoCNF_C) ),
    inference(subst,[],[refute_0_1:[bind(B,$fot(skolemFOFtoCNF_B)),bind(C,$fot(skolemFOFtoCNF_C))]]) ).

cnf(refute_0_3,plain,
    disjoint(skolemFOFtoCNF_B,skolemFOFtoCNF_C),
    inference(resolve,[$cnf( intersect(skolemFOFtoCNF_B,skolemFOFtoCNF_C) )],[refute_0_2,refute_0_0]) ).

cnf(refute_0_4,plain,
    ~ disjoint(skolemFOFtoCNF_B,skolemFOFtoCNF_C),
    inference(canonicalize,[],[normalize_0_10]) ).

cnf(refute_0_5,plain,
    $false,
    inference(resolve,[$cnf( disjoint(skolemFOFtoCNF_B,skolemFOFtoCNF_C) )],[refute_0_3,refute_0_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET576+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : metis --show proof --show saturation %s
% 0.12/0.34  % Computer : n014.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  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 12:36:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.35  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35  
% 0.12/0.35  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.35  
%------------------------------------------------------------------------------