TSTP Solution File: SYN080-1 by Z3---4.8.9.0

View Problem - Process Solution

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

% Computer : n027.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 : Thu Sep 29 23:53:38 EDT 2022

% Result   : Unsatisfiable 0.22s 0.40s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   24 (  11 unt;   4 typ;   0 def)
%            Number of atoms       :   31 (  29 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (   6   ~;   2   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   22 (  20   !;   0   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f_type,type,
    f: $i > $i ).

tff(g_type,type,
    g: $i > $i ).

tff(b_type,type,
    b: $i ).

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

tff(1,plain,
    ( ( g(b) = f(g(b)) )
  <=> ( f(g(b)) = g(b) ) ),
    inference(commutativity,[status(thm)],]) ).

tff(2,plain,
    ^ [Y: $i,X: $i] :
      refl(
        ( ( f(X) = g(Y) )
      <=> ( f(X) = g(Y) ) )),
    inference(bind,[status(th)],]) ).

tff(3,plain,
    ( ! [Y: $i,X: $i] : ( f(X) = g(Y) )
  <=> ! [Y: $i,X: $i] : ( f(X) = g(Y) ) ),
    inference(quant_intro,[status(thm)],[2]) ).

tff(4,plain,
    ( ! [Y: $i,X: $i] : ( f(X) = g(Y) )
  <=> ! [Y: $i,X: $i] : ( f(X) = g(Y) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(5,axiom,
    ! [Y: $i,X: $i] : ( f(X) = g(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

tff(6,plain,
    ! [Y: $i,X: $i] : ( f(X) = g(Y) ),
    inference(modus_ponens,[status(thm)],[5,4]) ).

tff(7,plain,
    ! [Y: $i,X: $i] : ( f(X) = g(Y) ),
    inference(skolemize,[status(sab)],[6]) ).

tff(8,plain,
    ! [Y: $i,X: $i] : ( f(X) = g(Y) ),
    inference(modus_ponens,[status(thm)],[7,3]) ).

tff(9,plain,
    ( ~ ! [Y: $i,X: $i] : ( f(X) = g(Y) )
    | ( f(f(a)) = g(b) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(10,plain,
    f(f(a)) = g(b),
    inference(unit_resolution,[status(thm)],[9,8]) ).

tff(11,plain,
    ( ( f(f(a)) = f(g(b)) )
  <=> ( g(b) = f(g(b)) ) ),
    inference(monotonicity,[status(thm)],[10]) ).

tff(12,plain,
    ( ( f(f(a)) = f(g(b)) )
  <=> ( f(g(b)) = g(b) ) ),
    inference(transitivity,[status(thm)],[11,1]) ).

tff(13,plain,
    ( ( f(g(b)) = g(b) )
  <=> ( f(f(a)) = f(g(b)) ) ),
    inference(symmetry,[status(thm)],[12]) ).

tff(14,plain,
    ( ~ ! [Y: $i,X: $i] : ( f(X) = g(Y) )
    | ( f(g(b)) = g(b) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(15,plain,
    f(g(b)) = g(b),
    inference(unit_resolution,[status(thm)],[14,8]) ).

tff(16,plain,
    f(f(a)) = f(g(b)),
    inference(modus_ponens,[status(thm)],[15,13]) ).

tff(17,plain,
    ( ( f(f(a)) != f(g(b)) )
  <=> ( f(f(a)) != f(g(b)) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(18,axiom,
    f(f(a)) != f(g(b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(19,plain,
    f(f(a)) != f(g(b)),
    inference(modus_ponens,[status(thm)],[18,17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13  % Problem  : SYN080-1 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Sep  5 01:54:52 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.36  Usage: tptp [options] [-file:]file
% 0.14/0.36    -h, -?       prints this message.
% 0.14/0.36    -smt2        print SMT-LIB2 benchmark.
% 0.14/0.36    -m, -model   generate model.
% 0.14/0.36    -p, -proof   generate proof.
% 0.14/0.36    -c, -core    generate unsat core of named formulas.
% 0.14/0.36    -st, -statistics display statistics.
% 0.14/0.36    -t:timeout   set timeout (in second).
% 0.14/0.36    -smt2status  display status in smt2 format instead of SZS.
% 0.14/0.36    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.36    -<param>:<value> configuration parameter and value.
% 0.14/0.36    -o:<output-file> file to place output in.
% 0.22/0.40  % SZS status Unsatisfiable
% 0.22/0.40  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------