↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n005.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:17 AM UTC 2025

% Result   : Unsatisfiable 0.17s 0.40s
% Output   : Proof 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   20 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (   4 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (   8   ~;   1   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of FOOLs       :    1 (   1 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (  18   !;   0   ?;  20   :)

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

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

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

tff(second_type,type,
    second: $i > $i ).

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

tff(first_type,type,
    first: $i > $i ).

tff(1,plain,
    ( ( ordered_pair(first(x),second(x)) = x )
  <=> ( ordered_pair(first(x),second(x)) = x ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(2,axiom,
    ordered_pair(first(x),second(x)) = x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_ordered_pairs_are_sets_1) ).

tff(3,plain,
    ordered_pair(first(x),second(x)) = x,
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,plain,
    ( member(ordered_pair(first(x),second(x)),universal_class)
  <=> member(x,universal_class) ),
    inference(monotonicity,[status(thm)],[3]) ).

tff(5,plain,
    ( member(x,universal_class)
  <=> member(ordered_pair(first(x),second(x)),universal_class) ),
    inference(symmetry,[status(thm)],[4]) ).

tff(6,plain,
    ( ~ member(x,universal_class)
  <=> ~ member(ordered_pair(first(x),second(x)),universal_class) ),
    inference(monotonicity,[status(thm)],[5]) ).

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

tff(8,axiom,
    ~ member(x,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_ordered_pairs_are_sets_2) ).

tff(9,plain,
    ~ member(x,universal_class),
    inference(modus_ponens,[status(thm)],[8,7]) ).

tff(10,plain,
    ~ member(ordered_pair(first(x),second(x)),universal_class),
    inference(modus_ponens,[status(thm)],[9,6]) ).

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

tff(12,plain,
    ( ! [Y: $i,X: $i] : member(ordered_pair(X,Y),universal_class)
  <=> ! [Y: $i,X: $i] : member(ordered_pair(X,Y),universal_class) ),
    inference(quant_intro,[status(thm)],[11]) ).

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

tff(14,axiom,
    ! [Y: $i,X: $i] : member(ordered_pair(X,Y),universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_is_set) ).

tff(15,plain,
    ! [Y: $i,X: $i] : member(ordered_pair(X,Y),universal_class),
    inference(modus_ponens,[status(thm)],[14,13]) ).

tff(16,plain,
    ! [Y: $i,X: $i] : member(ordered_pair(X,Y),universal_class),
    inference(skolemize,[status(sab)],[15]) ).

tff(17,plain,
    ! [Y: $i,X: $i] : member(ordered_pair(X,Y),universal_class),
    inference(modus_ponens,[status(thm)],[16,12]) ).

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

tff(19,plain,
    member(ordered_pair(first(x),second(x)),universal_class),
    inference(unit_resolution,[status(thm)],[18,17]) ).

tff(20,plain,
    $false,
    inference(unit_resolution,[status(thm)],[19,10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SET117-7 : TPTP v9.0.0. Bugfixed v7.3.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n005.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri Jun 20 04:20:50 EDT 2025
% 0.11/0.32  % CPUTime    : 
% 0.17/0.40  % SZS status Unsatisfiable
% 0.17/0.40  % SZS output start Proof
% See solution above
% 0.18/0.41  % E exiting
%------------------------------------------------------------------------------