TSTP Solution File: SET118-7 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SET118-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n013.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 : Tue Sep 20 05:05:46 EDT 2022

% Result   : Unsatisfiable 0.21s 0.45s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   34 (  13 unt;   5 typ;   0 def)
%            Number of atoms       :  113 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  143 (  68   ~;  61   |;   0   &)
%                                         (  14 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :    9 (   9 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   61 (  54   !;   0   ?;  61   :)

% Comments : 
%------------------------------------------------------------------------------
tff(subclass_type,type,
    subclass: ( $i * $i ) > $o ).

tff(universal_class_type,type,
    universal_class: $i ).

tff(cross_product_type,type,
    cross_product: ( $i * $i ) > $i ).

tff(member_type,type,
    member: ( $i * $i ) > $o ).

tff(x_type,type,
    x: $i ).

tff(1,plain,
    ( ~ member(x,universal_class)
  <=> ~ member(x,universal_class) ),
    inference(rewrite,[status(thm)],]) ).

tff(2,axiom,
    ~ member(x,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_ordered_pairs_are_sets_2) ).

tff(3,plain,
    ~ member(x,universal_class),
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,plain,
    ( member(x,cross_product(universal_class,universal_class))
  <=> member(x,cross_product(universal_class,universal_class)) ),
    inference(rewrite,[status(thm)],]) ).

tff(5,axiom,
    member(x,cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_ordered_pairs_are_sets_1) ).

tff(6,plain,
    member(x,cross_product(universal_class,universal_class)),
    inference(modus_ponens,[status(thm)],[5,4]) ).

tff(7,plain,
    ^ [Y: $i,U: $i,X: $i] :
      refl(
        ( ( member(U,Y)
          | ~ member(U,X)
          | ~ subclass(X,Y) )
      <=> ( member(U,Y)
          | ~ member(U,X)
          | ~ subclass(X,Y) ) )),
    inference(bind,[status(th)],]) ).

tff(8,plain,
    ( ! [Y: $i,U: $i,X: $i] :
        ( member(U,Y)
        | ~ member(U,X)
        | ~ subclass(X,Y) )
  <=> ! [Y: $i,U: $i,X: $i] :
        ( member(U,Y)
        | ~ member(U,X)
        | ~ subclass(X,Y) ) ),
    inference(quant_intro,[status(thm)],[7]) ).

