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

% Computer : n029.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:00:30 EDT 2022

% Result   : Theorem 0.21s 0.39s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :    9 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (   8 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   0   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   28 (   0 atm;   6 fun;  22 num;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   0 usr;   3 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(1,plain,
    ( ~ $true
  <=> $false ),
    inference(rewrite,[status(thm)],]) ).

tff(2,plain,
    ( ( 3 = 3 )
  <=> $true ),
    inference(rewrite,[status(thm)],]) ).

tff(3,plain,
    $sum(5,-2) = 3,
    inference(rewrite,[status(thm)],]) ).

tff(4,plain,
    ( ( $sum(5,-2) = 3 )
  <=> ( 3 = 3 ) ),
    inference(monotonicity,[status(thm)],[3]) ).

tff(5,plain,
    ( ( $sum(5,-2) = 3 )
  <=> $true ),
    inference(transitivity,[status(thm)],[4,2]) ).

tff(6,plain,
    ( ( $sum(5,-2) != 3 )
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[5]) ).

tff(7,plain,
    ( ( $sum(5,-2) != 3 )
  <=> $false ),
    inference(transitivity,[status(thm)],[6,1]) ).

tff(8,axiom,
    $sum(5,-2) != 3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_5_n2_3) ).

tff(9,plain,
    $false,
    inference(modus_ponens,[status(thm)],[8,7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : ARI068_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.14  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35  % Computer : n029.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 Aug 29 21:43:11 EDT 2022
% 0.14/0.35  % 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 Theorem
% 0.21/0.39  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------