↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN728-1 : TPTP v9.0.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n003.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 : Sat Jun 21 05:39:55 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.40s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SYN728-1 : TPTP v9.0.0. Released v2.5.0.
% 0.08/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n003.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Fri Jun 20 12:41:39 EDT 2025
% 0.11/0.34  % CPUTime    : 
% 0.20/0.40  % SZS status Unsatisfiable
% 0.20/0.40  % SZS output start Proof
% 0.20/0.40  tff(p_type, type, (
% 0.20/0.40     p: ( $i * $i ) > $o)).
% 0.20/0.40  tff(g_type, type, (
% 0.20/0.40     g: $i > $i)).
% 0.20/0.40  tff(sk2_type, type, (
% 0.20/0.40     sk2: $i)).
% 0.20/0.40  tff(sk1_type, type, (
% 0.20/0.40     sk1: $i > $i)).
% 0.20/0.40  tff(f_type, type, (
% 0.20/0.40     f: ( $i * $i ) > $i)).
% 0.20/0.40  tff(elem_0_type, type, (
% 0.20/0.40     elem_0: $i)).
% 0.20/0.40  tff(m_type, type, (
% 0.20/0.40     m: $i > $o)).
% 0.20/0.40  tff(q_type, type, (
% 0.20/0.40     q: $i > $o)).
% 0.20/0.40  tff(1,assumption,(p(elem!0, sk1(elem!0))), introduced(assumption)).
% 0.20/0.40  tff(2,plain,
% 0.20/0.40      (^[B: $i, A: $i, C: $i] : refl(((~p(A, B)) | p(C, C)) <=> ((~p(A, B)) | p(C, C)))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(3,plain,
% 0.20/0.40      (![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C)) <=> ![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[2])).
% 0.20/0.40  tff(4,plain,
% 0.20/0.40      (![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C)) <=> ![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(5,plain,
% 0.20/0.40      (^[B: $i, A: $i, C: $i] : rewrite((p(C, C) | (~p(A, B))) <=> ((~p(A, B)) | p(C, C)))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(6,plain,
% 0.20/0.40      (![B: $i, A: $i, C: $i] : (p(C, C) | (~p(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[5])).
% 0.20/0.40  tff(7,axiom,(![B: $i, A: $i, C: $i] : (p(C, C) | (~p(A, B)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm69_1')).
% 0.20/0.40  tff(8,plain,
% 0.20/0.40      (![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[7, 6])).
% 0.20/0.40  tff(9,plain,
% 0.20/0.40      (![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[8, 4])).
% 0.20/0.40  tff(10,plain,(
% 0.20/0.40      ![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(skolemize,[status(sab)],[9])).
% 0.20/0.40  tff(11,plain,
% 0.20/0.40      (![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[10, 3])).
% 0.20/0.40  tff(12,plain,
% 0.20/0.40      (((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(elem!0, sk1(elem!0))) | p(g(sk2), g(sk2)))) <=> ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(elem!0, sk1(elem!0))) | p(g(sk2), g(sk2)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(13,plain,
% 0.20/0.40      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(elem!0, sk1(elem!0))) | p(g(sk2), g(sk2)))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(14,plain,
% 0.20/0.40      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(elem!0, sk1(elem!0))) | p(g(sk2), g(sk2))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[13, 12])).
% 0.20/0.40  tff(15,plain,
% 0.20/0.40      ((~p(elem!0, sk1(elem!0))) | p(g(sk2), g(sk2))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[14, 11])).
% 0.20/0.40  tff(16,plain,
% 0.20/0.40      (p(g(sk2), g(sk2))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[15, 1])).
% 0.20/0.40  tff(17,plain,
% 0.20/0.40      (^[A: $i] : refl(((~p(sk2, sk2)) | (~p(g(sk2), A))) <=> ((~p(sk2, sk2)) | (~p(g(sk2), A))))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(18,plain,
% 0.20/0.40      (![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A))) <=> ![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[17])).
% 0.20/0.40  tff(19,plain,
% 0.20/0.40      (![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A))) <=> ![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(20,axiom,(![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm69_5')).
% 0.20/0.40  tff(21,plain,
% 0.20/0.40      (![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[20, 19])).
% 0.20/0.40  tff(22,plain,(
% 0.20/0.40      ![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))),
% 0.20/0.40      inference(skolemize,[status(sab)],[21])).
% 0.20/0.40  tff(23,plain,
% 0.20/0.40      (![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[22, 18])).
% 0.20/0.40  tff(24,plain,
% 0.20/0.40      (((~![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))) | ((~p(sk2, sk2)) | (~p(g(sk2), g(sk2))))) <=> ((~![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))) | (~p(sk2, sk2)) | (~p(g(sk2), g(sk2))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(25,plain,
% 0.20/0.40      ((~![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))) | ((~p(sk2, sk2)) | (~p(g(sk2), g(sk2))))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(26,plain,
% 0.20/0.40      ((~![A: $i] : ((~p(sk2, sk2)) | (~p(g(sk2), A)))) | (~p(sk2, sk2)) | (~p(g(sk2), g(sk2)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[25, 24])).
% 0.20/0.40  tff(27,plain,
% 0.20/0.40      (~p(sk2, sk2)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[26, 23, 16])).
% 0.20/0.40  tff(28,plain,
% 0.20/0.40      (((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(elem!0, sk1(elem!0))) | p(sk2, sk2))) <=> ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(elem!0, sk1(elem!0))) | p(sk2, sk2))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(29,plain,
% 0.20/0.40      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(elem!0, sk1(elem!0))) | p(sk2, sk2))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(30,plain,
% 0.20/0.40      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(elem!0, sk1(elem!0))) | p(sk2, sk2)),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[29, 28])).
% 0.20/0.40  tff(31,plain,
% 0.20/0.40      ($false),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[30, 11, 1, 27])).
% 0.20/0.40  tff(32,plain,(~p(elem!0, sk1(elem!0))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.40  tff(33,plain,
% 0.20/0.40      (^[A: $i] : refl((q(f(A, sk1(A))) | p(A, sk1(A))) <=> (q(f(A, sk1(A))) | p(A, sk1(A))))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(34,plain,
% 0.20/0.40      (![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A))) <=> ![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[33])).
% 0.20/0.40  tff(35,plain,
% 0.20/0.40      (![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A))) <=> ![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(36,axiom,(![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm69_3')).
% 0.20/0.40  tff(37,plain,
% 0.20/0.40      (![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[36, 35])).
% 0.20/0.40  tff(38,plain,(
% 0.20/0.40      ![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))),
% 0.20/0.40      inference(skolemize,[status(sab)],[37])).
% 0.20/0.40  tff(39,plain,
% 0.20/0.40      (![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[38, 34])).
% 0.20/0.40  tff(40,plain,
% 0.20/0.40      (((~![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))) | (q(f(elem!0, sk1(elem!0))) | p(elem!0, sk1(elem!0)))) <=> ((~![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))) | q(f(elem!0, sk1(elem!0))) | p(elem!0, sk1(elem!0)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(41,plain,
% 0.20/0.40      ((~![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))) | (q(f(elem!0, sk1(elem!0))) | p(elem!0, sk1(elem!0)))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(42,plain,
% 0.20/0.40      ((~![A: $i] : (q(f(A, sk1(A))) | p(A, sk1(A)))) | q(f(elem!0, sk1(elem!0))) | p(elem!0, sk1(elem!0))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[41, 40])).
% 0.20/0.40  tff(43,plain,
% 0.20/0.40      (q(f(elem!0, sk1(elem!0)))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[42, 39, 32])).
% 0.20/0.40  tff(44,plain,
% 0.20/0.40      (^[A: $i] : refl(((~q(A)) | (~m(g(A)))) <=> ((~q(A)) | (~m(g(A)))))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(45,plain,
% 0.20/0.40      (![A: $i] : ((~q(A)) | (~m(g(A)))) <=> ![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[44])).
% 0.20/0.40  tff(46,plain,
% 0.20/0.40      (![A: $i] : ((~q(A)) | (~m(g(A)))) <=> ![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(47,plain,
% 0.20/0.40      (^[A: $i] : rewrite(((~m(g(A))) | (~q(A))) <=> ((~q(A)) | (~m(g(A)))))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(48,plain,
% 0.20/0.40      (![A: $i] : ((~m(g(A))) | (~q(A))) <=> ![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[47])).
% 0.20/0.40  tff(49,axiom,(![A: $i] : ((~m(g(A))) | (~q(A)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm69_4')).
% 0.20/0.40  tff(50,plain,
% 0.20/0.40      (![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[49, 48])).
% 0.20/0.40  tff(51,plain,
% 0.20/0.40      (![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[50, 46])).
% 0.20/0.40  tff(52,plain,(
% 0.20/0.40      ![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(skolemize,[status(sab)],[51])).
% 0.20/0.40  tff(53,plain,
% 0.20/0.40      (![A: $i] : ((~q(A)) | (~m(g(A))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[52, 45])).
% 0.20/0.40  tff(54,plain,
% 0.20/0.40      (((~![A: $i] : ((~q(A)) | (~m(g(A))))) | ((~q(f(elem!0, sk1(elem!0)))) | (~m(g(f(elem!0, sk1(elem!0))))))) <=> ((~![A: $i] : ((~q(A)) | (~m(g(A))))) | (~q(f(elem!0, sk1(elem!0)))) | (~m(g(f(elem!0, sk1(elem!0))))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.41  tff(55,plain,
% 0.20/0.41      ((~![A: $i] : ((~q(A)) | (~m(g(A))))) | ((~q(f(elem!0, sk1(elem!0)))) | (~m(g(f(elem!0, sk1(elem!0))))))),
% 0.20/0.41      inference(quant_inst,[status(thm)],[])).
% 0.20/0.41  tff(56,plain,
% 0.20/0.41      ((~![A: $i] : ((~q(A)) | (~m(g(A))))) | (~q(f(elem!0, sk1(elem!0)))) | (~m(g(f(elem!0, sk1(elem!0)))))),
% 0.20/0.41      inference(modus_ponens,[status(thm)],[55, 54])).
% 0.20/0.41  tff(57,plain,
% 0.20/0.41      (~m(g(f(elem!0, sk1(elem!0))))),
% 0.20/0.41      inference(unit_resolution,[status(thm)],[56, 53, 43])).
% 0.20/0.41  tff(58,plain,
% 0.20/0.41      (^[A: $i] : refl((m(A) | p(A, sk1(A))) <=> (m(A) | p(A, sk1(A))))),
% 0.20/0.41      inference(bind,[status(th)],[])).
% 0.20/0.41  tff(59,plain,
% 0.20/0.41      (![A: $i] : (m(A) | p(A, sk1(A))) <=> ![A: $i] : (m(A) | p(A, sk1(A)))),
% 0.20/0.41      inference(quant_intro,[status(thm)],[58])).
% 0.20/0.41  tff(60,plain,
% 0.20/0.41      (![A: $i] : (m(A) | p(A, sk1(A))) <=> ![A: $i] : (m(A) | p(A, sk1(A)))),
% 0.20/0.41      inference(rewrite,[status(thm)],[])).
% 0.20/0.41  tff(61,axiom,(![A: $i] : (m(A) | p(A, sk1(A)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm69_2')).
% 0.20/0.41  tff(62,plain,
% 0.20/0.41      (![A: $i] : (m(A) | p(A, sk1(A)))),
% 0.20/0.41      inference(modus_ponens,[status(thm)],[61, 60])).
% 0.20/0.41  tff(63,plain,(
% 0.20/0.41      ![A: $i] : (m(A) | p(A, sk1(A)))),
% 0.20/0.41      inference(skolemize,[status(sab)],[62])).
% 0.20/0.41  tff(64,plain,
% 0.20/0.41      (![A: $i] : (m(A) | p(A, sk1(A)))),
% 0.20/0.41      inference(modus_ponens,[status(thm)],[63, 59])).
% 0.20/0.41  tff(65,plain,
% 0.20/0.41      (((~![A: $i] : (m(A) | p(A, sk1(A)))) | (m(g(f(elem!0, sk1(elem!0)))) | p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0))))))) <=> ((~![A: $i] : (m(A) | p(A, sk1(A)))) | m(g(f(elem!0, sk1(elem!0)))) | p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0))))))),
% 0.20/0.41      inference(rewrite,[status(thm)],[])).
% 0.20/0.41  tff(66,plain,
% 0.20/0.41      ((~![A: $i] : (m(A) | p(A, sk1(A)))) | (m(g(f(elem!0, sk1(elem!0)))) | p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0))))))),
% 0.20/0.41      inference(quant_inst,[status(thm)],[])).
% 0.20/0.41  tff(67,plain,
% 0.20/0.41      ((~![A: $i] : (m(A) | p(A, sk1(A)))) | m(g(f(elem!0, sk1(elem!0)))) | p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0)))))),
% 0.20/0.41      inference(modus_ponens,[status(thm)],[66, 65])).
% 0.20/0.41  tff(68,plain,
% 0.20/0.41      (p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0)))))),
% 0.20/0.41      inference(unit_resolution,[status(thm)],[67, 64, 57])).
% 0.20/0.41  tff(69,assumption,(~p(sk2, sk2)), introduced(assumption)).
% 0.20/0.41  tff(70,plain,
% 0.20/0.41      (((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0)))))) | p(sk2, sk2))) <=> ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0)))))) | p(sk2, sk2))),
% 0.20/0.41      inference(rewrite,[status(thm)],[])).
% 0.20/0.41  tff(71,plain,
% 0.20/0.41      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0)))))) | p(sk2, sk2))),
% 0.20/0.41      inference(quant_inst,[status(thm)],[])).
% 0.20/0.41  tff(72,plain,
% 0.20/0.41      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(g(f(elem!0, sk1(elem!0))), sk1(g(f(elem!0, sk1(elem!0)))))) | p(sk2, sk2)),
% 0.20/0.41      inference(modus_ponens,[status(thm)],[71, 70])).
% 0.20/0.41  tff(73,plain,
% 0.20/0.41      ($false),
% 0.20/0.41      inference(unit_resolution,[status(thm)],[72, 11, 69, 68])).
% 0.20/0.41  tff(74,plain,(p(sk2, sk2)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.41  tff(75,plain,
% 0.20/0.41      (~p(g(sk2), g(sk2))),
% 0.20/0.41      inference(unit_resolution,[status(thm)],[26, 23, 74])).
% 0.20/0.41  tff(76,plain,
% 0.20/0.41      (((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(sk2, sk2)) | p(g(sk2), g(sk2)))) <=> ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(sk2, sk2)) | p(g(sk2), g(sk2)))),
% 0.20/0.41      inference(rewrite,[status(thm)],[])).
% 0.20/0.41  tff(77,plain,
% 0.20/0.41      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | ((~p(sk2, sk2)) | p(g(sk2), g(sk2)))),
% 0.20/0.41      inference(quant_inst,[status(thm)],[])).
% 0.20/0.41  tff(78,plain,
% 0.20/0.41      ((~![B: $i, A: $i, C: $i] : ((~p(A, B)) | p(C, C))) | (~p(sk2, sk2)) | p(g(sk2), g(sk2))),
% 0.20/0.41      inference(modus_ponens,[status(thm)],[77, 76])).
% 0.20/0.41  tff(79,plain,
% 0.20/0.41      ($false),
% 0.20/0.41      inference(unit_resolution,[status(thm)],[78, 11, 74, 75])).
% 0.20/0.41  % SZS output end Proof
% 0.20/0.41  % E exiting
%------------------------------------------------------------------------------