TSTP Solution File: DAT063_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : DAT063_1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n006.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 : Fri Sep 16 14:36:35 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT063_1 : TPTP v8.1.0. Released v5.5.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n006.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 : Wed Aug 31 01:46:09 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.39 % SZS status Theorem
% 0.13/0.39 % SZS output start Proof
% 0.13/0.39 tff(lsls_type, type, (
% 0.13/0.39 lsls: ( heap * heap ) > $o)).
% 0.13/0.39 tff(empty_type, type, (
% 0.13/0.39 empty: heap)).
% 0.13/0.39 tff(tptp_fun_H_0_type, type, (
% 0.13/0.39 tptp_fun_H_0: heap)).
% 0.13/0.39 tff(length_type, type, (
% 0.13/0.39 length: heap > $int)).
% 0.13/0.39 tff(1,plain,
% 0.13/0.39 ((~![H: heap] : ((~lsls(H, empty)) | (~$greatereq(length(H), 0)))) <=> (~![H: heap] : ((~lsls(H, empty)) | (~$greatereq(length(H), 0))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(2,plain,
% 0.13/0.39 ((~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H))))) <=> (~![H: heap] : ((~lsls(H, empty)) | (~$greatereq(length(H), 0))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(3,plain,
% 0.13/0.39 ((~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H))))) <=> (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H)))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(4,plain,
% 0.13/0.39 ((~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(length(empty), length(H))))) <=> (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H)))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(5,plain,
% 0.13/0.39 ((~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(length(empty), length(H))))) <=> (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(length(empty), length(H)))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(6,plain,
% 0.13/0.39 ((~![H: heap] : (lsls(H, empty) => $less(length(H), length(empty)))) <=> (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(length(empty), length(H)))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(7,axiom,(~![H: heap] : (lsls(H, empty) => $less(length(H), length(empty)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','th_lem_1b')).
% 0.13/0.39 tff(8,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(length(empty), length(H))))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[7, 6])).
% 0.13/0.39 tff(9,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(length(empty), length(H))))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[8, 5])).
% 0.13/0.39 tff(10,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H))))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[9, 4])).
% 0.13/0.39 tff(11,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H))))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[10, 3])).
% 0.13/0.39 tff(12,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$lesseq(0, length(H))))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[11, 3])).
% 0.13/0.39 tff(13,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$greatereq(length(H), 0)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[12, 2])).
% 0.13/0.39 tff(14,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$greatereq(length(H), 0)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[13, 1])).
% 0.13/0.39 tff(15,plain,
% 0.13/0.39 (~![H: heap] : ((~lsls(H, empty)) | (~$greatereq(length(H), 0)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[14, 1])).
% 0.13/0.39 tff(16,plain,(
% 0.13/0.39 ~((~lsls(H!0, empty)) | (~$greatereq(length(H!0), 0)))),
% 0.13/0.39 inference(skolemize,[status(sab)],[15])).
% 0.13/0.39 tff(17,plain,
% 0.13/0.39 (lsls(H!0, empty)),
% 0.13/0.39 inference(or_elim,[status(thm)],[16])).
% 0.13/0.39 tff(18,plain,
% 0.13/0.39 (^[H: heap] : refl((~lsls(H, empty)) <=> (~lsls(H, empty)))),
% 0.13/0.39 inference(bind,[status(th)],[])).
% 0.13/0.39 tff(19,plain,
% 0.13/0.39 (![H: heap] : (~lsls(H, empty)) <=> ![H: heap] : (~lsls(H, empty))),
% 0.13/0.40 inference(quant_intro,[status(thm)],[18])).
% 0.13/0.40 tff(20,plain,
% 0.13/0.40 (![H: heap] : (~lsls(H, empty)) <=> ![H: heap] : (~lsls(H, empty))),
% 0.13/0.40 inference(rewrite,[status(thm)],[])).
% 0.13/0.40 tff(21,axiom,(![H: heap] : (~lsls(H, empty))), file('/export/starexec/sandbox/benchmark/Axioms/DAT005=0.ax','ax_26')).
% 0.13/0.40 tff(22,plain,
% 0.13/0.40 (![H: heap] : (~lsls(H, empty))),
% 0.13/0.40 inference(modus_ponens,[status(thm)],[21, 20])).
% 0.13/0.40 tff(23,plain,(
% 0.13/0.40 ![H: heap] : (~lsls(H, empty))),
% 0.13/0.40 inference(skolemize,[status(sab)],[22])).
% 0.13/0.40 tff(24,plain,
% 0.13/0.40 (![H: heap] : (~lsls(H, empty))),
% 0.13/0.40 inference(modus_ponens,[status(thm)],[23, 19])).
% 0.13/0.40 tff(25,plain,
% 0.13/0.40 ((~![H: heap] : (~lsls(H, empty))) | (~lsls(H!0, empty))),
% 0.13/0.40 inference(quant_inst,[status(thm)],[])).
% 0.13/0.40 tff(26,plain,
% 0.13/0.40 ($false),
% 0.13/0.40 inference(unit_resolution,[status(thm)],[25, 24, 17])).
% 0.13/0.40 % SZS output end Proof
%------------------------------------------------------------------------------