TSTP Solution File: SYN122-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN122-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:50 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.07/0.12 % Problem : SYN122-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Sep 5 01:50:38 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(s1_type, type, (
% 0.21/0.50 s1: $i > $o)).
% 0.21/0.50 tff(b_type, type, (
% 0.21/0.50 b: $i)).
% 0.21/0.50 tff(p0_type, type, (
% 0.21/0.50 p0: ( $i * $i ) > $o)).
% 0.21/0.50 tff(l2_type, type, (
% 0.21/0.50 l2: ( $i * $i ) > $o)).
% 0.21/0.50 tff(e_type, type, (
% 0.21/0.50 e: $i)).
% 0.21/0.50 tff(n0_type, type, (
% 0.21/0.50 n0: ( $i * $i ) > $o)).
% 0.21/0.50 tff(m0_type, type, (
% 0.21/0.50 m0: ( $i * $i * $i ) > $o)).
% 0.21/0.50 tff(1,assumption,(~p0(b, b)), introduced(assumption)).
% 0.21/0.50 tff(2,plain,
% 0.21/0.50 (^[X: $i] : refl(p0(b, X) <=> p0(b, X))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(3,plain,
% 0.21/0.50 (![X: $i] : p0(b, X) <=> ![X: $i] : p0(b, X)),
% 0.21/0.50 inference(quant_intro,[status(thm)],[2])).
% 0.21/0.50 tff(4,plain,
% 0.21/0.50 (![X: $i] : p0(b, X) <=> ![X: $i] : p0(b, X)),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(5,axiom,(![X: $i] : p0(b, X)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_14')).
% 0.21/0.50 tff(6,plain,
% 0.21/0.50 (![X: $i] : p0(b, X)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.21/0.50 tff(7,plain,(
% 0.21/0.50 ![X: $i] : p0(b, X)),
% 0.21/0.50 inference(skolemize,[status(sab)],[6])).
% 0.21/0.50 tff(8,plain,
% 0.21/0.50 (![X: $i] : p0(b, X)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.21/0.50 tff(9,plain,
% 0.21/0.50 ((~![X: $i] : p0(b, X)) | p0(b, b)),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(10,plain,
% 0.21/0.50 ($false),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[9, 8, 1])).
% 0.21/0.50 tff(11,plain,(p0(b, b)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.50 tff(12,plain,
% 0.21/0.50 (^[I: $i] : refl((s1(I) | (~p0(I, I))) <=> (s1(I) | (~p0(I, I))))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(13,plain,
% 0.21/0.50 (![I: $i] : (s1(I) | (~p0(I, I))) <=> ![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[12])).
% 0.21/0.50 tff(14,plain,
% 0.21/0.50 (![I: $i] : (s1(I) | (~p0(I, I))) <=> ![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(15,axiom,(![I: $i] : (s1(I) | (~p0(I, I)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_125')).
% 0.21/0.50 tff(16,plain,
% 0.21/0.50 (![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.21/0.50 tff(17,plain,(
% 0.21/0.50 ![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.21/0.50 inference(skolemize,[status(sab)],[16])).
% 0.21/0.50 tff(18,plain,
% 0.21/0.50 (![I: $i] : (s1(I) | (~p0(I, I)))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[17, 13])).
% 0.21/0.50 tff(19,plain,
% 0.21/0.50 (((~![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.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(20,plain,
% 0.21/0.50 ((~![I: $i] : (s1(I) | (~p0(I, I)))) | (s1(b) | (~p0(b, b)))),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(21,plain,
% 0.21/0.50 ((~![I: $i] : (s1(I) | (~p0(I, I)))) | s1(b) | (~p0(b, b))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[20, 19])).
% 0.21/0.50 tff(22,plain,
% 0.21/0.50 (s1(b)),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[21, 18, 11])).
% 0.21/0.50 tff(23,plain,
% 0.21/0.50 ((~l2(b, e)) <=> (~l2(b, e))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(24,axiom,(~l2(b, e)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.21/0.50 tff(25,plain,
% 0.21/0.50 (~l2(b, e)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.21/0.50 tff(26,plain,
% 0.21/0.50 (^[D: $i, E: $i] : refl(((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E)) <=> ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E)))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(27,plain,
% 0.21/0.50 (![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E)) <=> ![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[26])).
% 0.21/0.50 tff(28,plain,
% 0.21/0.50 (![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E)) <=> ![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(29,plain,
% 0.21/0.50 (^[D: $i, E: $i] : trans(monotonicity(trans(monotonicity(rewrite((l2(D, E) | (~s1(D))) <=> ((~s1(D)) | l2(D, E))), (((l2(D, E) | (~s1(D))) | (~n0(e, E))) <=> (((~s1(D)) | l2(D, E)) | (~n0(e, E))))), rewrite((((~s1(D)) | l2(D, E)) | (~n0(e, E))) <=> ((~n0(e, E)) | (~s1(D)) | l2(D, E))), (((l2(D, E) | (~s1(D))) | (~n0(e, E))) <=> ((~n0(e, E)) | (~s1(D)) | l2(D, E)))), ((((l2(D, E) | (~s1(D))) | (~n0(e, E))) | (~l2(E, E))) <=> (((~n0(e, E)) | (~s1(D)) | l2(D, E)) | (~l2(E, E))))), rewrite((((~n0(e, E)) | (~s1(D)) | l2(D, E)) | (~l2(E, E))) <=> ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))), ((((l2(D, E) | (~s1(D))) | (~n0(e, E))) | (~l2(E, E))) <=> ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))))),
% 0.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(30,plain,
% 0.21/0.50 (![D: $i, E: $i] : (((l2(D, E) | (~s1(D))) | (~n0(e, E))) | (~l2(E, E))) <=> ![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(quant_intro,[status(thm)],[29])).
% 0.21/0.50 tff(31,axiom,(![D: $i, E: $i] : (((l2(D, E) | (~s1(D))) | (~n0(e, E))) | (~l2(E, E)))), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','rule_131')).
% 0.21/0.50 tff(32,plain,
% 0.21/0.50 (![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[31, 30])).
% 0.21/0.50 tff(33,plain,
% 0.21/0.50 (![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[32, 28])).
% 0.21/0.50 tff(34,plain,(
% 0.21/0.50 ![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(skolemize,[status(sab)],[33])).
% 0.21/0.50 tff(35,plain,
% 0.21/0.50 (![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[34, 27])).
% 0.21/0.50 tff(36,plain,
% 0.21/0.50 (n0(e, e) <=> n0(e, e)),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(37,axiom,(n0(e, e)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_30')).
% 0.21/0.50 tff(38,plain,
% 0.21/0.50 (n0(e, e)),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.21/0.50 tff(39,plain,
% 0.21/0.50 (((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | ((~s1(b)) | l2(b, e) | (~l2(e, e)) | (~n0(e, e)))) <=> ((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | (~s1(b)) | l2(b, e) | (~l2(e, e)) | (~n0(e, e)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(40,plain,
% 0.21/0.50 (((~l2(e, e)) | (~n0(e, e)) | (~s1(b)) | l2(b, e)) <=> ((~s1(b)) | l2(b, e) | (~l2(e, e)) | (~n0(e, e)))),
% 0.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(41,plain,
% 0.21/0.50 (((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | ((~l2(e, e)) | (~n0(e, e)) | (~s1(b)) | l2(b, e))) <=> ((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | ((~s1(b)) | l2(b, e) | (~l2(e, e)) | (~n0(e, e))))),
% 0.21/0.50 inference(monotonicity,[status(thm)],[40])).
% 0.21/0.50 tff(42,plain,
% 0.21/0.50 (((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | ((~l2(e, e)) | (~n0(e, e)) | (~s1(b)) | l2(b, e))) <=> ((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | (~s1(b)) | l2(b, e) | (~l2(e, e)) | (~n0(e, e)))),
% 0.21/0.50 inference(transitivity,[status(thm)],[41, 39])).
% 0.21/0.50 tff(43,plain,
% 0.21/0.50 ((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | ((~l2(e, e)) | (~n0(e, e)) | (~s1(b)) | l2(b, e))),
% 0.21/0.50 inference(quant_inst,[status(thm)],[])).
% 0.21/0.50 tff(44,plain,
% 0.21/0.50 ((~![D: $i, E: $i] : ((~l2(E, E)) | (~n0(e, E)) | (~s1(D)) | l2(D, E))) | (~s1(b)) | l2(b, e) | (~l2(e, e)) | (~n0(e, e))),
% 0.21/0.50 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.21/0.50 tff(45,plain,
% 0.21/0.50 ((~s1(b)) | (~l2(e, e))),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[44, 38, 35, 25])).
% 0.21/0.50 tff(46,plain,
% 0.21/0.50 (~l2(e, e)),
% 0.21/0.50 inference(unit_resolution,[status(thm)],[45, 22])).
% 0.21/0.50 tff(47,plain,
% 0.21/0.50 (^[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.21/0.50 inference(bind,[status(th)],[])).
% 0.21/0.50 tff(48,plain,
% 0.21/0.50 (![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.21/0.50 inference(quant_intro,[status(thm)],[47])).
% 0.21/0.50 tff(49,plain,
% 0.21/0.50 (![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.21/0.50 inference(rewrite,[status(thm)],[])).
% 0.21/0.50 tff(50,plain,
% 0.21/0.50 (^[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.21/0.51 inference(bind,[status(th)],[])).
% 0.21/0.51 tff(51,plain,
% 0.21/0.51 (![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.21/0.51 inference(quant_intro,[status(thm)],[50])).
% 0.21/0.51 tff(52,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.21/0.51 tff(53,plain,
% 0.21/0.51 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[52, 51])).
% 0.21/0.51 tff(54,plain,
% 0.21/0.51 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[53, 49])).
% 0.21/0.51 tff(55,plain,(
% 0.21/0.51 ![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.21/0.51 inference(skolemize,[status(sab)],[54])).
% 0.21/0.51 tff(56,plain,
% 0.21/0.51 (![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[55, 48])).
% 0.21/0.51 tff(57,plain,
% 0.21/0.51 (m0(b, b, e) <=> m0(b, b, e)),
% 0.21/0.51 inference(rewrite,[status(thm)],[])).
% 0.21/0.51 tff(58,axiom,(m0(b, b, e)), file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax','axiom_31')).
% 0.21/0.51 tff(59,plain,
% 0.21/0.51 (m0(b, b, e)),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[58, 57])).
% 0.21/0.51 tff(60,plain,
% 0.21/0.51 (((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~s1(b)) | l2(e, e) | (~m0(b, b, e)) | (~p0(b, b)))) <=> ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | (~s1(b)) | l2(e, e) | (~m0(b, b, e)) | (~p0(b, b)))),
% 0.21/0.51 inference(rewrite,[status(thm)],[])).
% 0.21/0.51 tff(61,plain,
% 0.21/0.51 (((~p0(b, b)) | (~m0(b, b, e)) | (~s1(b)) | l2(e, e)) <=> ((~s1(b)) | l2(e, e) | (~m0(b, b, e)) | (~p0(b, b)))),
% 0.21/0.51 inference(rewrite,[status(thm)],[])).
% 0.21/0.51 tff(62,plain,
% 0.21/0.51 (((~![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, b, e)) | (~s1(b)) | l2(e, e))) <=> ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | ((~s1(b)) | l2(e, e) | (~m0(b, b, e)) | (~p0(b, b))))),
% 0.21/0.51 inference(monotonicity,[status(thm)],[61])).
% 0.21/0.51 tff(63,plain,
% 0.21/0.51 (((~![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, b, e)) | (~s1(b)) | l2(e, e))) <=> ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | (~s1(b)) | l2(e, e) | (~m0(b, b, e)) | (~p0(b, b)))),
% 0.21/0.51 inference(transitivity,[status(thm)],[62, 60])).
% 0.21/0.51 tff(64,plain,
% 0.21/0.51 ((~![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, b, e)) | (~s1(b)) | l2(e, e))),
% 0.21/0.51 inference(quant_inst,[status(thm)],[])).
% 0.21/0.51 tff(65,plain,
% 0.21/0.51 ((~![B: $i, A: $i, J: $i, C: $i] : ((~p0(A, A)) | (~m0(C, B, J)) | (~s1(B)) | l2(J, J))) | (~s1(b)) | l2(e, e) | (~m0(b, b, e)) | (~p0(b, b))),
% 0.21/0.51 inference(modus_ponens,[status(thm)],[64, 63])).
% 0.21/0.51 tff(66,plain,
% 0.21/0.51 ((~s1(b)) | l2(e, e)),
% 0.21/0.51 inference(unit_resolution,[status(thm)],[65, 59, 56, 11])).
% 0.21/0.51 tff(67,plain,
% 0.21/0.51 ($false),
% 0.21/0.51 inference(unit_resolution,[status(thm)],[66, 46, 22])).
% 0.21/0.51 % SZS output end Proof
%------------------------------------------------------------------------------