TSTP Solution File: CAT012-3 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : CAT012-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n026.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  6 17:29:45 EDT 2022

% Result   : Unsatisfiable 0.21s 0.39s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   25
% Syntax   : Number of formulae    :   53 (  17 unt;   5 typ;   0 def)
%            Number of atoms       :  123 (  43 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  129 (  58   ~;  51   |;   0   &)
%                                         (  20 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of FOOLs       :    4 (   4 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   4   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   53 (  48   !;   0   ?;  53   :)

% Comments : 
%------------------------------------------------------------------------------
tff(there_exists_type,type,
    there_exists: $i > $o ).

tff(compose_type,type,
    compose: ( $i * $i ) > $i ).

tff(domain_type,type,
    domain: $i > $i ).

tff(a_type,type,
    a: $i ).

tff(codomain_type,type,
    codomain: $i > $i ).

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

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

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

tff(4,axiom,
    ! [X: $i] : ( compose(X,domain(X)) = X ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).

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

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

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

tff(8,plain,
    ( ~ ! [X: $i] : ( compose(X,domain(X)) = X )
    | ( compose(a,domain(a)) = a ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(9,plain,
    compose(a,domain(a)) = a,
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    ( there_exists(compose(a,domain(a)))
  <=> there_exists(a) ),
    inference(monotonicity,[status(thm)],[9]) ).

tff(11,plain,
    ( there_exists(a)
  <=> there_exists(compose(a,domain(a))) ),
    inference(symmetry,[status(thm)],[10]) ).

tff(12,plain,
    ( there_exists(domain(a))
  <=> there_exists(domain(a)) ),
    inference(rewrite,[status(thm)],]) ).

tff(13,axiom,
    there_exists(domain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_domain_exists) ).

tff(14,plain,
    there_exists(domain(a)),
    inference(modus_ponens,[status(thm)],[13,12]) ).

tff(15,plain,
    ^ [X: $i] :
      refl(
        ( ( there_exists(X)
          | ~ there_exists(domain(X)) )
      <=> ( there_exists(X)
          | ~ there_exists(domain(X)) ) )),
    inference(bind,[status(th)],]) ).

tff(16,plain,
    ( ! [X: $i] :
        ( there_exists(X)
        | ~ there_exists(domain(X)) )
  <=> ! [X: $i] :
        ( there_exists(X)
        | ~ there_exists(domain(X)) ) ),
    inference(quant_intro,[status(thm)],[15]) ).

tff(17,plain,
    ( ! [X: $i] :
        ( there_exists(X)
        | ~ there_exists(domain(X)) )
  <=> ! [X: $i] :
        ( there_exists(X)
        | ~ there_exists(domain(X)) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(18,plain,
    ^ [X: $i] :
      rewrite(
        ( ( ~ there_exists(domain(X))
          | there_exists(X) )
      <=> ( there_exists(X)
          | ~ there_exists(domain(X)) ) )),
    inference(bind,[status(th)],]) ).

tff(19,plain,
    ( ! [X: $i] :
        ( ~ there_exists(domain(X))
        | there_exists(X) )
  <=> ! [X: $i] :
        ( there_exists(X)
        | ~ there_exists(domain(X)) ) ),
    inference(quant_intro,[status(thm)],[18]) ).

tff(20,axiom,
    ! [X: $i] :
      ( ~ there_exists(domain(X))
      | there_exists(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_has_elements) ).

tff(21,plain,
    ! [X: $i] :
      ( there_exists(X)
      | ~ there_exists(domain(X)) ),
    inference(modus_ponens,[status(thm)],[20,19]) ).

tff(22,plain,
    ! [X: $i] :
      ( there_exists(X)
      | ~ there_exists(domain(X)) ),
    inference(modus_ponens,[status(thm)],[21,17]) ).

tff(23,plain,
    ! [X: $i] :
      ( there_exists(X)
      | ~ there_exists(domain(X)) ),
    inference(skolemize,[status(sab)],[22]) ).

tff(24,plain,
    ! [X: $i] :
      ( there_exists(X)
      | ~ there_exists(domain(X)) ),
    inference(modus_ponens,[status(thm)],[23,16]) ).

tff(25,plain,
    ( ( ~ ! [X: $i] :
            ( there_exists(X)
            | ~ there_exists(domain(X)) )
      | there_exists(a)
      | ~ there_exists(domain(a)) )
  <=> ( ~ ! [X: $i] :
            ( there_exists(X)
            | ~ there_exists(domain(X)) )
      | there_exists(a)
      | ~ there_exists(domain(a)) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(26,plain,
    ( ~ ! [X: $i] :
          ( there_exists(X)
          | ~ there_exists(domain(X)) )
    | there_exists(a)
    | ~ there_exists(domain(a)) ),
    inference(quant_inst,[status(thm)],]) ).

tff(27,plain,
    ( ~ ! [X: $i] :
          ( there_exists(X)
          | ~ there_exists(domain(X)) )
    | there_exists(a)
    | ~ there_exists(domain(a)) ),
    inference(modus_ponens,[status(thm)],[26,25]) ).

tff(28,plain,
    there_exists(a),
    inference(unit_resolution,[status(thm)],[27,24,14]) ).

tff(29,plain,
    there_exists(compose(a,domain(a))),
    inference(modus_ponens,[status(thm)],[28,11]) ).

tff(30,plain,
    ( ( domain(a) = codomain(domain(a)) )
  <=> ( codomain(domain(a)) = domain(a) ) ),
    inference(commutativity,[status(thm)],]) ).

tff(31,plain,
    ( ( codomain(domain(a)) = domain(a) )
  <=> ( domain(a) = codomain(domain(a)) ) ),
    inference(symmetry,[status(thm)],[30]) ).

tff(32,plain,
    ( ( codomain(domain(a)) != domain(a) )
  <=> ( domain(a) != codomain(domain(a)) ) ),
    inference(monotonicity,[status(thm)],[31]) ).

tff(33,plain,
    ( ( codomain(domain(a)) != domain(a) )
  <=> ( codomain(domain(a)) != domain(a) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(34,axiom,
    codomain(domain(a)) != domain(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_domain_is_domain) ).

tff(35,plain,
    codomain(domain(a)) != domain(a),
    inference(modus_ponens,[status(thm)],[34,33]) ).

tff(36,plain,
    domain(a) != codomain(domain(a)),
    inference(modus_ponens,[status(thm)],[35,32]) ).

tff(37,plain,
    ^ [Y: $i,X: $i] :
      refl(
        ( ( ~ there_exists(compose(X,Y))
          | ( domain(X) = codomain(Y) ) )
      <=> ( ~ there_exists(compose(X,Y))
          | ( domain(X) = codomain(Y) ) ) )),
    inference(bind,[status(th)],]) ).

tff(38,plain,
    ( ! [Y: $i,X: $i] :
        ( ~ there_exists(compose(X,Y))
        | ( domain(X) = codomain(Y) ) )
  <=> ! [Y: $i,X: $i] :
        ( ~ there_exists(compose(X,Y))
        | ( domain(X) = codomain(Y) ) ) ),
    inference(quant_intro,[status(thm)],[37]) ).

tff(39,plain,
    ( ! [Y: $i,X: $i] :
        ( ~ there_exists(compose(X,Y))
        | ( domain(X) = codomain(Y) ) )
  <=> ! [Y: $i,X: $i] :
        ( ~ there_exists(compose(X,Y))
        | ( domain(X) = codomain(Y) ) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(40,axiom,
    ! [Y: $i,X: $i] :
      ( ~ there_exists(compose(X,Y))
      | ( domain(X) = codomain(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).

tff(41,plain,
    ! [Y: $i,X: $i] :
      ( ~ there_exists(compose(X,Y))
      | ( domain(X) = codomain(Y) ) ),
    inference(modus_ponens,[status(thm)],[40,39]) ).

tff(42,plain,
    ! [Y: $i,X: $i] :
      ( ~ there_exists(compose(X,Y))
      | ( domain(X) = codomain(Y) ) ),
    inference(skolemize,[status(sab)],[41]) ).

tff(43,plain,
    ! [Y: $i,X: $i] :
      ( ~ there_exists(compose(X,Y))
      | ( domain(X) = codomain(Y) ) ),
    inference(modus_ponens,[status(thm)],[42,38]) ).

tff(44,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( ~ there_exists(compose(X,Y))
            | ( domain(X) = codomain(Y) ) )
      | ~ there_exists(compose(a,domain(a)))
      | ( domain(a) = codomain(domain(a)) ) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( ~ there_exists(compose(X,Y))
            | ( domain(X) = codomain(Y) ) )
      | ~ there_exists(compose(a,domain(a)))
      | ( domain(a) = codomain(domain(a)) ) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(45,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( ~ there_exists(compose(X,Y))
          | ( domain(X) = codomain(Y) ) )
    | ~ there_exists(compose(a,domain(a)))
    | ( domain(a) = codomain(domain(a)) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(46,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( ~ there_exists(compose(X,Y))
          | ( domain(X) = codomain(Y) ) )
    | ~ there_exists(compose(a,domain(a)))
    | ( domain(a) = codomain(domain(a)) ) ),
    inference(modus_ponens,[status(thm)],[45,44]) ).

tff(47,plain,
    ( ~ there_exists(compose(a,domain(a)))
    | ( domain(a) = codomain(domain(a)) ) ),
    inference(unit_resolution,[status(thm)],[46,43]) ).

tff(48,plain,
    $false,
    inference(unit_resolution,[status(thm)],[47,36,29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : CAT012-3 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue Aug 30 06:31:36 EDT 2022
% 0.14/0.34  % 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.39  % SZS status Unsatisfiable
% 0.21/0.39  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------