TSTP Solution File: ARI677_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : ARI677_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n010.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:34 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI677_1 : TPTP v8.1.0. Released v6.3.0.
% 0.13/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n010.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 : Tue Aug 30 01:29:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.20/0.35 Usage: tptp [options] [-file:]file
% 0.20/0.35 -h, -? prints this message.
% 0.20/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.20/0.35 -m, -model generate model.
% 0.20/0.35 -p, -proof generate proof.
% 0.20/0.35 -c, -core generate unsat core of named formulas.
% 0.20/0.35 -st, -statistics display statistics.
% 0.20/0.35 -t:timeout set timeout (in second).
% 0.20/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.20/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.20/0.35 -<param>:<value> configuration parameter and value.
% 0.20/0.35 -o:<output-file> file to place output in.
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 tff(a_type, type, (
% 0.20/0.39 a: $int)).
% 0.20/0.39 tff(1,assumption,($greatereq(a, 1)), introduced(assumption)).
% 0.20/0.39 tff(2,plain,
% 0.20/0.39 ($greatereq(0, $product(a, $product(a, a))) <=> $lesseq($product(a, $product(a, a)), 0)),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(3,plain,
% 0.20/0.39 ($greatereq(0, $product(a, $product(a, a))) <=> $greatereq(0, $product(a, $product(a, a)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(4,plain,
% 0.20/0.39 ($greatereq(0, $product($product(a, a), a)) <=> $greatereq(0, $product(a, $product(a, a)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(5,axiom,($greatereq(0, $product($product(a, a), a))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','conj')).
% 0.20/0.39 tff(6,plain,
% 0.20/0.39 ($greatereq(0, $product(a, $product(a, a)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.39 tff(7,plain,
% 0.20/0.39 ($greatereq(0, $product(a, $product(a, a)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[6, 3])).
% 0.20/0.39 tff(8,plain,
% 0.20/0.39 ($lesseq($product(a, $product(a, a)), 0)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[7, 2])).
% 0.20/0.39 tff(9,plain,
% 0.20/0.39 ((~$lesseq($product(a, $product(a, a)), 0)) | (~$greatereq(a, 1))),
% 0.20/0.39 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.39 tff(10,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[9, 8, 1])).
% 0.20/0.39 tff(11,plain,(~$greatereq(a, 1)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.39 tff(12,assumption,(~$lesseq($product(a, $product(a, $product(a, a))), 0)), introduced(assumption)).
% 0.20/0.39 tff(13,plain,
% 0.20/0.39 ($lesseq(0, a) <=> $greatereq(a, 0)),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(14,plain,
% 0.20/0.39 ($lesseq(0, a) <=> $lesseq(0, a)),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(15,axiom,($lesseq(0, a)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','conj_001')).
% 0.20/0.39 tff(16,plain,
% 0.20/0.39 ($lesseq(0, a)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.20/0.39 tff(17,plain,
% 0.20/0.39 ($greatereq(a, 0)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[16, 13])).
% 0.20/0.39 tff(18,plain,
% 0.20/0.39 ($greatereq(a, 1) | (~$greatereq(a, 0)) | $lesseq($product(a, $product(a, $product(a, a))), 0)),
% 0.20/0.39 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.39 tff(19,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[18, 17, 12, 11])).
% 0.20/0.39 tff(20,plain,($lesseq($product(a, $product(a, $product(a, a))), 0)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.39 tff(21,plain,
% 0.20/0.39 ((0 = $product(a, $product(a, $product(a, a)))) <=> ($product(a, $product(a, $product(a, a))) = 0)),
% 0.20/0.39 inference(commutativity,[status(thm)],[])).
% 0.20/0.39 tff(22,plain,
% 0.20/0.39 (($product(a, $product(a, $product(a, a))) = 0) <=> (0 = $product(a, $product(a, $product(a, a))))),
% 0.20/0.39 inference(symmetry,[status(thm)],[21])).
% 0.20/0.39 tff(23,plain,
% 0.20/0.39 ((~($product(a, $product(a, $product(a, a))) = 0)) <=> (~(0 = $product(a, $product(a, $product(a, a)))))),
% 0.20/0.39 inference(monotonicity,[status(thm)],[22])).
% 0.20/0.39 tff(24,plain,
% 0.20/0.39 ((~($product(a, $product(a, $product(a, a))) = 0)) <=> (~($product(a, $product(a, $product(a, a))) = 0))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(25,plain,
% 0.20/0.39 ((~($product($product($product(a, a), a), a) = 0)) <=> (~($product(a, $product(a, $product(a, a))) = 0))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(26,axiom,(~($product($product($product(a, a), a), a) = 0)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','conj_002')).
% 0.20/0.39 tff(27,plain,
% 0.20/0.39 (~($product(a, $product(a, $product(a, a))) = 0)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.20/0.39 tff(28,plain,
% 0.20/0.39 (~($product(a, $product(a, $product(a, a))) = 0)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[27, 24])).
% 0.20/0.39 tff(29,plain,
% 0.20/0.39 (~(0 = $product(a, $product(a, $product(a, a))))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[28, 23])).
% 0.20/0.39 tff(30,plain,
% 0.20/0.39 ((0 = $product(a, $product(a, $product(a, a)))) | (~$lesseq($product(a, $product(a, $product(a, a))), 0)) | (~$greatereq($product(a, $product(a, $product(a, a))), 0))),
% 0.20/0.39 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.39 tff(31,plain,
% 0.20/0.39 ((~$lesseq($product(a, $product(a, $product(a, a))), 0)) | (~$greatereq($product(a, $product(a, $product(a, a))), 0))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[30, 29])).
% 0.20/0.39 tff(32,plain,
% 0.20/0.39 (~$greatereq($product(a, $product(a, $product(a, a))), 0)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[31, 20])).
% 0.20/0.39 tff(33,plain,
% 0.20/0.39 ($greatereq($product(a, $product(a, $product(a, a))), 0)),
% 0.20/0.39 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.39 tff(34,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[33, 32])).
% 0.20/0.39 % SZS output end Proof
%------------------------------------------------------------------------------