%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWC051+1 : TPTP v9.0.0. Released v2.4.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:30:02 AM UTC 2025
% Result : Theorem 0.20s 0.45s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC051+1 : TPTP v9.0.0. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 20 08:06:54 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 % SZS output start Proof
% 0.20/0.45 tff(rearsegP_type, type, (
% 0.20/0.45 rearsegP: ( $i * $i ) > $o)).
% 0.20/0.45 tff(tptp_fun_U_45_type, type, (
% 0.20/0.45 tptp_fun_U_45: $i)).
% 0.20/0.45 tff(tptp_fun_V_46_type, type, (
% 0.20/0.45 tptp_fun_V_46: $i)).
% 0.20/0.45 tff(neq_type, type, (
% 0.20/0.45 neq: ( $i * $i ) > $o)).
% 0.20/0.45 tff(nil_type, type, (
% 0.20/0.45 nil: $i)).
% 0.20/0.45 tff(ssList_type, type, (
% 0.20/0.45 ssList: $i > $o)).
% 0.20/0.45 tff(1,plain,
% 0.20/0.45 (^[Y: $i] : refl(((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y))) <=> ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y))))),
% 0.20/0.45 inference(bind,[status(th)],[])).
% 0.20/0.45 tff(2,plain,
% 0.20/0.45 (![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y))) <=> ![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))),
% 0.20/0.45 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.45 tff(3,plain,
% 0.20/0.45 (^[Y: $i] : trans(monotonicity(rewrite((ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y)) <=> (~((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y))))), ((~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))) <=> (~(~((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y))))))), rewrite((~(~((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y))))) <=> ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))), ((~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))) <=> ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))))),
% 0.20/0.45 inference(bind,[status(th)],[])).
% 0.20/0.45 tff(4,plain,
% 0.20/0.45 (![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))) <=> ![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))),
% 0.20/0.45 inference(quant_intro,[status(thm)],[3])).
% 0.20/0.45 tff(5,plain,
% 0.20/0.45 ((ssList(U!45) & ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & ssList(U!45) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))))) <=> (ssList(U!45) & (~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(6,plain,
% 0.20/0.45 (((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & ssList(U!45) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y)))) <=> ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & ssList(U!45) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(7,plain,
% 0.20/0.45 ((ssList(U!45) & ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & ssList(U!45) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))))) <=> (ssList(U!45) & ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & ssList(U!45) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y)))))),
% 0.20/0.45 inference(monotonicity,[status(thm)],[6])).
% 0.20/0.45 tff(8,plain,
% 0.20/0.45 ((ssList(U!45) & ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & ssList(U!45) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))))) <=> (ssList(U!45) & (~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y))))),
% 0.20/0.45 inference(transitivity,[status(thm)],[7, 5])).
% 0.20/0.45 tff(9,plain,
% 0.20/0.45 ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y)))))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(10,plain,
% 0.20/0.45 ((~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => ((((((~(V = X)) | (~(U = W))) | (~neq(V, nil))) | ?[Y: $i] : (((ssList(Y) & neq(Y, nil)) & rearsegP(V, Y)) & rearsegP(U, Y))) | ((~(nil = W)) & (nil = X))) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y)))))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(11,axiom,(~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => ((((((~(V = X)) | (~(U = W))) | (~neq(V, nil))) | ?[Y: $i] : (((ssList(Y) & neq(Y, nil)) & rearsegP(V, Y)) & rearsegP(U, Y))) | ((~(nil = W)) & (nil = X))) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','co1')).
% 0.20/0.45 tff(12,plain,
% 0.20/0.45 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y))))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[11, 10])).
% 0.20/0.45 tff(13,plain,
% 0.20/0.45 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y))))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[12, 9])).
% 0.20/0.45 tff(14,plain,
% 0.20/0.45 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y))))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[13, 9])).
% 0.20/0.45 tff(15,plain,
% 0.20/0.45 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)) | ?[Y: $i] : (ssList(Y) & neq(Y, nil) & rearsegP(V, Y) & rearsegP(U, Y))))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[14, 9])).
% 0.20/0.45 tff(16,plain,
% 0.20/0.45 (ssList(U!45) & (~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) & (~((~(nil = U!45)) & (nil = V!46))) & ssList(V!46) & neq(V!46, nil) & ![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y)))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[15, 8])).
% 0.20/0.45 tff(17,plain,
% 0.20/0.45 (![Y: $i] : (~(ssList(Y) & neq(Y, nil) & rearsegP(V!46, Y) & rearsegP(U!45, Y)))),
% 0.20/0.45 inference(and_elim,[status(thm)],[16])).
% 0.20/0.45 tff(18,plain,
% 0.20/0.45 (![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[17, 4])).
% 0.20/0.45 tff(19,plain,
% 0.20/0.45 (![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[18, 2])).
% 0.20/0.45 tff(20,plain,
% 0.20/0.45 (neq(V!46, nil)),
% 0.20/0.45 inference(and_elim,[status(thm)],[16])).
% 0.20/0.45 tff(21,plain,
% 0.20/0.45 ((~(~((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))))) <=> ((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(22,plain,
% 0.20/0.45 ((neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))) <=> (~((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(23,plain,
% 0.20/0.45 ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) <=> (~(~((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))))))),
% 0.20/0.45 inference(monotonicity,[status(thm)],[22])).
% 0.20/0.45 tff(24,plain,
% 0.20/0.45 ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) <=> ((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))))),
% 0.20/0.45 inference(transitivity,[status(thm)],[23, 21])).
% 0.20/0.45 tff(25,plain,
% 0.20/0.45 (~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))),
% 0.20/0.45 inference(and_elim,[status(thm)],[16])).
% 0.20/0.45 tff(26,plain,
% 0.20/0.45 ((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[25, 24])).
% 0.20/0.45 tff(27,plain,
% 0.20/0.45 (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))),
% 0.20/0.45 inference(unit_resolution,[status(thm)],[26, 20])).
% 0.20/0.45 tff(28,plain,
% 0.20/0.45 (((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))) | rearsegP(V!46, U!45)),
% 0.20/0.45 inference(tautology,[status(thm)],[])).
% 0.20/0.45 tff(29,plain,
% 0.20/0.45 (rearsegP(V!46, U!45)),
% 0.20/0.45 inference(unit_resolution,[status(thm)],[28, 27])).
% 0.20/0.45 tff(30,plain,
% 0.20/0.45 (((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))) | neq(U!45, nil)),
% 0.20/0.45 inference(tautology,[status(thm)],[])).
% 0.20/0.45 tff(31,plain,
% 0.20/0.45 (neq(U!45, nil)),
% 0.20/0.45 inference(unit_resolution,[status(thm)],[30, 27])).
% 0.20/0.45 tff(32,plain,
% 0.20/0.45 (ssList(U!45)),
% 0.20/0.45 inference(and_elim,[status(thm)],[16])).
% 0.20/0.45 tff(33,plain,
% 0.20/0.45 (((~![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))) | ((~ssList(U!45)) | (~neq(U!45, nil)) | (~rearsegP(V!46, U!45)) | (~rearsegP(U!45, U!45)))) <=> ((~![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))) | (~ssList(U!45)) | (~neq(U!45, nil)) | (~rearsegP(V!46, U!45)) | (~rearsegP(U!45, U!45)))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(34,plain,
% 0.20/0.45 ((~![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))) | ((~ssList(U!45)) | (~neq(U!45, nil)) | (~rearsegP(V!46, U!45)) | (~rearsegP(U!45, U!45)))),
% 0.20/0.45 inference(quant_inst,[status(thm)],[])).
% 0.20/0.45 tff(35,plain,
% 0.20/0.45 ((~![Y: $i] : ((~ssList(Y)) | (~neq(Y, nil)) | (~rearsegP(V!46, Y)) | (~rearsegP(U!45, Y)))) | (~ssList(U!45)) | (~neq(U!45, nil)) | (~rearsegP(V!46, U!45)) | (~rearsegP(U!45, U!45))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[34, 33])).
% 0.20/0.45 tff(36,plain,
% 0.20/0.45 (~rearsegP(U!45, U!45)),
% 0.20/0.45 inference(unit_resolution,[status(thm)],[35, 32, 31, 29, 19])).
% 0.20/0.45 tff(37,plain,
% 0.20/0.45 (^[U: $i] : refl(((~ssList(U)) | rearsegP(U, U)) <=> ((~ssList(U)) | rearsegP(U, U)))),
% 0.20/0.45 inference(bind,[status(th)],[])).
% 0.20/0.45 tff(38,plain,
% 0.20/0.45 (![U: $i] : ((~ssList(U)) | rearsegP(U, U)) <=> ![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(quant_intro,[status(thm)],[37])).
% 0.20/0.45 tff(39,plain,
% 0.20/0.45 (![U: $i] : ((~ssList(U)) | rearsegP(U, U)) <=> ![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(40,plain,
% 0.20/0.45 (^[U: $i] : rewrite((ssList(U) => rearsegP(U, U)) <=> ((~ssList(U)) | rearsegP(U, U)))),
% 0.20/0.45 inference(bind,[status(th)],[])).
% 0.20/0.45 tff(41,plain,
% 0.20/0.45 (![U: $i] : (ssList(U) => rearsegP(U, U)) <=> ![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(quant_intro,[status(thm)],[40])).
% 0.20/0.45 tff(42,axiom,(![U: $i] : (ssList(U) => rearsegP(U, U))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax','ax49')).
% 0.20/0.45 tff(43,plain,
% 0.20/0.45 (![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[42, 41])).
% 0.20/0.45 tff(44,plain,
% 0.20/0.45 (![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[43, 39])).
% 0.20/0.45 tff(45,plain,(
% 0.20/0.45 ![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(skolemize,[status(sab)],[44])).
% 0.20/0.45 tff(46,plain,
% 0.20/0.45 (![U: $i] : ((~ssList(U)) | rearsegP(U, U))),
% 0.20/0.45 inference(modus_ponens,[status(thm)],[45, 38])).
% 0.20/0.45 tff(47,plain,
% 0.20/0.45 (((~![U: $i] : ((~ssList(U)) | rearsegP(U, U))) | ((~ssList(U!45)) | rearsegP(U!45, U!45))) <=> ((~![U: $i] : ((~ssList(U)) | rearsegP(U, U))) | (~ssList(U!45)) | rearsegP(U!45, U!45))),
% 0.20/0.45 inference(rewrite,[status(thm)],[])).
% 0.20/0.45 tff(48,plain,
% 0.20/0.45 ((~![U: $i] : ((~ssList(U)) | rearsegP(U, U))) | ((~ssList(U!45)) | rearsegP(U!45, U!45))),
% 0.20/0.46 inference(quant_inst,[status(thm)],[])).
% 0.20/0.46 tff(49,plain,
% 0.20/0.46 ((~![U: $i] : ((~ssList(U)) | rearsegP(U, U))) | (~ssList(U!45)) | rearsegP(U!45, U!45)),
% 0.20/0.46 inference(modus_ponens,[status(thm)],[48, 47])).
% 0.20/0.46 tff(50,plain,
% 0.20/0.46 ($false),
% 0.20/0.46 inference(unit_resolution,[status(thm)],[49, 46, 32, 36])).
% 0.20/0.46 % SZS output end Proof
% 0.20/0.46 % E exiting
%------------------------------------------------------------------------------