TSTP Solution File: ARI663_1 by Z3---4.8.9.0

View Problem - Process Solution

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

% Computer : n028.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:02:30 EDT 2022

% Result   : Theorem 0.19s 0.37s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ARI663_1 : TPTP v8.1.0. Released v6.3.0.
% 0.03/0.12  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.33  % Computer : n028.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Tue Aug 30 01:37:33 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.33  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.33  Usage: tptp [options] [-file:]file
% 0.11/0.33    -h, -?       prints this message.
% 0.11/0.33    -smt2        print SMT-LIB2 benchmark.
% 0.11/0.33    -m, -model   generate model.
% 0.11/0.33    -p, -proof   generate proof.
% 0.11/0.33    -c, -core    generate unsat core of named formulas.
% 0.11/0.33    -st, -statistics display statistics.
% 0.11/0.33    -t:timeout   set timeout (in second).
% 0.11/0.33    -smt2status  display status in smt2 format instead of SZS.
% 0.11/0.33    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.33    -<param>:<value> configuration parameter and value.
% 0.11/0.33    -o:<output-file> file to place output in.
% 0.19/0.37  % SZS status Theorem
% 0.19/0.37  % SZS output start Proof
% 0.19/0.37  tff(a_type, type, (
% 0.19/0.37     a: $int)).
% 0.19/0.37  tff(b_type, type, (
% 0.19/0.37     b: $int)).
% 0.19/0.37  tff(1,assumption,(~$greatereq(a, -15)), introduced(assumption)).
% 0.19/0.37  tff(2,plain,
% 0.19/0.37      (($product(a, b) = 15) <=> ($product(a, b) = 15)),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(3,axiom,($product(a, b) = 15), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','conj')).
% 0.19/0.37  tff(4,plain,
% 0.19/0.37      ($product(a, b) = 15),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[3, 2])).
% 0.19/0.37  tff(5,plain,
% 0.19/0.37      ((~($product(a, b) = 15)) | $greatereq($product(a, b), 15)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(6,plain,
% 0.19/0.37      ($greatereq($product(a, b), 15)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[5, 4])).
% 0.19/0.37  tff(7,plain,
% 0.19/0.37      ((~$greatereq(b, 0)) | $greatereq(a, -15) | (~$greatereq($product(a, b), 15))),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(8,plain,
% 0.19/0.37      (~$greatereq(b, 0)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[7, 6, 1])).
% 0.19/0.37  tff(9,plain,
% 0.19/0.37      ((~($product(a, b) = 15)) | $lesseq($product(a, b), 15)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(10,plain,
% 0.19/0.37      ($lesseq($product(a, b), 15)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[9, 4])).
% 0.19/0.37  tff(11,plain,
% 0.19/0.37      ((~$lesseq($product(a, b), 15)) | $greatereq(a, -15) | $greatereq(b, 0)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(12,plain,
% 0.19/0.37      ($false),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[11, 10, 1, 8])).
% 0.19/0.37  tff(13,plain,($greatereq(a, -15)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.37  tff(14,assumption,(~$lesseq(a, 15)), introduced(assumption)).
% 0.19/0.37  tff(15,plain,
% 0.19/0.37      ((~$lesseq(b, 0)) | (~$greatereq($product(a, b), 15)) | $lesseq(a, 15)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(16,plain,
% 0.19/0.37      (~$lesseq(b, 0)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[15, 6, 14])).
% 0.19/0.37  tff(17,plain,
% 0.19/0.37      ((~$lesseq($product(a, b), 15)) | $lesseq(a, 15) | $lesseq(b, 0)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(18,plain,
% 0.19/0.37      ($false),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[17, 10, 14, 16])).
% 0.19/0.37  tff(19,plain,($lesseq(a, 15)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.37  tff(20,plain,
% 0.19/0.37      ((~(~((a = 0) | (~$greatereq(a, -15)) | (~$lesseq(a, 15))))) <=> ((a = 0) | (~$greatereq(a, -15)) | (~$lesseq(a, 15)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(21,plain,
% 0.19/0.37      (((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15)) <=> (~((a = 0) | (~$greatereq(a, -15)) | (~$lesseq(a, 15))))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(22,plain,
% 0.19/0.37      ((~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15))) <=> (~(~((a = 0) | (~$greatereq(a, -15)) | (~$lesseq(a, 15)))))),
% 0.19/0.37      inference(monotonicity,[status(thm)],[21])).
% 0.19/0.37  tff(23,plain,
% 0.19/0.37      ((~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15))) <=> ((a = 0) | (~$greatereq(a, -15)) | (~$lesseq(a, 15)))),
% 0.19/0.37      inference(transitivity,[status(thm)],[22, 20])).
% 0.19/0.37  tff(24,plain,
% 0.19/0.37      ((~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15))) <=> (~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(25,plain,
% 0.19/0.37      ((~(((~(a = 0)) & $greatereq(a, -15)) & $lesseq(a, 15))) <=> (~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(26,axiom,(~(((~(a = 0)) & $greatereq(a, -15)) & $lesseq(a, 15))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','conj_001')).
% 0.19/0.37  tff(27,plain,
% 0.19/0.37      (~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[26, 25])).
% 0.19/0.37  tff(28,plain,
% 0.19/0.37      (~((~(a = 0)) & $greatereq(a, -15) & $lesseq(a, 15))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[27, 24])).
% 0.19/0.37  tff(29,plain,
% 0.19/0.37      ((a = 0) | (~$greatereq(a, -15)) | (~$lesseq(a, 15))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[28, 23])).
% 0.19/0.37  tff(30,plain,
% 0.19/0.37      (a = 0),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[29, 19, 13])).
% 0.19/0.37  tff(31,plain,
% 0.19/0.37      ((~(a = 0)) | $greatereq(a, 0)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(32,plain,
% 0.19/0.37      ($greatereq(a, 0)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[31, 30])).
% 0.19/0.37  tff(33,plain,
% 0.19/0.37      ((~(a = 0)) | $lesseq(a, 0)),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(34,plain,
% 0.19/0.37      ($lesseq(a, 0)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[33, 30])).
% 0.19/0.37  tff(35,plain,
% 0.19/0.37      ((~$greatereq($product(a, b), 15)) | (~$lesseq(a, 0)) | (~$greatereq(a, 0))),
% 0.19/0.37      inference(theory_lemma,[status(thm)],[])).
% 0.19/0.37  tff(36,plain,
% 0.19/0.37      ($false),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[35, 6, 34, 32])).
% 0.19/0.37  % SZS output end Proof
%------------------------------------------------------------------------------