TSTP Solution File: SYN285-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN285-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n027.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:54:31 EDT 2022
% Result : Unsatisfiable 0.21s 0.50s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN285-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Sep 5 02:37:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.50 % SZS status Unsatisfiable
% 0.21/0.50 % SZS output start Proof
% 0.21/0.50 tff(q1_type, type, (
% 0.21/0.50 q1: ( $i * $i * $i ) > $o)).
% 0.21/0.50 tff(e_type, type, (
% 0.21/0.50 e: $i)).
% 0.21/0.50 tff(d_type, type, (
% 0.21/0.50 d: $i)).
% 0.21/0.50 tff(m1_type, type, (
% 0.21/0.50 m1: ( $i * $i * $i ) > $o)).
% 0.21/0.50 tff(r0_type, type, (
% 0.21/0.50 r0: $i > $o)).
% 0.21/0.50 tff(k1_type, type, (
% 0.21/0.50 k1: $i > $o)).
% 0.21/0.50 tff(a_type, type, (
% 0.21/0.50 a: $i)).
% 0.21/0.50 tff(n0_type, type, (
% 0.21/0.50 n0: ( $i * $i ) > $o)).
% 0.21/0.50 tff(b_type, type, (
% 0.21/0.50 b: $i)).
% 0.21/0.50 tff(q0_type, type, (
% 0.21/0.50 q0: ( $i * $i ) > $o)).
% 0.21/0.50 tff(l0_type, type, (
% 0.21/0.50 l0: $i > $o)).
% 0.21/0.50 tff(k0_type, type, (
% 0.21/0.50 k0: $i > $o)).
% 0.21/0.50 tff(1,plain,
% 0.21/0.50 (^[I: $i, J: $i, H: $i] : refl(((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I)) <=> ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I)))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(2,plain,
% 0.21/0.50 (![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I)) <=> ![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[1])).
% 0.21/0.50 tff(3,plain,
% 0.21/0.50 (![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I)) <=> ![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(4,plain,
% 0.21/0.50 (^[I: $i, J: $i, H: $i] : trans(monotonicity(rewrite((q1(H, H, I) | (~r0(J))) <=> ((~r0(J)) | q1(H, H, I))), (((q1(H, H, I) | (~r0(J))) | (~m1(H, I, I))) <=> (((~r0(J)) | q1(H, H, I)) | (~m1(H, I, I))))), rewrite((((~r0(J)) | q1(H, H, I)) | (~m1(H, I, I))) <=> ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))), (((q1(H, H, I) | (~r0(J))) | (~m1(H, I, I))) <=> ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(5,plain,
% 0.21/0.50 (![I: $i, J: $i, H: $i] : ((q1(H, H, I) | (~r0(J))) | (~m1(H, I, I))) <=> ![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[4])).
% 0.21/0.50 tff(6,axiom,(![I: $i, J: $i, H: $i] : ((q1(H, H, I) | (~r0(J))) | (~m1(H, I, I)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_113')).
% 0.21/0.50 tff(7,plain,
% 0.21/0.50 (![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.21/0.50 tff(8,plain,
% 0.21/0.50 (![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.21/0.50 tff(9,plain,(
% 0.21/0.50 ![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(skolemize,[status(sab)],[8])).
% 0.21/0.50 tff(10,plain,
% 0.21/0.50 (![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.21/0.50 tff(11,plain,
% 0.21/0.50 (^[I: $i, J: $i] : refl((k1(I) | (~n0(J, I))) <=> (k1(I) | (~n0(J, I))))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(12,plain,
% 0.21/0.50 (![I: $i, J: $i] : (k1(I) | (~n0(J, I))) <=> ![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[11])).
% 0.21/0.50 tff(13,plain,
% 0.21/0.50 (![I: $i, J: $i] : (k1(I) | (~n0(J, I))) <=> ![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(14,axiom,(![I: $i, J: $i] : (k1(I) | (~n0(J, I)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_001')).
% 0.21/0.50 tff(15,plain,
% 0.21/0.50 (![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.21/0.50 tff(16,plain,(
% 0.21/0.50 ![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.21/0.50 inference(skolemize,[status(sab)],[15])).
% 0.21/0.50 tff(17,plain,
% 0.21/0.50 (![I: $i, J: $i] : (k1(I) | (~n0(J, I)))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.21/0.50 tff(18,plain,
% 0.21/0.50 (n0(b, a) <=> n0(b, a)),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(19,axiom,(n0(b, a)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_37')).
% 0.21/0.50 tff(20,plain,
% 0.21/0.50 (n0(b, a)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.21/0.50 tff(21,plain,
% 0.21/0.50 (((~![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.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(22,plain,
% 0.21/0.50 ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | (k1(a) | (~n0(b, a)))),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(23,plain,
% 0.21/0.50 ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | k1(a) | (~n0(b, a))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.21/0.50 tff(24,plain,
% 0.21/0.50 (k1(a)),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[23, 20, 17])).
% 0.21/0.50 tff(25,plain,
% 0.21/0.50 (n0(d, e) <=> n0(d, e)),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(26,axiom,(n0(d, e)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_3')).
% 0.21/0.50 tff(27,plain,
% 0.21/0.50 (n0(d, e)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.21/0.50 tff(28,plain,
% 0.21/0.50 (((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | (k1(e) | (~n0(d, e)))) <=> ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | k1(e) | (~n0(d, e)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(29,plain,
% 0.21/0.50 ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | (k1(e) | (~n0(d, e)))),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(30,plain,
% 0.21/0.50 ((~![I: $i, J: $i] : (k1(I) | (~n0(J, I)))) | k1(e) | (~n0(d, e))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.21/0.50 tff(31,plain,
% 0.21/0.50 (k1(e)),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[30, 27, 17])).
% 0.21/0.50 tff(32,assumption,(~m1(d, e, e)), introduced(assumption)).
% 0.21/0.50 tff(33,plain,
% 0.21/0.50 (^[B: $i, A: $i] : refl(((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B)) <=> ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B)))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(34,plain,
% 0.21/0.50 (![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B)) <=> ![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[33])).
% 0.21/0.50 tff(35,plain,
% 0.21/0.50 (![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B)) <=> ![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(36,plain,
% 0.21/0.50 (^[B: $i, A: $i] : trans(monotonicity(trans(monotonicity(rewrite((m1(A, B, B) | (~k1(a))) <=> ((~k1(a)) | m1(A, B, B))), (((m1(A, B, B) | (~k1(a))) | (~k1(B))) <=> (((~k1(a)) | m1(A, B, B)) | (~k1(B))))), rewrite((((~k1(a)) | m1(A, B, B)) | (~k1(B))) <=> ((~k1(a)) | (~k1(B)) | m1(A, B, B))), (((m1(A, B, B) | (~k1(a))) | (~k1(B))) <=> ((~k1(a)) | (~k1(B)) | m1(A, B, B)))), ((((m1(A, B, B) | (~k1(a))) | (~k1(B))) | (~q0(A, A))) <=> (((~k1(a)) | (~k1(B)) | m1(A, B, B)) | (~q0(A, A))))), rewrite((((~k1(a)) | (~k1(B)) | m1(A, B, B)) | (~q0(A, A))) <=> ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))), ((((m1(A, B, B) | (~k1(a))) | (~k1(B))) | (~q0(A, A))) <=> ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(37,plain,
% 0.21/0.50 (![B: $i, A: $i] : (((m1(A, B, B) | (~k1(a))) | (~k1(B))) | (~q0(A, A))) <=> ![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[36])).
% 0.21/0.50 tff(38,axiom,(![B: $i, A: $i] : (((m1(A, B, B) | (~k1(a))) | (~k1(B))) | (~q0(A, A)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_034')).
% 0.21/0.50 tff(39,plain,
% 0.21/0.50 (![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[38, 37])).
% 0.21/0.50 tff(40,plain,
% 0.21/0.50 (![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[39, 35])).
% 0.21/0.50 tff(41,plain,(
% 0.21/0.50 ![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(skolemize,[status(sab)],[40])).
% 0.21/0.50 tff(42,plain,
% 0.21/0.50 (![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[41, 34])).
% 0.21/0.50 tff(43,plain,
% 0.21/0.50 (q0(d, d) <=> q0(d, d)),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(44,axiom,(q0(d, d)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_25')).
% 0.21/0.50 tff(45,plain,
% 0.21/0.50 (q0(d, d)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[44, 43])).
% 0.21/0.50 tff(46,plain,
% 0.21/0.50 (((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | ((~k1(a)) | (~q0(d, d)) | m1(d, e, e) | (~k1(e)))) <=> ((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | (~k1(a)) | (~q0(d, d)) | m1(d, e, e) | (~k1(e)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(47,plain,
% 0.21/0.50 (((~k1(a)) | (~q0(d, d)) | (~k1(e)) | m1(d, e, e)) <=> ((~k1(a)) | (~q0(d, d)) | m1(d, e, e) | (~k1(e)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(48,plain,
% 0.21/0.50 (((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | ((~k1(a)) | (~q0(d, d)) | (~k1(e)) | m1(d, e, e))) <=> ((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | ((~k1(a)) | (~q0(d, d)) | m1(d, e, e) | (~k1(e))))),
% 0.21/0.50 inference(monotonicity,[status(thm)],[47])).
% 0.21/0.50 tff(49,plain,
% 0.21/0.50 (((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | ((~k1(a)) | (~q0(d, d)) | (~k1(e)) | m1(d, e, e))) <=> ((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | (~k1(a)) | (~q0(d, d)) | m1(d, e, e) | (~k1(e)))),
% 0.21/0.50 inference(transitivity,[status(thm)],[48, 46])).
% 0.21/0.50 tff(50,plain,
% 0.21/0.50 ((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | ((~k1(a)) | (~q0(d, d)) | (~k1(e)) | m1(d, e, e))),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(51,plain,
% 0.21/0.50 ((~![B: $i, A: $i] : ((~k1(a)) | (~q0(A, A)) | (~k1(B)) | m1(A, B, B))) | (~k1(a)) | (~q0(d, d)) | m1(d, e, e) | (~k1(e))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[50, 49])).
% 0.21/0.50 tff(52,plain,
% 0.21/0.50 ($false),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[51, 45, 42, 32, 31, 24])).
% 0.21/0.50 tff(53,plain,(m1(d, e, e)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.50 tff(54,plain,
% 0.21/0.50 (r0(b) <=> r0(b)),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(55,axiom,(r0(b)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_9')).
% 0.21/0.50 tff(56,plain,
% 0.21/0.50 (r0(b)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[55, 54])).
% 0.21/0.50 tff(57,plain,
% 0.21/0.50 (((~![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))) | ((~r0(b)) | (~m1(d, e, e)) | q1(d, d, e))) <=> ((~![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))) | (~r0(b)) | (~m1(d, e, e)) | q1(d, d, e))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(58,plain,
% 0.21/0.50 ((~![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))) | ((~r0(b)) | (~m1(d, e, e)) | q1(d, d, e))),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(59,plain,
% 0.21/0.50 ((~![I: $i, J: $i, H: $i] : ((~r0(J)) | (~m1(H, I, I)) | q1(H, H, I))) | (~r0(b)) | (~m1(d, e, e)) | q1(d, d, e)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[58, 57])).
% 0.21/0.50 tff(60,plain,
% 0.21/0.50 (q1(d, d, e)),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[59, 56, 53, 10])).
% 0.21/0.50 tff(61,plain,
% 0.21/0.50 ((~q1(a, d, d)) <=> (~q1(a, d, d))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(62,axiom,(~q1(a, d, d)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.21/0.50 tff(63,plain,
% 0.21/0.50 (~q1(a, d, d)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[62, 61])).
% 0.21/0.50 tff(64,plain,
% 0.21/0.50 (^[E: $i, F: $i, G: $i] : refl(((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F)) <=> ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F)))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(65,plain,
% 0.21/0.50 (![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F)) <=> ![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[64])).
% 0.21/0.50 tff(66,plain,
% 0.21/0.50 (![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F)) <=> ![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(67,plain,
% 0.21/0.50 (^[E: $i, F: $i, G: $i] : trans(monotonicity(trans(monotonicity(rewrite((q1(E, F, F) | (~k0(G))) <=> ((~k0(G)) | q1(E, F, F))), (((q1(E, F, F) | (~k0(G))) | (~l0(E))) <=> (((~k0(G)) | q1(E, F, F)) | (~l0(E))))), rewrite((((~k0(G)) | q1(E, F, F)) | (~l0(E))) <=> ((~k0(G)) | (~l0(E)) | q1(E, F, F))), (((q1(E, F, F) | (~k0(G))) | (~l0(E))) <=> ((~k0(G)) | (~l0(E)) | q1(E, F, F)))), ((((q1(E, F, F) | (~k0(G))) | (~l0(E))) | (~q1(F, F, G))) <=> (((~k0(G)) | (~l0(E)) | q1(E, F, F)) | (~q1(F, F, G))))), rewrite((((~k0(G)) | (~l0(E)) | q1(E, F, F)) | (~q1(F, F, G))) <=> ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))), ((((q1(E, F, F) | (~k0(G))) | (~l0(E))) | (~q1(F, F, G))) <=> ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(68,plain,
% 0.21/0.50 (![E: $i, F: $i, G: $i] : (((q1(E, F, F) | (~k0(G))) | (~l0(E))) | (~q1(F, F, G))) <=> ![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.51 inference(quant_intro,[status(thm)],[67])).
% 0.21/0.51 tff(69,axiom,(![E: $i, F: $i, G: $i] : (((q1(E, F, F) | (~k0(G))) | (~l0(E))) | (~q1(F, F, G)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_099')).
% 0.21/0.51 tff(70,plain,
% 0.21/0.51 (![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[69, 68])).
% 0.21/0.51 tff(71,plain,
% 0.21/0.51 (![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[70, 66])).
% 0.21/0.51 tff(72,plain,(
% 0.21/0.51 ![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.51 inference(skolemize,[status(sab)],[71])).
% 0.21/0.51 tff(73,plain,
% 0.21/0.51 (![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[72, 65])).
% 0.21/0.51 tff(74,plain,
% 0.21/0.51 (k0(e) <=> k0(e)),
% 0.21/0.51 inference(rewrite,[status(thm)],[])).
% 0.21/0.51 tff(75,axiom,(k0(e)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_28')).
% 0.21/0.51 tff(76,plain,
% 0.21/0.51 (k0(e)),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[75, 74])).
% 0.21/0.51 tff(77,plain,
% 0.21/0.51 (l0(a) <=> l0(a)),
% 0.21/0.51 inference(rewrite,[status(thm)],[])).
% 0.21/0.51 tff(78,axiom,(l0(a)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_20')).
% 0.21/0.51 tff(79,plain,
% 0.21/0.51 (l0(a)),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[78, 77])).
% 0.21/0.51 tff(80,plain,
% 0.21/0.51 (((~![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))) | ((~k0(e)) | (~l0(a)) | (~q1(d, d, e)) | q1(a, d, d))) <=> ((~![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))) | (~k0(e)) | (~l0(a)) | (~q1(d, d, e)) | q1(a, d, d))),
% 0.21/0.51 inference(rewrite,[status(thm)],[])).
% 0.21/0.51 tff(81,plain,
% 0.21/0.51 ((~![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))) | ((~k0(e)) | (~l0(a)) | (~q1(d, d, e)) | q1(a, d, d))),
% 0.21/0.51 inference(quant_inst,[status(thm)],[])).
% 0.21/0.51 tff(82,plain,
% 0.21/0.51 ((~![E: $i, F: $i, G: $i] : ((~k0(G)) | (~l0(E)) | (~q1(F, F, G)) | q1(E, F, F))) | (~k0(e)) | (~l0(a)) | (~q1(d, d, e)) | q1(a, d, d)),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[81, 80])).
% 0.21/0.51 tff(83,plain,
% 0.21/0.51 ($false),
% 0.21/0.51 inference(unit_resolution,[status(thm)],[82, 79, 76, 73, 63, 60])).
% 0.21/0.51 % SZS output end Proof
%------------------------------------------------------------------------------