↑ Up

Z3---4.15.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SWC210+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:31 AM UTC 2025

% Result   : Theorem 0.21s 0.48s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC210+1 : TPTP v9.0.0. Released v2.4.0.
% 0.03/0.13  % 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:38:24 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 0.21/0.48  % SZS status Theorem
% 0.21/0.48  % SZS output start Proof
% 0.21/0.48  tff(nil_type, type, (
% 0.21/0.48     nil: $i)).
% 0.21/0.48  tff(cons_type, type, (
% 0.21/0.48     cons: ( $i * $i ) > $i)).
% 0.21/0.48  tff(tptp_fun_V_4_type, type, (
% 0.21/0.48     tptp_fun_V_4: $i > $i)).
% 0.21/0.48  tff(tptp_fun_U_45_type, type, (
% 0.21/0.48     tptp_fun_U_45: $i)).
% 0.21/0.48  tff(ssItem_type, type, (
% 0.21/0.48     ssItem: $i > $o)).
% 0.21/0.48  tff(singletonP_type, type, (
% 0.21/0.48     singletonP: $i > $o)).
% 0.21/0.48  tff(ssList_type, type, (
% 0.21/0.48     ssList: $i > $o)).
% 0.21/0.48  tff(neq_type, type, (
% 0.21/0.48     neq: ( $i * $i ) > $o)).
% 0.21/0.48  tff(tptp_fun_V_46_type, type, (
% 0.21/0.48     tptp_fun_V_46: $i)).
% 0.21/0.48  tff(1,plain,
% 0.21/0.48      ((U!45 = nil) <=> (nil = U!45)),
% 0.21/0.48      inference(commutativity,[status(thm)],[])).
% 0.21/0.48  tff(2,plain,
% 0.21/0.48      ((ssList(U!45) & (~((~singletonP(U!45)) | (~ssList(V!46)) | neq(U!45, nil) | (~ssList(U!45)) | (~neq(V!46, nil))))) <=> (ssList(U!45) & (~((~singletonP(U!45)) | neq(U!45, nil) | (~ssList(U!45)) | (~ssList(V!46)) | (~neq(V!46, nil)))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(3,plain,
% 0.21/0.48      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil)))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(4,plain,
% 0.21/0.48      ((~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (((~(V = X)) | (~(U = W))) | ((((~neq(V, nil)) | (~singletonP(W))) | neq(U, nil)) & ((~neq(V, nil)) | neq(X, nil))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil)))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(5,axiom,(~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (((~(V = X)) | (~(U = W))) | ((((~neq(V, nil)) | (~singletonP(W))) | neq(U, nil)) & ((~neq(V, nil)) | neq(X, nil))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','co1')).
% 0.21/0.48  tff(6,plain,
% 0.21/0.48      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[5, 4])).
% 0.21/0.48  tff(7,plain,
% 0.21/0.48      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[6, 3])).
% 0.21/0.48  tff(8,plain,
% 0.21/0.48      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[7, 3])).
% 0.21/0.48  tff(9,plain,
% 0.21/0.48      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~singletonP(U)) | (~ssList(V)) | neq(U, nil) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[8, 3])).
% 0.21/0.48  tff(10,plain,
% 0.21/0.48      (ssList(U!45) & (~((~singletonP(U!45)) | neq(U!45, nil) | (~ssList(U!45)) | (~ssList(V!46)) | (~neq(V!46, nil))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[9, 2])).
% 0.21/0.48  tff(11,plain,
% 0.21/0.48      (ssList(U!45)),
% 0.21/0.48      inference(and_elim,[status(thm)],[10])).
% 0.21/0.48  tff(12,plain,
% 0.21/0.48      (^[U: $i] : refl(((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))) <=> ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(13,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))) <=> ![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[12])).
% 0.21/0.48  tff(14,plain,
% 0.21/0.48      (^[U: $i] : rewrite(((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))) <=> ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(15,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))) <=> ![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[14])).
% 0.21/0.48  tff(16,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))) <=> ![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))),
% 0.21/0.48      inference(transitivity,[status(thm)],[15, 13])).
% 0.21/0.48  tff(17,plain,
% 0.21/0.48      (^[U: $i] : rewrite(((~ssList(U)) | (((~singletonP(U)) | (ssItem(tptp_fun_V_4(U)) & (cons(tptp_fun_V_4(U), nil) = U))) & (singletonP(U) | ![V: $i] : (~(ssItem(V) & (cons(V, nil) = U)))))) <=> ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U)))))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(18,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (((~singletonP(U)) | (ssItem(tptp_fun_V_4(U)) & (cons(tptp_fun_V_4(U), nil) = U))) & (singletonP(U) | ![V: $i] : (~(ssItem(V) & (cons(V, nil) = U)))))) <=> ![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[17])).
% 0.21/0.48  tff(19,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))) <=> ![U: $i] : ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(20,plain,
% 0.21/0.48      (^[U: $i] : trans(monotonicity(rewrite((singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))) <=> (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))), ((ssList(U) => (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))) <=> (ssList(U) => (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))))), rewrite((ssList(U) => (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))) <=> ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))), ((ssList(U) => (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))) <=> ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(21,plain,
% 0.21/0.48      (![U: $i] : (ssList(U) => (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U)))) <=> ![U: $i] : ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[20])).
% 0.21/0.48  tff(22,axiom,(![U: $i] : (ssList(U) => (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax4')).
% 0.21/0.48  tff(23,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[22, 21])).
% 0.21/0.48  tff(24,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (singletonP(U) <=> ?[V: $i] : (ssItem(V) & (cons(V, nil) = U))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[23, 19])).
% 0.21/0.48  tff(25,plain,(
% 0.21/0.48      ![U: $i] : ((~ssList(U)) | (((~singletonP(U)) | (ssItem(tptp_fun_V_4(U)) & (cons(tptp_fun_V_4(U), nil) = U))) & (singletonP(U) | ![V: $i] : (~(ssItem(V) & (cons(V, nil) = U))))))),
% 0.21/0.48      inference(skolemize,[status(sab)],[24])).
% 0.21/0.48  tff(26,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[25, 18])).
% 0.21/0.48  tff(27,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[26, 16])).
% 0.21/0.48  tff(28,plain,
% 0.21/0.48      (((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | ((~ssList(U!45)) | (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))))))) <=> ((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | (~ssList(U!45)) | (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(29,plain,
% 0.21/0.48      (((~ssList(U!45)) | (~((~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))) | (~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45)))))))) <=> ((~ssList(U!45)) | (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(30,plain,
% 0.21/0.48      (((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | ((~ssList(U!45)) | (~((~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))) | (~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))))))) <=> ((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | ((~ssList(U!45)) | (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))))))))))),
% 0.21/0.48      inference(monotonicity,[status(thm)],[29])).
% 0.21/0.48  tff(31,plain,
% 0.21/0.48      (((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | ((~ssList(U!45)) | (~((~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))) | (~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))))))) <=> ((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | (~ssList(U!45)) | (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))))))),
% 0.21/0.48      inference(transitivity,[status(thm)],[30, 28])).
% 0.21/0.48  tff(32,plain,
% 0.21/0.48      ((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | ((~ssList(U!45)) | (~((~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))) | (~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))))))),
% 0.21/0.48      inference(quant_inst,[status(thm)],[])).
% 0.21/0.48  tff(33,plain,
% 0.21/0.48      ((~![U: $i] : ((~ssList(U)) | (~((~((~singletonP(U)) | (~((~ssItem(tptp_fun_V_4(U))) | (~(cons(tptp_fun_V_4(U), nil) = U)))))) | (~(singletonP(U) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U))))))))) | (~ssList(U!45)) | (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))))))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[32, 31])).
% 0.21/0.48  tff(34,plain,
% 0.21/0.48      (~((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))))),
% 0.21/0.48      inference(unit_resolution,[status(thm)],[33, 27, 11])).
% 0.21/0.48  tff(35,plain,
% 0.21/0.48      (((~(singletonP(U!45) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = U!45))))) | (~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))))))) | ((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))),
% 0.21/0.48      inference(tautology,[status(thm)],[])).
% 0.21/0.48  tff(36,plain,
% 0.21/0.48      ((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))))),
% 0.21/0.48      inference(unit_resolution,[status(thm)],[35, 34])).
% 0.21/0.48  tff(37,plain,
% 0.21/0.48      (~((~singletonP(U!45)) | neq(U!45, nil) | (~ssList(U!45)) | (~ssList(V!46)) | (~neq(V!46, nil)))),
% 0.21/0.48      inference(and_elim,[status(thm)],[10])).
% 0.21/0.48  tff(38,plain,
% 0.21/0.48      (singletonP(U!45)),
% 0.21/0.48      inference(or_elim,[status(thm)],[37])).
% 0.21/0.48  tff(39,plain,
% 0.21/0.48      ((~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))) | (~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))))),
% 0.21/0.48      inference(tautology,[status(thm)],[])).
% 0.21/0.48  tff(40,plain,
% 0.21/0.48      ((~((~singletonP(U!45)) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))))) | (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))))),
% 0.21/0.48      inference(unit_resolution,[status(thm)],[39, 38])).
% 0.21/0.48  tff(41,plain,
% 0.21/0.48      (~((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45)))),
% 0.21/0.48      inference(unit_resolution,[status(thm)],[40, 36])).
% 0.21/0.48  tff(42,plain,
% 0.21/0.48      (((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))) | (cons(tptp_fun_V_4(U!45), nil) = U!45)),
% 0.21/0.48      inference(tautology,[status(thm)],[])).
% 0.21/0.48  tff(43,plain,
% 0.21/0.48      (cons(tptp_fun_V_4(U!45), nil) = U!45),
% 0.21/0.48      inference(unit_resolution,[status(thm)],[42, 41])).
% 0.21/0.48  tff(44,plain,
% 0.21/0.48      ((cons(tptp_fun_V_4(U!45), nil) = nil) <=> (U!45 = nil)),
% 0.21/0.48      inference(monotonicity,[status(thm)],[43])).
% 0.21/0.48  tff(45,plain,
% 0.21/0.48      ((cons(tptp_fun_V_4(U!45), nil) = nil) <=> (nil = U!45)),
% 0.21/0.48      inference(transitivity,[status(thm)],[44, 1])).
% 0.21/0.48  tff(46,plain,
% 0.21/0.48      ((nil = U!45) <=> (cons(tptp_fun_V_4(U!45), nil) = nil)),
% 0.21/0.48      inference(symmetry,[status(thm)],[45])).
% 0.21/0.48  tff(47,plain,
% 0.21/0.48      (^[U: $i] : refl(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(48,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[47])).
% 0.21/0.48  tff(49,plain,
% 0.21/0.48      (^[U: $i] : rewrite(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(50,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[49])).
% 0.21/0.48  tff(51,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(transitivity,[status(thm)],[50, 48])).
% 0.21/0.48  tff(52,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(53,plain,
% 0.21/0.48      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : trans(monotonicity(trans(rewrite((neq(U, V) <=> (~(U = V))) <=> (~((U = V) <=> neq(U, V)))), rewrite((~((U = V) <=> neq(U, V))) <=> (~((U = V) <=> neq(U, V)))), ((neq(U, V) <=> (~(U = V))) <=> (~((U = V) <=> neq(U, V))))), ((ssList(V) => (neq(U, V) <=> (~(U = V)))) <=> (ssList(V) => (~((U = V) <=> neq(U, V)))))), rewrite((ssList(V) => (~((U = V) <=> neq(U, V)))) <=> ((~ssList(V)) | (~((U = V) <=> neq(U, V))))), ((ssList(V) => (neq(U, V) <=> (~(U = V)))) <=> ((~ssList(V)) | (~((U = V) <=> neq(U, V))))))), (![V: $i] : (ssList(V) => (neq(U, V) <=> (~(U = V)))) <=> ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))), ((ssList(U) => ![V: $i] : (ssList(V) => (neq(U, V) <=> (~(U = V))))) <=> (ssList(U) => ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))))), rewrite((ssList(U) => ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))), ((ssList(U) => ![V: $i] : (ssList(V) => (neq(U, V) <=> (~(U = V))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))))),
% 0.21/0.48      inference(bind,[status(th)],[])).
% 0.21/0.48  tff(54,plain,
% 0.21/0.48      (![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => (neq(U, V) <=> (~(U = V))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(quant_intro,[status(thm)],[53])).
% 0.21/0.48  tff(55,axiom,(![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => (neq(U, V) <=> (~(U = V)))))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax15')).
% 0.21/0.48  tff(56,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[55, 54])).
% 0.21/0.48  tff(57,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[56, 52])).
% 0.21/0.48  tff(58,plain,(
% 0.21/0.48      ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(skolemize,[status(sab)],[57])).
% 0.21/0.48  tff(59,plain,
% 0.21/0.48      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[58, 51])).
% 0.21/0.48  tff(60,plain,
% 0.21/0.48      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))) | ((~ssList(U!45)) | ![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V)))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))) | (~ssList(U!45)) | ![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V)))))),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(61,plain,
% 0.21/0.48      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))) | ((~ssList(U!45)) | ![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V)))))),
% 0.21/0.48      inference(quant_inst,[status(thm)],[])).
% 0.21/0.48  tff(62,plain,
% 0.21/0.48      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((U = V) <=> neq(U, V)))))) | (~ssList(U!45)) | ![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V))))),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[61, 60])).
% 0.21/0.48  tff(63,plain,
% 0.21/0.48      (![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V))))),
% 0.21/0.48      inference(unit_resolution,[status(thm)],[62, 59, 11])).
% 0.21/0.48  tff(64,plain,
% 0.21/0.48      (ssList(nil) <=> ssList(nil)),
% 0.21/0.48      inference(rewrite,[status(thm)],[])).
% 0.21/0.48  tff(65,axiom,(ssList(nil)), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax17')).
% 0.21/0.48  tff(66,plain,
% 0.21/0.48      (ssList(nil)),
% 0.21/0.48      inference(modus_ponens,[status(thm)],[65, 64])).
% 0.21/0.48  tff(67,plain,
% 0.21/0.48      (((~![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V))))) | ((~ssList(nil)) | (~((U!45 = nil) <=> neq(U!45, nil))))) <=> ((~![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V))))) | (~ssList(nil)) | (~((U!45 = nil) <=> neq(U!45, nil))))),
% 0.21/0.49      inference(rewrite,[status(thm)],[])).
% 0.21/0.49  tff(68,plain,
% 0.21/0.49      ((~![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V))))) | ((~ssList(nil)) | (~((U!45 = nil) <=> neq(U!45, nil))))),
% 0.21/0.49      inference(quant_inst,[status(thm)],[])).
% 0.21/0.49  tff(69,plain,
% 0.21/0.49      ((~![V: $i] : ((~ssList(V)) | (~((U!45 = V) <=> neq(U!45, V))))) | (~ssList(nil)) | (~((U!45 = nil) <=> neq(U!45, nil)))),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[68, 67])).
% 0.21/0.49  tff(70,plain,
% 0.21/0.49      (~((U!45 = nil) <=> neq(U!45, nil))),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[69, 66, 63])).
% 0.21/0.49  tff(71,plain,
% 0.21/0.49      (~neq(U!45, nil)),
% 0.21/0.49      inference(or_elim,[status(thm)],[37])).
% 0.21/0.49  tff(72,plain,
% 0.21/0.49      (((U!45 = nil) <=> neq(U!45, nil)) | (U!45 = nil) | neq(U!45, nil)),
% 0.21/0.49      inference(tautology,[status(thm)],[])).
% 0.21/0.49  tff(73,plain,
% 0.21/0.49      (((U!45 = nil) <=> neq(U!45, nil)) | (U!45 = nil)),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[72, 71])).
% 0.21/0.49  tff(74,plain,
% 0.21/0.49      (U!45 = nil),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[73, 70])).
% 0.21/0.49  tff(75,plain,
% 0.21/0.49      (nil = U!45),
% 0.21/0.49      inference(symmetry,[status(thm)],[74])).
% 0.21/0.49  tff(76,plain,
% 0.21/0.49      (cons(tptp_fun_V_4(U!45), nil) = nil),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[75, 46])).
% 0.21/0.49  tff(77,plain,
% 0.21/0.49      (((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = U!45))) | ssItem(tptp_fun_V_4(U!45))),
% 0.21/0.49      inference(tautology,[status(thm)],[])).
% 0.21/0.49  tff(78,plain,
% 0.21/0.49      (ssItem(tptp_fun_V_4(U!45))),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[77, 41])).
% 0.21/0.49  tff(79,plain,
% 0.21/0.49      (^[U: $i] : refl(((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))))),
% 0.21/0.49      inference(bind,[status(th)],[])).
% 0.21/0.49  tff(80,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(quant_intro,[status(thm)],[79])).
% 0.21/0.49  tff(81,plain,
% 0.21/0.49      (^[U: $i] : rewrite(((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))))),
% 0.21/0.49      inference(bind,[status(th)],[])).
% 0.21/0.49  tff(82,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(quant_intro,[status(thm)],[81])).
% 0.21/0.49  tff(83,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(transitivity,[status(thm)],[82, 80])).
% 0.21/0.49  tff(84,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(rewrite,[status(thm)],[])).
% 0.21/0.49  tff(85,plain,
% 0.21/0.49      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : rewrite((ssItem(V) => (~(cons(V, U) = U))) <=> ((~ssItem(V)) | (~(cons(V, U) = U))))), (![V: $i] : (ssItem(V) => (~(cons(V, U) = U))) <=> ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))), ((ssList(U) => ![V: $i] : (ssItem(V) => (~(cons(V, U) = U)))) <=> (ssList(U) => ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))))), rewrite((ssList(U) => ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U)))) <=> ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))), ((ssList(U) => ![V: $i] : (ssItem(V) => (~(cons(V, U) = U)))) <=> ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))))),
% 0.21/0.49      inference(bind,[status(th)],[])).
% 0.21/0.49  tff(86,plain,
% 0.21/0.49      (![U: $i] : (ssList(U) => ![V: $i] : (ssItem(V) => (~(cons(V, U) = U)))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(quant_intro,[status(thm)],[85])).
% 0.21/0.49  tff(87,axiom,(![U: $i] : (ssList(U) => ![V: $i] : (ssItem(V) => (~(cons(V, U) = U))))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax18')).
% 0.21/0.49  tff(88,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[87, 86])).
% 0.21/0.49  tff(89,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[88, 84])).
% 0.21/0.49  tff(90,plain,(
% 0.21/0.49      ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(skolemize,[status(sab)],[89])).
% 0.21/0.49  tff(91,plain,
% 0.21/0.49      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[90, 83])).
% 0.21/0.49  tff(92,plain,
% 0.21/0.49      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))) | ((~ssList(nil)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))) | (~ssList(nil)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil))))),
% 0.21/0.49      inference(rewrite,[status(thm)],[])).
% 0.21/0.49  tff(93,plain,
% 0.21/0.49      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))) | ((~ssList(nil)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil))))),
% 0.21/0.49      inference(quant_inst,[status(thm)],[])).
% 0.21/0.49  tff(94,plain,
% 0.21/0.49      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, U) = U))))) | (~ssList(nil)) | ![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil)))),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[93, 92])).
% 0.21/0.49  tff(95,plain,
% 0.21/0.49      (![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil)))),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[94, 66, 91])).
% 0.21/0.49  tff(96,plain,
% 0.21/0.49      (((~![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil)))) | ((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = nil)))) <=> ((~![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil)))) | (~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = nil)))),
% 0.21/0.49      inference(rewrite,[status(thm)],[])).
% 0.21/0.49  tff(97,plain,
% 0.21/0.49      ((~![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil)))) | ((~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = nil)))),
% 0.21/0.49      inference(quant_inst,[status(thm)],[])).
% 0.21/0.49  tff(98,plain,
% 0.21/0.49      ((~![V: $i] : ((~ssItem(V)) | (~(cons(V, nil) = nil)))) | (~ssItem(tptp_fun_V_4(U!45))) | (~(cons(tptp_fun_V_4(U!45), nil) = nil))),
% 0.21/0.49      inference(modus_ponens,[status(thm)],[97, 96])).
% 0.21/0.49  tff(99,plain,
% 0.21/0.49      (~(cons(tptp_fun_V_4(U!45), nil) = nil)),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[98, 95, 78])).
% 0.21/0.49  tff(100,plain,
% 0.21/0.49      ($false),
% 0.21/0.49      inference(unit_resolution,[status(thm)],[99, 76])).
% 0.21/0.49  % SZS output end Proof
% 0.21/0.49  % E exiting
%------------------------------------------------------------------------------