TSTP Solution File: SYN123-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN123-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n016.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 : Thu Sep 29 23:53:50 EDT 2022
% Result : Unsatisfiable 0.47s 0.60s
% Output : Proof 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN123-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Sep 5 02:15:09 EDT 2022
% 0.13/0.35 % 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.47/0.60 % SZS status Unsatisfiable
% 0.47/0.60 % SZS output start Proof
% 0.47/0.60 tff(m0_type, type, (
% 0.47/0.60 m0: ( $i * $i * $i ) > $o)).
% 0.47/0.60 tff(d_type, type, (
% 0.47/0.60 d: $i)).
% 0.47/0.60 tff(b_type, type, (
% 0.47/0.60 b: $i)).
% 0.47/0.60 tff(p0_type, type, (
% 0.47/0.60 p0: ( $i * $i ) > $o)).
% 0.47/0.60 tff(l2_type, type, (
% 0.47/0.60 l2: ( $i * $i ) > $o)).
% 0.47/0.60 tff(s1_type, type, (
% 0.47/0.60 s1: $i > $o)).
% 0.47/0.60 tff(q0_type, type, (
% 0.47/0.60 q0: ( $i * $i ) > $o)).
% 0.47/0.60 tff(1,assumption,(~m0(b, d, d)), introduced(assumption)).
% 0.47/0.60 tff(2,plain,
% 0.47/0.60 (^[Y: $i, X: $i] : refl(m0(X, d, Y) <=> m0(X, d, Y))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(3,plain,
% 0.47/0.60 (![Y: $i, X: $i] : m0(X, d, Y) <=> ![Y: $i, X: $i] : m0(X, d, Y)),
% 0.47/0.60 inference(quant_intro,[status(thm)],[2])).
% 0.47/0.60 tff(4,plain,
% 0.47/0.60 (![Y: $i, X: $i] : m0(X, d, Y) <=> ![Y: $i, X: $i] : m0(X, d, Y)),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(5,axiom,(![Y: $i, X: $i] : m0(X, d, Y)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_19')).
% 0.47/0.60 tff(6,plain,
% 0.47/0.60 (![Y: $i, X: $i] : m0(X, d, Y)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.47/0.60 tff(7,plain,(
% 0.47/0.60 ![Y: $i, X: $i] : m0(X, d, Y)),
% 0.47/0.60 inference(skolemize,[status(sab)],[6])).
% 0.47/0.60 tff(8,plain,
% 0.47/0.60 (![Y: $i, X: $i] : m0(X, d, Y)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.47/0.60 tff(9,plain,
% 0.47/0.60 ((~![Y: $i, X: $i] : m0(X, d, Y)) | m0(b, d, d)),
% 0.47/0.60 inference(quant_inst,[status(thm)],[])).
% 0.47/0.60 tff(10,plain,
% 0.47/0.60 ($false),
% 0.47/0.60 inference(unit_resolution,[status(thm)],[9, 8, 1])).
% 0.47/0.60 tff(11,plain,(m0(b, d, d)), inference(lemma,lemma(discharge,[]))).
% 0.47/0.60 tff(12,assumption,(~p0(b, b)), introduced(assumption)).
% 0.47/0.60 tff(13,plain,
% 0.47/0.60 (^[X: $i] : refl(p0(b, X) <=> p0(b, X))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(14,plain,
% 0.47/0.60 (![X: $i] : p0(b, X) <=> ![X: $i] : p0(b, X)),
% 0.47/0.60 inference(quant_intro,[status(thm)],[13])).
% 0.47/0.60 tff(15,plain,
% 0.47/0.60 (![X: $i] : p0(b, X) <=> ![X: $i] : p0(b, X)),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(16,axiom,(![X: $i] : p0(b, X)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_14')).
% 0.47/0.60 tff(17,plain,
% 0.47/0.60 (![X: $i] : p0(b, X)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[16, 15])).
% 0.47/0.60 tff(18,plain,(
% 0.47/0.60 ![X: $i] : p0(b, X)),
% 0.47/0.60 inference(skolemize,[status(sab)],[17])).
% 0.47/0.60 tff(19,plain,
% 0.47/0.60 (![X: $i] : p0(b, X)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[18, 14])).
% 0.47/0.60 tff(20,plain,
% 0.47/0.60 ((~![X: $i] : p0(b, X)) | p0(b, b)),
% 0.47/0.60 inference(quant_inst,[status(thm)],[])).
% 0.47/0.60 tff(21,plain,
% 0.47/0.60 ($false),
% 0.47/0.60 inference(unit_resolution,[status(thm)],[20, 19, 12])).
% 0.47/0.60 tff(22,plain,(p0(b, b)), inference(lemma,lemma(discharge,[]))).
% 0.47/0.60 tff(23,plain,
% 0.47/0.60 ((~l2(d, d)) <=> (~l2(d, d))),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(24,axiom,(~l2(d, d)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.47/0.60 tff(25,plain,
% 0.47/0.60 (~l2(d, d)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.47/0.60 tff(26,plain,
% 0.47/0.60 (^[I: $i] : refl((s1(I) | (~p0(I, I))) <=> (s1(I) | (~p0(I, I))))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(27,plain,
% 0.47/0.60 (![I: $i] : (s1(I) | (~p0(I, I))) <=> ![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.47/0.60 inference(quant_intro,[status(thm)],[26])).
% 0.47/0.60 tff(28,plain,
% 0.47/0.60 (![I: $i] : (s1(I) | (~p0(I, I))) <=> ![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(29,axiom,(![I: $i] : (s1(I) | (~p0(I, I)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_125')).
% 0.47/0.60 tff(30,plain,
% 0.47/0.60 (![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.47/0.60 tff(31,plain,(
% 0.47/0.60 ![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.47/0.60 inference(skolemize,[status(sab)],[30])).
% 0.47/0.60 tff(32,plain,
% 0.47/0.60 (![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[31, 27])).
% 0.47/0.60 tff(33,plain,
% 0.47/0.60 (((~![I: $i] : (s1(I) | (~p0(I, I)))) | (s1(b) | (~p0(b, b)))) <=> ((~![I: $i] : (s1(I) | (~p0(I, I)))) | s1(b) | (~p0(b, b)))),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(34,plain,
% 0.47/0.60 ((~![I: $i] : (s1(I) | (~p0(I, I)))) | (s1(b) | (~p0(b, b)))),
% 0.47/0.60 inference(quant_inst,[status(thm)],[])).
% 0.47/0.60 tff(35,plain,
% 0.47/0.60 ((~![I: $i] : (s1(I) | (~p0(I, I)))) | s1(b) | (~p0(b, b))),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[34, 33])).
% 0.47/0.60 tff(36,plain,
% 0.47/0.60 (s1(b)),
% 0.47/0.60 inference(unit_resolution,[status(thm)],[35, 32, 22])).
% 0.47/0.60 tff(37,plain,
% 0.47/0.60 (^[H: $i, F: $i, G: $i] : refl(((~q0(F, G)) | (~s1(H)) | s1(F)) <=> ((~q0(F, G)) | (~s1(H)) | s1(F)))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(38,plain,
% 0.47/0.60 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F)) <=> ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(quant_intro,[status(thm)],[37])).
% 0.47/0.60 tff(39,plain,
% 0.47/0.60 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F)) <=> ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(40,plain,
% 0.47/0.60 (^[H: $i, F: $i, G: $i] : rewrite(((s1(F) | (~q0(F, G))) | (~s1(H))) <=> ((~q0(F, G)) | (~s1(H)) | s1(F)))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(41,plain,
% 0.47/0.60 (![H: $i, F: $i, G: $i] : ((s1(F) | (~q0(F, G))) | (~s1(H))) <=> ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(quant_intro,[status(thm)],[40])).
% 0.47/0.60 tff(42,axiom,(![H: $i, F: $i, G: $i] : ((s1(F) | (~q0(F, G))) | (~s1(H)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_126')).
% 0.47/0.60 tff(43,plain,
% 0.47/0.60 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[42, 41])).
% 0.47/0.60 tff(44,plain,
% 0.47/0.60 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[43, 39])).
% 0.47/0.60 tff(45,plain,(
% 0.47/0.60 ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(skolemize,[status(sab)],[44])).
% 0.47/0.60 tff(46,plain,
% 0.47/0.60 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[45, 38])).
% 0.47/0.60 tff(47,plain,
% 0.47/0.60 (q0(d, d) <=> q0(d, d)),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(48,axiom,(q0(d, d)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_25')).
% 0.47/0.60 tff(49,plain,
% 0.47/0.60 (q0(d, d)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[48, 47])).
% 0.47/0.60 tff(50,plain,
% 0.47/0.60 (((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))) | ((~q0(d, d)) | (~s1(b)) | s1(d))) <=> ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))) | (~q0(d, d)) | (~s1(b)) | s1(d))),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(51,plain,
% 0.47/0.60 ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))) | ((~q0(d, d)) | (~s1(b)) | s1(d))),
% 0.47/0.60 inference(quant_inst,[status(thm)],[])).
% 0.47/0.60 tff(52,plain,
% 0.47/0.60 ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~s1(H)) | s1(F))) | (~q0(d, d)) | (~s1(b)) | s1(d)),
% 0.47/0.60 inference(modus_ponens,[status(thm)],[51, 50])).
% 0.47/0.60 tff(53,plain,
% 0.47/0.60 (s1(d)),
% 0.47/0.60 inference(unit_resolution,[status(thm)],[52, 49, 46, 36])).
% 0.47/0.60 tff(54,plain,
% 0.47/0.60 (^[B: $i, A: $i, J: $i, C: $i] : refl(((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J)) <=> ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J)))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(55,plain,
% 0.47/0.60 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J)) <=> ![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.60 inference(quant_intro,[status(thm)],[54])).
% 0.47/0.60 tff(56,plain,
% 0.47/0.60 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J)) <=> ![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.60 inference(rewrite,[status(thm)],[])).
% 0.47/0.60 tff(57,plain,
% 0.47/0.60 (^[B: $i, A: $i, J: $i, C: $i] : trans(monotonicity(trans(monotonicity(rewrite((l2(J, J) | (~p0(A, A))) <=> ((~p0(A, A)) | l2(J, J))), (((l2(J, J) | (~p0(A, A))) | (~s1(B))) <=> (((~p0(A, A)) | l2(J, J)) | (~s1(B))))), rewrite((((~p0(A, A)) | l2(J, J)) | (~s1(B))) <=> ((~p0(A, A)) | (~s1(B)) | l2(J, J))), (((l2(J, J) | (~p0(A, A))) | (~s1(B))) <=> ((~p0(A, A)) | (~s1(B)) | l2(J, J)))), ((((l2(J, J) | (~p0(A, A))) | (~s1(B))) | (~m0(C, B, J))) <=> (((~p0(A, A)) | (~s1(B)) | l2(J, J)) | (~m0(C, B, J))))), rewrite((((~p0(A, A)) | (~s1(B)) | l2(J, J)) | (~m0(C, B, J))) <=> ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))), ((((l2(J, J) | (~p0(A, A))) | (~s1(B))) | (~m0(C, B, J))) <=> ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))))),
% 0.47/0.60 inference(bind,[status(th)],[])).
% 0.47/0.60 tff(58,plain,
% 0.47/0.60 (![B: $i, A: $i, J: $i, C: $i] : (((l2(J, J) | (~p0(A, A))) | (~s1(B))) | (~m0(C, B, J))) <=> ![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.62 inference(quant_intro,[status(thm)],[57])).
% 0.47/0.62 tff(59,axiom,(![B: $i, A: $i, J: $i, C: $i] : (((l2(J, J) | (~p0(A, A))) | (~s1(B))) | (~m0(C, B, J)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_133')).
% 0.47/0.62 tff(60,plain,
% 0.47/0.62 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.62 inference(modus_ponens,[status(thm)],[59, 58])).
% 0.47/0.62 tff(61,plain,
% 0.47/0.62 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.62 inference(modus_ponens,[status(thm)],[60, 56])).
% 0.47/0.62 tff(62,plain,(
% 0.47/0.62 ![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.62 inference(skolemize,[status(sab)],[61])).
% 0.47/0.62 tff(63,plain,
% 0.47/0.62 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.47/0.62 inference(modus_ponens,[status(thm)],[62, 55])).
% 0.47/0.62 tff(64,plain,
% 0.47/0.62 (((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~s1(d)) | l2(d, d) | (~p0(b, b)) | (~m0(b, d, d)))) <=> ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | (~s1(d)) | l2(d, d) | (~p0(b, b)) | (~m0(b, d, d)))),
% 0.47/0.62 inference(rewrite,[status(thm)],[])).
% 0.47/0.62 tff(65,plain,
% 0.47/0.62 (((~p0(b, b)) | (~m0(b, d, d)) | (~s1(d)) | l2(d, d)) <=> ((~s1(d)) | l2(d, d) | (~p0(b, b)) | (~m0(b, d, d)))),
% 0.47/0.62 inference(rewrite,[status(thm)],[])).
% 0.47/0.62 tff(66,plain,
% 0.47/0.62 (((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~p0(b, b)) | (~m0(b, d, d)) | (~s1(d)) | l2(d, d))) <=> ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~s1(d)) | l2(d, d) | (~p0(b, b)) | (~m0(b, d, d))))),
% 0.47/0.62 inference(monotonicity,[status(thm)],[65])).
% 0.47/0.62 tff(67,plain,
% 0.47/0.62 (((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~p0(b, b)) | (~m0(b, d, d)) | (~s1(d)) | l2(d, d))) <=> ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | (~s1(d)) | l2(d, d) | (~p0(b, b)) | (~m0(b, d, d)))),
% 0.47/0.62 inference(transitivity,[status(thm)],[66, 64])).
% 0.47/0.62 tff(68,plain,
% 0.47/0.62 ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~p0(b, b)) | (~m0(b, d, d)) | (~s1(d)) | l2(d, d))),
% 0.47/0.62 inference(quant_inst,[status(thm)],[])).
% 0.47/0.62 tff(69,plain,
% 0.47/0.62 ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | (~s1(d)) | l2(d, d) | (~p0(b, b)) | (~m0(b, d, d))),
% 0.47/0.62 inference(modus_ponens,[status(thm)],[68, 67])).
% 0.47/0.62 tff(70,plain,
% 0.47/0.62 ($false),
% 0.47/0.62 inference(unit_resolution,[status(thm)],[69, 63, 53, 25, 22, 11])).
% 0.47/0.62 % SZS output end Proof
%------------------------------------------------------------------------------