↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SET085-6 : TPTP v9.0.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n012.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 : Sat Jun 21 05:25:10 AM UTC 2025

% Result   : Unsatisfiable 0.21s 0.41s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   52 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :  148 (  73 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  151 (  59   ~;  73   |;   0   &)
%                                         (  19 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :    4 (   4 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   87 (  78   !;   0   ?;  87   :)

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

tff(unordered_pair_type,type,
    unordered_pair: ( $i * $i ) > $i ).

tff(z_type,type,
    z: $i ).

tff(y_type,type,
    y: $i ).

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

tff(singleton_type,type,
    singleton: $i > $i ).

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

tff(1,plain,
    ^ [X: $i] :
      refl(( ( unordered_pair(X,X) = singleton(X) )
      <=> ( unordered_pair(X,X) = singleton(X) ) )),
    inference(bind,[status(th)],[]) ).

tff(2,plain,
    ( ! [X: $i] : ( unordered_pair(X,X) = singleton(X) )
  <=> ! [X: $i] : ( unordered_pair(X,X) = singleton(X) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [X: $i] : ( unordered_pair(X,X) = singleton(X) )
  <=> ! [X: $i] : ( unordered_pair(X,X) = singleton(X) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(4,axiom,
    ! [X: $i] : ( unordered_pair(X,X) = singleton(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).

tff(5,plain,
    ! [X: $i] : ( unordered_pair(X,X) = singleton(X) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [X: $i] : ( unordered_pair(X,X) = singleton(X) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [X: $i] : ( unordered_pair(X,X) = singleton(X) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( ~ ! [X: $i] : ( unordered_pair(X,X) = singleton(X) )
    | ( unordered_pair(x,x) = singleton(x) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(9,plain,
    unordered_pair(x,x) = singleton(x),
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    singleton(x) = unordered_pair(x,x),
    inference(symmetry,[status(thm)],[9]) ).

tff(11,plain,
    ( ( unordered_pair(y,z) = singleton(x) )
  <=> ( unordered_pair(y,z) = singleton(x) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(12,axiom,
    unordered_pair(y,z) = singleton(x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).

tff(13,plain,
    unordered_pair(y,z) = singleton(x),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    unordered_pair(y,z) = unordered_pair(x,x),
    inference(transitivity,[status(thm)],[13,10]) ).

tff(15,plain,
    ( member(x,unordered_pair(y,z))
  <=> member(x,unordered_pair(x,x)) ),
    inference(monotonicity,[status(thm)],[14]) ).

tff(16,plain,
    ( member(x,unordered_pair(x,x))
  <=> member(x,unordered_pair(y,z)) ),
    inference(symmetry,[status(thm)],[15]) ).

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

tff(18,axiom,
    member(x,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).

tff(19,plain,
    member(x,universal_class),
    inference(modus_ponens,[status(thm)],[18,17]) ).

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

tff(21,plain,
    ( ! [Y: $i,X: $i] :
        ( ~ member(X,universal_class)
        | member(X,unordered_pair(X,Y)) )
  <=> ! [Y: $i,X: $i] :
        ( ~ member(X,universal_class)
        | member(X,unordered_pair(X,Y)) ) ),
    inference(quant_intro,[status(thm)],[20]) ).

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

tff(23,axiom,
    ! [Y: $i,X: $i] :
      ( ~ member(X,universal_class)
      | member(X,unordered_pair(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).

tff(24,plain,
    ! [Y: $i,X: $i] :
      ( ~ member(X,universal_class)
      | member(X,unordered_pair(X,Y)) ),
    inference(modus_ponens,[status(thm)],[23,22]) ).

tff(25,plain,
    ! [Y: $i,X: $i] :
      ( ~ member(X,universal_class)
      | member(X,unordered_pair(X,Y)) ),
    inference(skolemize,[status(sab)],[24]) ).

tff(26,plain,
    ! [Y: $i,X: $i] :
      ( ~ member(X,universal_class)
      | member(X,unordered_pair(X,Y)) ),
    inference(modus_ponens,[status(thm)],[25,21]) ).

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

tff(28,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( ~ member(X,universal_class)
          | member(X,unordered_pair(X,Y)) )
    | ~ member(x,universal_class)
    | member(x,unordered_pair(x,x)) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(29,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( ~ member(X,universal_class)
          | member(X,unordered_pair(X,Y)) )
    | ~ member(x,universal_class)
    | member(x,unordered_pair(x,x)) ),
    inference(modus_ponens,[status(thm)],[28,27]) ).

tff(30,plain,
    member(x,unordered_pair(x,x)),
    inference(unit_resolution,[status(thm)],[29,26,19]) ).

tff(31,plain,
    member(x,unordered_pair(y,z)),
    inference(modus_ponens,[status(thm)],[30,16]) ).

tff(32,plain,
    ( ( x != z )
  <=> ( x != z ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(33,axiom,
    x != z,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).

tff(34,plain,
    x != z,
    inference(modus_ponens,[status(thm)],[33,32]) ).

tff(35,plain,
    ( ( x != y )
  <=> ( x != y ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(36,axiom,
    x != y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).

tff(37,plain,
    x != y,
    inference(modus_ponens,[status(thm)],[36,35]) ).

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

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

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

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

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

tff(43,axiom,
    ! [Y: $i,U: $i,X: $i] :
      ( ~ member(U,unordered_pair(X,Y))
      | ( U = X )
      | ( U = Y ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).

tff(44,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( ( U = Y )
      | ( U = X )
      | ~ member(U,unordered_pair(X,Y)) ),
    inference(modus_ponens,[status(thm)],[43,42]) ).

tff(45,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( ( U = Y )
      | ( U = X )
      | ~ member(U,unordered_pair(X,Y)) ),
    inference(modus_ponens,[status(thm)],[44,40]) ).

tff(46,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( ( U = Y )
      | ( U = X )
      | ~ member(U,unordered_pair(X,Y)) ),
    inference(skolemize,[status(sab)],[45]) ).

tff(47,plain,
    ! [Y: $i,U: $i,X: $i] :
      ( ( U = Y )
      | ( U = X )
      | ~ member(U,unordered_pair(X,Y)) ),
    inference(modus_ponens,[status(thm)],[46,39]) ).

tff(48,plain,
    ( ( ~ ! [Y: $i,U: $i,X: $i] :
            ( ( U = Y )
            | ( U = X )
            | ~ member(U,unordered_pair(X,Y)) )
      | ( x = z )
      | ( x = y )
      | ~ member(x,unordered_pair(y,z)) )
  <=> ( ~ ! [Y: $i,U: $i,X: $i] :
            ( ( U = Y )
            | ( U = X )
            | ~ member(U,unordered_pair(X,Y)) )
      | ( x = z )
      | ( x = y )
      | ~ member(x,unordered_pair(y,z)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(49,plain,
    ( ~ ! [Y: $i,U: $i,X: $i] :
          ( ( U = Y )
          | ( U = X )
          | ~ member(U,unordered_pair(X,Y)) )
    | ( x = z )
    | ( x = y )
    | ~ member(x,unordered_pair(y,z)) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(50,plain,
    ( ~ ! [Y: $i,U: $i,X: $i] :
          ( ( U = Y )
          | ( U = X )
          | ~ member(U,unordered_pair(X,Y)) )
    | ( x = z )
    | ( x = y )
    | ~ member(x,unordered_pair(y,z)) ),
    inference(modus_ponens,[status(thm)],[49,48]) ).

tff(51,plain,
    ~ member(x,unordered_pair(y,z)),
    inference(unit_resolution,[status(thm)],[50,47,37,34]) ).

tff(52,plain,
    $false,
    inference(unit_resolution,[status(thm)],[51,31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : SET085-6 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n012.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   : Fri Jun 20 04:13:10 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 0.21/0.41  % SZS status Unsatisfiable
% 0.21/0.41  % SZS output start Proof
% See solution above
% 0.21/0.42  % E exiting
%------------------------------------------------------------------------------