TSTP Solution File: SYN110-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN110-1 : TPTP v8.1.0. Released v1.1.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 : Thu Sep 29 23:53:47 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN110-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/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 : Mon Sep 5 01:48:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.20/0.52 % SZS status Unsatisfiable
% 0.20/0.52 % SZS output start Proof
% 0.20/0.52 tff(k2_type, type, (
% 0.20/0.52 k2: ( $i * $i ) > $o)).
% 0.20/0.52 tff(a_type, type, (
% 0.20/0.52 a: $i)).
% 0.20/0.52 tff(q1_type, type, (
% 0.20/0.52 q1: ( $i * $i * $i ) > $o)).
% 0.20/0.52 tff(m0_type, type, (
% 0.20/0.52 m0: ( $i * $i * $i ) > $o)).
% 0.20/0.52 tff(d_type, type, (
% 0.20/0.52 d: $i)).
% 0.20/0.52 tff(e_type, type, (
% 0.20/0.52 e: $i)).
% 0.20/0.52 tff(k1_type, type, (
% 0.20/0.52 k1: $i > $o)).
% 0.20/0.52 tff(n0_type, type, (
% 0.20/0.52 n0: ( $i * $i ) > $o)).
% 0.20/0.52 tff(b_type, type, (
% 0.20/0.52 b: $i)).
% 0.20/0.52 tff(c_type, type, (
% 0.20/0.52 c: $i)).
% 0.20/0.52 tff(m1_type, type, (
% 0.20/0.52 m1: ( $i * $i * $i ) > $o)).
% 0.20/0.52 tff(q0_type, type, (
% 0.20/0.52 q0: ( $i * $i ) > $o)).
% 0.20/0.52 tff(l0_type, type, (
% 0.20/0.52 l0: $i > $o)).
% 0.20/0.52 tff(1,plain,
% 0.20/0.52 (^[I: $i, A: $i, J: $i] : refl(((~m0(J, A, I)) | q1(I, I, I)) <=> ((~m0(J, A, I)) | q1(I, I, I)))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(2,plain,
% 0.20/0.52 (![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I)) <=> ![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.52 tff(3,plain,
% 0.20/0.52 (![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I)) <=> ![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(4,plain,
% 0.20/0.52 (^[I: $i, A: $i, J: $i] : rewrite((q1(I, I, I) | (~m0(J, A, I))) <=> ((~m0(J, A, I)) | q1(I, I, I)))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(5,plain,
% 0.20/0.52 (![I: $i, A: $i, J: $i] : (q1(I, I, I) | (~m0(J, A, I))) <=> ![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[4])).
% 0.20/0.52 tff(6,axiom,(![I: $i, A: $i, J: $i] : (q1(I, I, I) | (~m0(J, A, I)))), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','rule_121')).
% 0.20/0.52 tff(7,plain,
% 0.20/0.52 (![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.20/0.52 tff(8,plain,
% 0.20/0.52 (![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.20/0.52 tff(9,plain,(
% 0.20/0.52 ![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(skolemize,[status(sab)],[8])).
% 0.20/0.52 tff(10,plain,
% 0.20/0.52 (![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.20/0.52 tff(11,plain,
% 0.20/0.52 (m0(e, d, a) <=> m0(e, d, a)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(12,axiom,(m0(e, d, a)), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','axiom_4')).
% 0.20/0.52 tff(13,plain,
% 0.20/0.52 (m0(e, d, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[12, 11])).
% 0.20/0.52 tff(14,plain,
% 0.20/0.52 (((~![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))) | ((~m0(e, d, a)) | q1(a, a, a))) <=> ((~![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))) | (~m0(e, d, a)) | q1(a, a, a))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(15,plain,
% 0.20/0.52 ((~![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))) | ((~m0(e, d, a)) | q1(a, a, a))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(16,plain,
% 0.20/0.52 ((~![I: $i, A: $i, J: $i] : ((~m0(J, A, I)) | q1(I, I, I))) | (~m0(e, d, a)) | q1(a, a, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.20/0.52 tff(17,plain,
% 0.20/0.52 (q1(a, a, a)),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[16, 13, 10])).
% 0.20/0.52 tff(18,plain,
% 0.20/0.52 (^[A: $i, J: $i] : refl(((~q1(A, J, J)) | k2(J, J)) <=> ((~q1(A, J, J)) | k2(J, J)))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(19,plain,
% 0.20/0.52 (![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J)) <=> ![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[18])).
% 0.20/0.52 tff(20,plain,
% 0.20/0.52 (![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J)) <=> ![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(21,plain,
% 0.20/0.52 (^[A: $i, J: $i] : rewrite((k2(J, J) | (~q1(A, J, J))) <=> ((~q1(A, J, J)) | k2(J, J)))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(22,plain,
% 0.20/0.52 (![A: $i, J: $i] : (k2(J, J) | (~q1(A, J, J))) <=> ![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[21])).
% 0.20/0.52 tff(23,axiom,(![A: $i, J: $i] : (k2(J, J) | (~q1(A, J, J)))), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','rule_129')).
% 0.20/0.52 tff(24,plain,
% 0.20/0.52 (![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[23, 22])).
% 0.20/0.52 tff(25,plain,
% 0.20/0.52 (![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[24, 20])).
% 0.20/0.52 tff(26,plain,(
% 0.20/0.52 ![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(skolemize,[status(sab)],[25])).
% 0.20/0.52 tff(27,plain,
% 0.20/0.52 (![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[26, 19])).
% 0.20/0.52 tff(28,plain,
% 0.20/0.52 (((~![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))) | ((~q1(a, a, a)) | k2(a, a))) <=> ((~![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))) | (~q1(a, a, a)) | k2(a, a))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(29,plain,
% 0.20/0.52 ((~![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))) | ((~q1(a, a, a)) | k2(a, a))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(30,plain,
% 0.20/0.52 ((~![A: $i, J: $i] : ((~q1(A, J, J)) | k2(J, J))) | (~q1(a, a, a)) | k2(a, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.20/0.52 tff(31,plain,
% 0.20/0.52 (k2(a, a)),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[30, 27, 17])).
% 0.20/0.52 tff(32,plain,
% 0.20/0.52 (^[I: $i, J: $i] : refl((k1(I) | (~n0(J, I))) <=> (k1(I) | (~n0(J, I))))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(33,plain,
% 0.20/0.52 (![I: $i, J: $i] : (k1(I) | (~n0(J, I))) <=> ![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[32])).
% 0.20/0.52 tff(34,plain,
% 0.20/0.52 (![I: $i, J: $i] : (k1(I) | (~n0(J, I))) <=> ![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(35,axiom,(![I: $i, J: $i] : (k1(I) | (~n0(J, I)))), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','rule_001')).
% 0.20/0.52 tff(36,plain,
% 0.20/0.52 (![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[35, 34])).
% 0.20/0.52 tff(37,plain,(
% 0.20/0.52 ![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.20/0.52 inference(skolemize,[status(sab)],[36])).
% 0.20/0.52 tff(38,plain,
% 0.20/0.52 (![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[37, 33])).
% 0.20/0.52 tff(39,plain,
% 0.20/0.52 (n0(b, a) <=> n0(b, a)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(40,axiom,(n0(b, a)), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','axiom_37')).
% 0.20/0.52 tff(41,plain,
% 0.20/0.52 (n0(b, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[40, 39])).
% 0.20/0.52 tff(42,plain,
% 0.20/0.52 (((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | (k1(a) | (~n0(b, a)))) <=> ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | k1(a) | (~n0(b, a)))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(43,plain,
% 0.20/0.52 ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | (k1(a) | (~n0(b, a)))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(44,plain,
% 0.20/0.52 ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | k1(a) | (~n0(b, a))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.20/0.52 tff(45,plain,
% 0.20/0.52 (k1(a)),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[44, 41, 38])).
% 0.20/0.52 tff(46,plain,
% 0.20/0.52 ((~k2(c, a)) <=> (~k2(c, a))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(47,axiom,(~k2(c, a)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_this')).
% 0.20/0.52 tff(48,plain,
% 0.20/0.52 (~k2(c, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[47, 46])).
% 0.20/0.52 tff(49,assumption,(~m0(a, d, a)), introduced(assumption)).
% 0.20/0.52 tff(50,plain,
% 0.20/0.52 (^[X: $i] : refl(m0(a, X, a) <=> m0(a, X, a))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(51,plain,
% 0.20/0.52 (![X: $i] : m0(a, X, a) <=> ![X: $i] : m0(a, X, a)),
% 0.20/0.52 inference(quant_intro,[status(thm)],[50])).
% 0.20/0.52 tff(52,plain,
% 0.20/0.52 (![X: $i] : m0(a, X, a) <=> ![X: $i] : m0(a, X, a)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(53,axiom,(![X: $i] : m0(a, X, a)), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','axiom_12')).
% 0.20/0.52 tff(54,plain,
% 0.20/0.52 (![X: $i] : m0(a, X, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[53, 52])).
% 0.20/0.52 tff(55,plain,(
% 0.20/0.52 ![X: $i] : m0(a, X, a)),
% 0.20/0.52 inference(skolemize,[status(sab)],[54])).
% 0.20/0.52 tff(56,plain,
% 0.20/0.52 (![X: $i] : m0(a, X, a)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[55, 51])).
% 0.20/0.52 tff(57,plain,
% 0.20/0.52 ((~![X: $i] : m0(a, X, a)) | m0(a, d, a)),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(58,plain,
% 0.20/0.52 ($false),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[57, 56, 49])).
% 0.20/0.52 tff(59,plain,(m0(a, d, a)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.52 tff(60,plain,
% 0.20/0.52 (^[H: $i, F: $i, G: $i] : refl(((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G)) <=> ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G)))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(61,plain,
% 0.20/0.52 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G)) <=> ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[60])).
% 0.20/0.52 tff(62,plain,
% 0.20/0.52 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G)) <=> ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(63,plain,
% 0.20/0.52 (^[H: $i, F: $i, G: $i] : trans(monotonicity(trans(monotonicity(rewrite((m1(F, a, G) | (~m0(a, H, a))) <=> ((~m0(a, H, a)) | m1(F, a, G))), (((m1(F, a, G) | (~m0(a, H, a))) | (~q0(F, G))) <=> (((~m0(a, H, a)) | m1(F, a, G)) | (~q0(F, G))))), rewrite((((~m0(a, H, a)) | m1(F, a, G)) | (~q0(F, G))) <=> ((~q0(F, G)) | (~m0(a, H, a)) | m1(F, a, G))), (((m1(F, a, G) | (~m0(a, H, a))) | (~q0(F, G))) <=> ((~q0(F, G)) | (~m0(a, H, a)) | m1(F, a, G)))), ((((m1(F, a, G) | (~m0(a, H, a))) | (~q0(F, G))) | (~m1(G, c, G))) <=> (((~q0(F, G)) | (~m0(a, H, a)) | m1(F, a, G)) | (~m1(G, c, G))))), rewrite((((~q0(F, G)) | (~m0(a, H, a)) | m1(F, a, G)) | (~m1(G, c, G))) <=> ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))), ((((m1(F, a, G) | (~m0(a, H, a))) | (~q0(F, G))) | (~m1(G, c, G))) <=> ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(64,plain,
% 0.20/0.52 (![H: $i, F: $i, G: $i] : (((m1(F, a, G) | (~m0(a, H, a))) | (~q0(F, G))) | (~m1(G, c, G))) <=> ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[63])).
% 0.20/0.52 tff(65,axiom,(![H: $i, F: $i, G: $i] : (((m1(F, a, G) | (~m0(a, H, a))) | (~q0(F, G))) | (~m1(G, c, G)))), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','rule_024')).
% 0.20/0.52 tff(66,plain,
% 0.20/0.52 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[65, 64])).
% 0.20/0.52 tff(67,plain,
% 0.20/0.52 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[66, 62])).
% 0.20/0.52 tff(68,plain,(
% 0.20/0.52 ![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(skolemize,[status(sab)],[67])).
% 0.20/0.52 tff(69,plain,
% 0.20/0.52 (![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[68, 61])).
% 0.20/0.52 tff(70,plain,
% 0.20/0.52 (m1(c, c, c) <=> m1(c, c, c)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(71,plain,
% 0.20/0.52 (($false | m1(c, c, c)) <=> m1(c, c, c)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(72,plain,
% 0.20/0.52 ((~$true) <=> $false),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(73,axiom,(l0(c)), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','axiom_24')).
% 0.20/0.52 tff(74,plain,
% 0.20/0.52 (l0(c) <=> $true),
% 0.20/0.52 inference(iff_true,[status(thm)],[73])).
% 0.20/0.52 tff(75,plain,
% 0.20/0.52 ((~l0(c)) <=> (~$true)),
% 0.20/0.52 inference(monotonicity,[status(thm)],[74])).
% 0.20/0.52 tff(76,plain,
% 0.20/0.52 ((~l0(c)) <=> $false),
% 0.20/0.52 inference(transitivity,[status(thm)],[75, 72])).
% 0.20/0.52 tff(77,plain,
% 0.20/0.52 (((~l0(c)) | m1(c, c, c)) <=> ($false | m1(c, c, c))),
% 0.20/0.52 inference(monotonicity,[status(thm)],[76])).
% 0.20/0.52 tff(78,plain,
% 0.20/0.52 (((~l0(c)) | m1(c, c, c)) <=> m1(c, c, c)),
% 0.20/0.52 inference(transitivity,[status(thm)],[77, 71])).
% 0.20/0.52 tff(79,plain,
% 0.20/0.52 ((m1(c, c, c) | (~l0(c))) <=> ((~l0(c)) | m1(c, c, c))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(80,axiom,(m1(c, c, c) | (~l0(c))), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','rule_020')).
% 0.20/0.52 tff(81,plain,
% 0.20/0.52 ((~l0(c)) | m1(c, c, c)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[80, 79])).
% 0.20/0.52 tff(82,plain,
% 0.20/0.52 (m1(c, c, c)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[81, 78])).
% 0.20/0.52 tff(83,plain,
% 0.20/0.52 (m1(c, c, c)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[82, 70])).
% 0.20/0.52 tff(84,plain,
% 0.20/0.52 (q0(d, c) <=> q0(d, c)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(85,axiom,(q0(d, c)), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','axiom_33')).
% 0.20/0.53 tff(86,plain,
% 0.20/0.53 (q0(d, c)),
% 0.20/0.53 inference(modus_ponens,[status(thm)],[85, 84])).
% 0.20/0.53 tff(87,plain,
% 0.20/0.53 (((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | (m1(d, a, c) | (~m0(a, d, a)) | (~m1(c, c, c)) | (~q0(d, c)))) <=> ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | m1(d, a, c) | (~m0(a, d, a)) | (~m1(c, c, c)) | (~q0(d, c)))),
% 0.20/0.53 inference(rewrite,[status(thm)],[])).
% 0.20/0.53 tff(88,plain,
% 0.20/0.53 (((~q0(d, c)) | (~m1(c, c, c)) | (~m0(a, d, a)) | m1(d, a, c)) <=> (m1(d, a, c) | (~m0(a, d, a)) | (~m1(c, c, c)) | (~q0(d, c)))),
% 0.20/0.53 inference(rewrite,[status(thm)],[])).
% 0.20/0.53 tff(89,plain,
% 0.20/0.53 (((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | ((~q0(d, c)) | (~m1(c, c, c)) | (~m0(a, d, a)) | m1(d, a, c))) <=> ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | (m1(d, a, c) | (~m0(a, d, a)) | (~m1(c, c, c)) | (~q0(d, c))))),
% 0.20/0.53 inference(monotonicity,[status(thm)],[88])).
% 0.20/0.53 tff(90,plain,
% 0.20/0.53 (((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | ((~q0(d, c)) | (~m1(c, c, c)) | (~m0(a, d, a)) | m1(d, a, c))) <=> ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | m1(d, a, c) | (~m0(a, d, a)) | (~m1(c, c, c)) | (~q0(d, c)))),
% 0.20/0.53 inference(transitivity,[status(thm)],[89, 87])).
% 0.20/0.53 tff(91,plain,
% 0.20/0.53 ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | ((~q0(d, c)) | (~m1(c, c, c)) | (~m0(a, d, a)) | m1(d, a, c))),
% 0.20/0.53 inference(quant_inst,[status(thm)],[])).
% 0.20/0.53 tff(92,plain,
% 0.20/0.53 ((~![H: $i, F: $i, G: $i] : ((~q0(F, G)) | (~m1(G, c, G)) | (~m0(a, H, a)) | m1(F, a, G))) | m1(d, a, c) | (~m0(a, d, a)) | (~m1(c, c, c)) | (~q0(d, c))),
% 0.20/0.53 inference(modus_ponens,[status(thm)],[91, 90])).
% 0.20/0.53 tff(93,plain,
% 0.20/0.53 (m1(d, a, c)),
% 0.20/0.53 inference(unit_resolution,[status(thm)],[92, 86, 83, 69, 59])).
% 0.20/0.53 tff(94,plain,
% 0.20/0.53 (^[D: $i, E: $i, F: $i, C: $i] : refl(((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D)) <=> ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D)))),
% 0.20/0.53 inference(bind,[status(th)],[])).
% 0.20/0.53 tff(95,plain,
% 0.20/0.53 (![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D)) <=> ![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.20/0.53 inference(quant_intro,[status(thm)],[94])).
% 0.20/0.53 tff(96,plain,
% 0.20/0.53 (![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D)) <=> ![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.20/0.53 inference(rewrite,[status(thm)],[])).
% 0.20/0.53 tff(97,plain,
% 0.20/0.53 (^[D: $i, E: $i, F: $i, C: $i] : trans(monotonicity(trans(monotonicity(rewrite((k2(C, D) | (~m1(E, D, C))) <=> ((~m1(E, D, C)) | k2(C, D))), (((k2(C, D) | (~m1(E, D, C))) | (~k1(F))) <=> (((~m1(E, D, C)) | k2(C, D)) | (~k1(F))))), rewrite((((~m1(E, D, C)) | k2(C, D)) | (~k1(F))) <=> ((~k1(F)) | (~m1(E, D, C)) | k2(C, D))), (((k2(C, D) | (~m1(E, D, C))) | (~k1(F))) <=> ((~k1(F)) | (~m1(E, D, C)) | k2(C, D)))), ((((k2(C, D) | (~m1(E, D, C))) | (~k1(F))) | (~k2(F, D))) <=> (((~k1(F)) | (~m1(E, D, C)) | k2(C, D)) | (~k2(F, D))))), rewrite((((~k1(F)) | (~m1(E, D, C)) | k2(C, D)) | (~k2(F, D))) <=> ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))), ((((k2(C, D) | (~m1(E, D, C))) | (~k1(F))) | (~k2(F, D))) <=> ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))))),
% 0.20/0.53 inference(bind,[status(th)],[])).
% 0.20/0.53 tff(98,plain,
% 0.20/0.53 (![D: $i, E: $i, F: $i, C: $i] : (((k2(C, D) | (~m1(E, D, C))) | (~k1(F))) | (~k2(F, D))) <=> ![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.20/0.53 inference(quant_intro,[status(thm)],[97])).
% 0.20/0.53 tff(99,axiom,(![D: $i, E: $i, F: $i, C: $i] : (((k2(C, D) | (~m1(E, D, C))) | (~k1(F))) | (~k2(F, D)))), file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax','rule_127')).
% 0.20/0.53 tff(100,plain,
% 0.20/0.53 (![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.44/0.54 inference(modus_ponens,[status(thm)],[99, 98])).
% 0.44/0.54 tff(101,plain,
% 0.44/0.54 (![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.44/0.54 inference(modus_ponens,[status(thm)],[100, 96])).
% 0.44/0.54 tff(102,plain,(
% 0.44/0.54 ![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.44/0.54 inference(skolemize,[status(sab)],[101])).
% 0.44/0.54 tff(103,plain,
% 0.44/0.54 (![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))),
% 0.44/0.54 inference(modus_ponens,[status(thm)],[102, 95])).
% 0.44/0.54 tff(104,plain,
% 0.44/0.54 (((~![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))) | ((~k1(a)) | (~k2(a, a)) | (~m1(d, a, c)) | k2(c, a))) <=> ((~![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))) | (~k1(a)) | (~k2(a, a)) | (~m1(d, a, c)) | k2(c, a))),
% 0.44/0.54 inference(rewrite,[status(thm)],[])).
% 0.44/0.54 tff(105,plain,
% 0.44/0.54 ((~![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))) | ((~k1(a)) | (~k2(a, a)) | (~m1(d, a, c)) | k2(c, a))),
% 0.44/0.54 inference(quant_inst,[status(thm)],[])).
% 0.44/0.54 tff(106,plain,
% 0.44/0.54 ((~![D: $i, E: $i, F: $i, C: $i] : ((~k1(F)) | (~k2(F, D)) | (~m1(E, D, C)) | k2(C, D))) | (~k1(a)) | (~k2(a, a)) | (~m1(d, a, c)) | k2(c, a)),
% 0.44/0.54 inference(modus_ponens,[status(thm)],[105, 104])).
% 0.44/0.54 tff(107,plain,
% 0.44/0.54 ($false),
% 0.44/0.54 inference(unit_resolution,[status(thm)],[106, 103, 93, 48, 45, 31])).
% 0.44/0.54 % SZS output end Proof
%------------------------------------------------------------------------------