tff(9,plain,
    ( ! [Y: $i,U: $i,X: $i] :
        ( member(U,Y)
        | ~ member(U,X)
        | ~ subclass(X,Y) )
  <=> ! [Y: $i,U: $i,X: $i] :
        ( member(U,Y)
        | ~ member(U,X)
        | ~ subclass(X,Y) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(10,plain,
    ^ [Y: $i,U: $i,X: $i] :
      trans(
        monotonicity(
          rewrite(
            ( ( ~ subclass(X,Y)
              | ~ member(U,X) )
          <=> ( ~ member(U,X)
              | ~ subclass(X,Y) ) )),
          ( ( ~ subclass(X,Y)
            | ~ member(U,X)
            | member(U,Y) )
        <=> ( ~ member(U,X)
            | ~ subclass(X,Y)
            | member(U,Y) ) )),
        rewrite(
          ( ( ~ member(U,X)
            | ~ subclass(X,Y)
            | member(U,Y) )
        <=> ( member(U,Y)
            | ~ member(U,X)
            | ~ subclass(X,Y) ) )),
        ( ( ~ subclass(X,Y)
          | ~ member(U,X)
          | member(U,Y) )
      <=> ( member(U,Y)
          | ~ member(U,X)
          | ~ subclass(X,Y) ) )),
    inference(bind,[status(th)],]) ).

tff(11,plain,
    ( ! [Y: $i,U: $i,X: $i] :
        ( ~ subclass(X,Y)
        | ~ member(U,X)
        | member(U,Y) )
  <=> ! [Y: $i,U: $i,X: $i] :
        ( member(U,Y)
        | ~ member(U,X)
        | ~ subclass(X,Y) ) ),
    inference(quant_intro,[status(thm)],[10]) ).

tff(12,axiom,
    ! [Y: $i,U: $i,X: $i] :
      ( ~ subclass(X,Y)
      | ~ member(U,X)
      | member(U,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

tff(13,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( member(U,Y)
      | ~ member(U,X)
      | ~ subclass(X,Y) ),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( member(U,Y)
      | ~ member(U,X)
      | ~ subclass(X,Y) ),
    inference(modus_ponens,[status(thm)],[13,9]) ).

tff(15,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( member(U,Y)
      | ~ member(U,X)
      | ~ subclass(X,Y) ),
    inference(skolemize,[status(sab)],[14]) ).

tff(16,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( member(U,Y)
      | ~ member(U,X)
      | ~ subclass(X,Y) ),
    inference(modus_ponens,[status(thm)],[15,8]) ).

tff(17,plain,
    ( ( ~ ! [Y: $i,U: $i,X: $i] :
            ( member(U,Y)
            | ~ member(U,X)
            | ~ subclass(X,Y) )
      | member(x,universal_class)
      | ~ member(x,cross_product(universal_class,universal_class))
      | ~ subclass(cross_product(universal_class,universal_class),universal_class) )
  <=> ( ~ ! [Y: $i,U: $i,X: $i] :
            ( member(U,Y)
            | ~ member(U,X)
            | ~ subclass(X,Y) )
      | member(x,universal_class)
      | ~ member(x,cross_product(universal_class,universal_class))
      | ~ subclass(cross_product(universal_class,universal_class),universal_class) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(18,plain,
    ( ~ ! [Y: $i,U: $i,X: $i] :
          ( member(U,Y)
          | ~ member(U,X)
          | ~ subclass(X,Y) )
    | member(x,universal_class)
    | ~ member(x,cross_product(universal_class,universal_class))
    | ~ subclass(cross_product(universal_class,universal_class),universal_class) ),
    inference(quant_inst,[status(thm)],]) ).

tff(19,plain,
    ( ~ ! [Y: $i,U: $i,X: $i] :
          ( member(U,Y)
          | ~ member(U,X)
          | ~ subclass(X,Y) )
    | member(x,universal_class)
    | ~ member(x,cross_product(universal_class,universal_class))
    | ~ subclass(cross_product(universal_class,universal_class),universal_class) ),
    inference(modus_ponens,[status(thm)],[18,17]) ).

tff(20,plain,
    ~ subclass(cross_product(universal_class,universal_class),universal_class),
    inference(unit_resolution,[status(thm)],[19,16,6,3]) ).

tff(21,plain,
    ^ [X: $i] :
      refl(
        ( subclass(X,universal_class)
      <=> subclass(X,universal_class) )),
    inference(bind,[status(th)],]) ).

tff(22,plain,
    ( ! [X: $i] : subclass(X,universal_class)
  <=> ! [X: $i] : subclass(X,universal_class) ),
    inference(quant_intro,[status(thm)],[21]) ).

tff(23,plain,
    ( ! [X: $i] : subclass(X,universal_class)
  <=> ! [X: $i] : subclass(X,universal_class) ),
    inference(rewrite,[status(thm)],]) ).

tff(24,axiom,
    ! [X: $i] : subclass(X,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

tff(25,plain,
    ! [X: $i] : subclass(X,universal_class),
    inference(modus_ponens,[status(thm)],[24,23]) ).

tff(26,plain,
    ! [X: $i] : subclass(X,universal_class),
    inference(skolemize,[status(sab)],[25]) ).

tff(27,plain,
    ! [X: $i] : subclass(X,universal_class),
    inference(modus_ponens,[status(thm)],[26,22]) ).

tff(28,plain,
    ( ~ ! [X: $i] : subclass(X,universal_class)
    | subclass(cross_product(universal_class,universal_class),universal_class) ),
    inference(quant_inst,[status(thm)],]) ).

tff(29,plain,
    $false,
    inference(unit_resolution,[status(thm)],[28,27,20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET118-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.06/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Sat Sep  3 02:34:17 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35  Usage: tptp [options] [-file:]file
% 0.14/0.35    -h, -?       prints this message.
% 0.14/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.14/0.35    -m, -model   generate model.
% 0.14/0.35    -p, -proof   generate proof.
% 0.14/0.35    -c, -core    generate unsat core of named formulas.
% 0.14/0.35    -st, -statistics display statistics.
% 0.14/0.35    -t:timeout   set timeout (in second).
% 0.14/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.14/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35    -<param>:<value> configuration parameter and value.
% 0.14/0.35    -o:<output-file> file to place output in.
% 0.21/0.45  % SZS status Unsatisfiable
% 0.21/0.45  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------