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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SET116-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:45 EDT 2022

% Result   : Unsatisfiable 0.19s 0.42s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   24 (   7 unt;   4 typ;   0 def)
%            Number of atoms       :   57 (  54 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   47 (  12   ~;  27   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of FOOLs       :    2 (   2 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    4 (   3   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   17 (  15   !;   0   ?;  17   :)

% Comments : 
%------------------------------------------------------------------------------
tff(x_type,type,
    x: $i ).

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

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

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

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

tff(2,axiom,
    second(x) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_2nd_in_pair_of_non_sets) ).

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

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

tff(5,axiom,
    ordered_pair(first(x),second(x)) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets4_1) ).

tff(6,plain,
    ordered_pair(first(x),second(x)) != x,
    inference(modus_ponens,[status(thm)],[5,4]) ).

tff(7,plain,
    ^ [X: $i] :
      refl(
        ( ( ( second(X) = X )
          | ( ordered_pair(first(X),second(X)) = X ) )
      <=> ( ( second(X) = X )
          | ( ordered_pair(first(X),second(X)) = X ) ) )),
    inference(bind,[status(th)],]) ).

tff(8,plain,
    ( ! [X: $i] :
        ( ( second(X) = X )
        | ( ordered_pair(first(X),second(X)) = X ) )
  <=> ! [X: $i] :
        ( ( second(X) = X )
        | ( ordered_pair(first(X),second(X)) = X ) ) ),
    inference(quant_intro,[status(thm)],[7]) ).

tff(9,plain,
    ( ! [X: $i] :
        ( ( second(X) = X )
        | ( ordered_pair(first(X),second(X)) = X ) )
  <=> ! [X: $i] :
        ( ( second(X) = X )
        | ( ordered_pair(first(X),second(X)) = X ) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(10,plain,
    ^ [X: $i] :
      rewrite(
        ( ( ( ordered_pair(first(X),second(X)) = X )
          | ( second(X) = X ) )
      <=> ( ( second(X) = X )
          | ( ordered_pair(first(X),second(X)) = X ) ) )),
    inference(bind,[status(th)],]) ).

tff(11,plain,
    ( ! [X: $i] :
        ( ( ordered_pair(first(X),second(X)) = X )
        | ( second(X) = X ) )
  <=> ! [X: $i] :
        ( ( second(X) = X )
        | ( ordered_pair(first(X),second(X)) = X ) ) ),
    inference(quant_intro,[status(thm)],[10]) ).

tff(12,axiom,
    ! [X: $i] :
      ( ( ordered_pair(first(X),second(X)) = X )
      | ( second(X) = X ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_1st_and_2nd_5) ).

tff(13,plain,
    ! [X: $i] :
      ( ( second(X) = X )
      | ( ordered_pair(first(X),second(X)) = X ) ),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    ! [X: $i] :
      ( ( second(X) = X )
      | ( ordered_pair(first(X),second(X)) = X ) ),
    inference(modus_ponens,[status(thm)],[13,9]) ).

tff(15,plain,
    ! [X: $i] :
      ( ( second(X) = X )
      | ( ordered_pair(first(X),second(X)) = X ) ),
    inference(skolemize,[status(sab)],[14]) ).

tff(16,plain,
    ! [X: $i] :
      ( ( second(X) = X )
      | ( ordered_pair(first(X),second(X)) = X ) ),
    inference(modus_ponens,[status(thm)],[15,8]) ).

tff(17,plain,
    ( ( ~ ! [X: $i] :
            ( ( second(X) = X )
            | ( ordered_pair(first(X),second(X)) = X ) )
      | ( second(x) = x )
      | ( ordered_pair(first(x),second(x)) = x ) )
  <=> ( ~ ! [X: $i] :
            ( ( second(X) = X )
            | ( ordered_pair(first(X),second(X)) = X ) )
      | ( second(x) = x )
      | ( ordered_pair(first(x),second(x)) = x ) ) ),
    inference(rewrite,[status(thm)],]) ).

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

tff(19,plain,
    ( ~ ! [X: $i] :
          ( ( second(X) = X )
          | ( ordered_pair(first(X),second(X)) = X ) )
    | ( second(x) = x )
    | ( ordered_pair(first(x),second(x)) = x ) ),
    inference(modus_ponens,[status(thm)],[18,17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET116-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.12/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n013.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 : Sat Sep  3 02:33:02 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35  Usage: tptp [options] [-file:]file
% 0.13/0.35    -h, -?       prints this message.
% 0.13/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.35    -m, -model   generate model.
% 0.13/0.35    -p, -proof   generate proof.
% 0.13/0.35    -c, -core    generate unsat core of named formulas.
% 0.13/0.35    -st, -statistics display statistics.
% 0.13/0.35    -t:timeout   set timeout (in second).
% 0.13/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35    -<param>:<value> configuration parameter and value.
% 0.13/0.35    -o:<output-file> file to place output in.
% 0.19/0.42  % SZS status Unsatisfiable
% 0.19/0.42  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------