TSTP Solution File: ARI659_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : ARI659_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n019.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:29 EDT 2022
% Result : Theorem 0.15s 0.35s
% Output : Proof 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : ARI659_1 : TPTP v8.1.0. Released v6.3.0.
% 0.09/0.11 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 01:26:20 EDT 2022
% 0.15/0.31 % CPUTime :
% 0.15/0.32 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.15/0.32 Usage: tptp [options] [-file:]file
% 0.15/0.32 -h, -? prints this message.
% 0.15/0.32 -smt2 print SMT-LIB2 benchmark.
% 0.15/0.32 -m, -model generate model.
% 0.15/0.32 -p, -proof generate proof.
% 0.15/0.32 -c, -core generate unsat core of named formulas.
% 0.15/0.32 -st, -statistics display statistics.
% 0.15/0.32 -t:timeout set timeout (in second).
% 0.15/0.32 -smt2status display status in smt2 format instead of SZS.
% 0.15/0.32 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.15/0.32 -<param>:<value> configuration parameter and value.
% 0.15/0.32 -o:<output-file> file to place output in.
% 0.15/0.35 % SZS status Theorem
% 0.15/0.35 % SZS output start Proof
% 0.15/0.35 tff(a_type, type, (
% 0.15/0.35 a: $int)).
% 0.15/0.35 tff(1,assumption,(~$lesseq(a, 1)), introduced(assumption)).
% 0.15/0.35 tff(2,plain,
% 0.15/0.35 (((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1)) <=> ((~$lesseq($product(a, $product(a, a)), 3)) <=> $lesseq(a, 1))),
% 0.15/0.35 inference(rewrite,[status(thm)],[])).
% 0.15/0.35 tff(3,plain,
% 0.15/0.35 (((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1)) <=> ((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1))),
% 0.15/0.35 inference(rewrite,[status(thm)],[])).
% 0.15/0.35 tff(4,plain,
% 0.15/0.35 ((~($greatereq(3, $product(a, $product(a, a))) <=> $lesseq(a, 1))) <=> ((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1))),
% 0.15/0.35 inference(rewrite,[status(thm)],[])).
% 0.15/0.35 tff(5,plain,
% 0.15/0.35 (($greatereq(3, $product($product(a, a), a)) <=> $lesseq(a, 1)) <=> ($greatereq(3, $product(a, $product(a, a))) <=> $lesseq(a, 1))),
% 0.15/0.35 inference(rewrite,[status(thm)],[])).
% 0.15/0.35 tff(6,plain,
% 0.15/0.35 ((~($greatereq(3, $product($product(a, a), a)) <=> $lesseq(a, 1))) <=> (~($greatereq(3, $product(a, $product(a, a))) <=> $lesseq(a, 1)))),
% 0.15/0.35 inference(monotonicity,[status(thm)],[5])).
% 0.15/0.35 tff(7,plain,
% 0.15/0.35 ((~($greatereq(3, $product($product(a, a), a)) <=> $lesseq(a, 1))) <=> ((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1))),
% 0.15/0.35 inference(transitivity,[status(thm)],[6, 4])).
% 0.15/0.35 tff(8,axiom,(~($greatereq(3, $product($product(a, a), a)) <=> $lesseq(a, 1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','conj')).
% 0.15/0.35 tff(9,plain,
% 0.15/0.35 ((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1)),
% 0.15/0.35 inference(modus_ponens,[status(thm)],[8, 7])).
% 0.15/0.35 tff(10,plain,
% 0.15/0.35 ((~$greatereq(3, $product(a, $product(a, a)))) <=> $lesseq(a, 1)),
% 0.15/0.35 inference(modus_ponens,[status(thm)],[9, 3])).
% 0.15/0.35 tff(11,plain,
% 0.15/0.35 ((~$lesseq($product(a, $product(a, a)), 3)) <=> $lesseq(a, 1)),
% 0.15/0.35 inference(modus_ponens,[status(thm)],[10, 2])).
% 0.15/0.35 tff(12,plain,
% 0.15/0.35 ($lesseq($product(a, $product(a, a)), 3) | $lesseq(a, 1) | (~((~$lesseq($product(a, $product(a, a)), 3)) <=> $lesseq(a, 1)))),
% 0.15/0.35 inference(tautology,[status(thm)],[])).
% 0.15/0.35 tff(13,plain,
% 0.15/0.35 ($lesseq($product(a, $product(a, a)), 3) | $lesseq(a, 1)),
% 0.15/0.35 inference(unit_resolution,[status(thm)],[12, 11])).
% 0.15/0.35 tff(14,plain,
% 0.15/0.35 ($lesseq($product(a, $product(a, a)), 3)),
% 0.15/0.35 inference(unit_resolution,[status(thm)],[13, 1])).
% 0.15/0.35 tff(15,plain,
% 0.15/0.35 ((~$lesseq($product(a, $product(a, a)), 3)) | $lesseq(a, 1)),
% 0.15/0.35 inference(theory_lemma,[status(thm)],[])).
% 0.15/0.35 tff(16,plain,
% 0.15/0.35 ($false),
% 0.15/0.35 inference(unit_resolution,[status(thm)],[15, 14, 1])).
% 0.15/0.35 tff(17,plain,($lesseq(a, 1)), inference(lemma,lemma(discharge,[]))).
% 0.15/0.35 tff(18,plain,
% 0.15/0.35 ((~$lesseq($product(a, $product(a, a)), 3)) | (~$lesseq(a, 1)) | (~((~$lesseq($product(a, $product(a, a)), 3)) <=> $lesseq(a, 1)))),
% 0.15/0.35 inference(tautology,[status(thm)],[])).
% 0.15/0.35 tff(19,plain,
% 0.15/0.35 ((~$lesseq($product(a, $product(a, a)), 3)) | (~$lesseq(a, 1))),
% 0.15/0.35 inference(unit_resolution,[status(thm)],[18, 11])).
% 0.15/0.35 tff(20,plain,
% 0.15/0.35 (~$lesseq($product(a, $product(a, a)), 3)),
% 0.15/0.35 inference(unit_resolution,[status(thm)],[19, 17])).
% 0.15/0.35 tff(21,plain,
% 0.15/0.35 ($lesseq($product(a, $product(a, a)), 3) | (~$lesseq(a, 1))),
% 0.15/0.35 inference(theory_lemma,[status(thm)],[])).
% 0.15/0.35 tff(22,plain,
% 0.15/0.35 ($false),
% 0.15/0.35 inference(unit_resolution,[status(thm)],[21, 20, 17])).
% 0.15/0.35 % SZS output end Proof
%------------------------------------------------------------------------------