↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n002.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:24:53 AM UTC 2025

% Result   : Unsatisfiable 0.13s 0.42s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   26 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   40 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   21 (   9   ~;   2   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of FOOLs       :    2 (   2 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (  36   !;   0   ?;  40   :)

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

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

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

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

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

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

tff(ordered_pair_type,type,
    ordered_pair: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

tff(10,plain,
    ( member(unordered_pair(singleton(x),unordered_pair(x,singleton(y))),universal_class)
  <=> member(ordered_pair(x,y),universal_class) ),
    inference(monotonicity,[status(thm)],[9]) ).

tff(11,plain,
    ( member(ordered_pair(x,y),universal_class)
  <=> member(unordered_pair(singleton(x),unordered_pair(x,singleton(y))),universal_class) ),
    inference(symmetry,[status(thm)],[10]) ).

tff(12,plain,
    ( ~ member(ordered_pair(x,y),universal_class)
  <=> ~ member(unordered_pair(singleton(x),unordered_pair(x,singleton(y))),universal_class) ),
    inference(monotonicity,[status(thm)],[11]) ).

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

tff(14,axiom,
    ~ member(ordered_pair(x,y),universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordered_pair_is_set_1) ).

tff(15,plain,
    ~ member(ordered_pair(x,y),universal_class),
    inference(modus_ponens,[status(thm)],[14,13]) ).

tff(16,plain,
    ~ member(unordered_pair(singleton(x),unordered_pair(x,singleton(y))),universal_class),
    inference(modus_ponens,[status(thm)],[15,12]) ).

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

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

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

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

tff(21,plain,
    ! [Y: $i,X: $i] : member(unordered_pair(X,Y),universal_class),
    inference(modus_ponens,[status(thm)],[20,19]) ).

tff(22,plain,
    ! [Y: $i,X: $i] : member(unordered_pair(X,Y),universal_class),
    inference(skolemize,[status(sab)],[21]) ).

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

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

tff(25,plain,
    member(unordered_pair(singleton(x),unordered_pair(x,singleton(y))),universal_class),
    inference(unit_resolution,[status(thm)],[24,23]) ).

tff(26,plain,
    $false,
    inference(unit_resolution,[status(thm)],[25,16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET025-7 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n002.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Jun 20 04:04:46 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 0.13/0.42  % SZS status Unsatisfiable
% 0.13/0.42  % SZS output start Proof
% See solution above
% 0.21/0.43  % E exiting
%------------------------------------------------------------------------------