TSTP Solution File: ARI167_1 by Z3---4.8.9.0

View Problem - Process Solution

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

% Computer : n009.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:47 EDT 2022

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

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

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

tff(3,plain,
    ( $lesseq(24,-112)
  <=> $false ),
    inference(rewrite,[status(thm)],]) ).

tff(4,plain,
    ( ~ $lesseq(24,-112)
  <=> ~ $false ),
    inference(monotonicity,[status(thm)],[3]) ).

tff(5,plain,
    ( ~ $lesseq(24,-112)
  <=> $true ),
    inference(transitivity,[status(thm)],[4,2]) ).

tff(6,plain,
    ( $less(-112,24)
  <=> ~ $lesseq(24,-112) ),
    inference(rewrite,[status(thm)],]) ).

tff(7,plain,
    $sum(-3,27) = 24,
    inference(rewrite,[status(thm)],]) ).

tff(8,plain,
    $uminus(3) = -3,
    inference(rewrite,[status(thm)],]) ).

tff(9,plain,
    $sum($uminus(3),27) = $sum(-3,27),
    inference(monotonicity,[status(thm)],[8]) ).

tff(10,plain,
    $sum($uminus(3),27) = 24,
    inference(transitivity,[status(thm)],[9,7]) ).

tff(11,plain,
    $product(-4,28) = -112,
    inference(rewrite,[status(thm)],]) ).

tff(12,plain,
    $sum(127,-99) = 28,
    inference(rewrite,[status(thm)],]) ).

tff(13,plain,
    $product(-1,99) = -99,
    inference(rewrite,[status(thm)],]) ).

tff(14,plain,
    $sum(127,$product(-1,99)) = $sum(127,-99),
    inference(monotonicity,[status(thm)],[13]) ).

tff(15,plain,
    $sum(127,$product(-1,99)) = 28,
    inference(transitivity,[status(thm)],[14,12]) ).

tff(16,plain,
    $difference(127,99) = $sum(127,$product(-1,99)),
    inference(rewrite,[status(thm)],]) ).

tff(17,plain,
    $difference(127,99) = 28,
    inference(transitivity,[status(thm)],[16,15]) ).

tff(18,plain,
    $product(-4,$difference(127,99)) = $product(-4,28),
    inference(monotonicity,[status(thm)],[17]) ).

tff(19,plain,
    $product(-4,$difference(127,99)) = -112,
    inference(transitivity,[status(thm)],[18,11]) ).

tff(20,plain,
    ( $less($product(-4,$difference(127,99)),$sum($uminus(3),27))
  <=> $less(-112,24) ),
    inference(monotonicity,[status(thm)],[19,10]) ).

tff(21,plain,
    ( $less($product(-4,$difference(127,99)),$sum($uminus(3),27))
  <=> ~ $lesseq(24,-112) ),
    inference(transitivity,[status(thm)],[20,6]) ).

tff(22,plain,
    ( $less($product(-4,$difference(127,99)),$sum($uminus(3),27))
  <=> $true ),
    inference(transitivity,[status(thm)],[21,5]) ).

tff(23,plain,
    ( ~ $less($product(-4,$difference(127,99)),$sum($uminus(3),27))
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[22]) ).

tff(24,plain,
    ( ~ $less($product(-4,$difference(127,99)),$sum($uminus(3),27))
  <=> $false ),
    inference(transitivity,[status(thm)],[23,1]) ).

tff(25,axiom,
    ~ $less($product(-4,$difference(127,99)),$sum($uminus(3),27)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complex2) ).

tff(26,plain,
    $false,
    inference(modus_ponens,[status(thm)],[25,24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ARI167_1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n009.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 : Mon Aug 29 22:08:20 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.13/0.40  % SZS status Theorem
% 0.13/0.40  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------