↑ Up

Z3---4.15.1.THM-Prf.s

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

% Result   : Theorem 1.07s 1.27s
% Output   : Proof 1.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC010+1 : TPTP v9.0.0. Released v2.4.0.
% 0.07/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:00:24 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 1.07/1.27  % SZS status Theorem
% 1.07/1.27  % SZS output start Proof
% 1.07/1.27  tff(tptp_fun_V_46_type, type, (
% 1.07/1.27     tptp_fun_V_46: $i)).
% 1.07/1.27  tff(app_type, type, (
% 1.07/1.27     app: ( $i * $i ) > $i)).
% 1.07/1.27  tff(cons_type, type, (
% 1.07/1.27     cons: ( $i * $i ) > $i)).
% 1.07/1.27  tff(nil_type, type, (
% 1.07/1.27     nil: $i)).
% 1.07/1.27  tff(tptp_fun_X2_47_type, type, (
% 1.07/1.27     tptp_fun_X2_47: $i)).
% 1.07/1.27  tff(tptp_fun_X3_48_type, type, (
% 1.07/1.27     tptp_fun_X3_48: $i)).
% 1.07/1.27  tff(tptp_fun_U_45_type, type, (
% 1.07/1.27     tptp_fun_U_45: $i)).
% 1.07/1.27  tff(ssList_type, type, (
% 1.07/1.27     ssList: $i > $o)).
% 1.07/1.27  tff(ssItem_type, type, (
% 1.07/1.27     ssItem: $i > $o)).
% 1.07/1.27  tff(neq_type, type, (
% 1.07/1.27     neq: ( $i * $i ) > $o)).
% 1.07/1.27  tff(geq_type, type, (
% 1.07/1.27     geq: ( $i * $i ) > $o)).
% 1.07/1.27  tff(memberP_type, type, (
% 1.07/1.27     memberP: ( $i * $i ) > $o)).
% 1.07/1.27  tff(tptp_fun_X4_49_type, type, (
% 1.07/1.27     tptp_fun_X4_49: $i)).
% 1.07/1.27  tff(1,plain,
% 1.07/1.27      (^[Y: $i] : refl(((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))) <=> ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))))),
% 1.07/1.27      inference(bind,[status(th)],[])).
% 1.07/1.27  tff(2,plain,
% 1.07/1.27      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))) <=> ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))),
% 1.07/1.27      inference(quant_intro,[status(thm)],[1])).
% 1.07/1.27  tff(3,plain,
% 1.07/1.27      (^[Y: $i] : rewrite(((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))) <=> ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))))),
% 1.07/1.27      inference(bind,[status(th)],[])).
% 1.07/1.27  tff(4,plain,
% 1.07/1.27      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))) <=> ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))),
% 1.07/1.27      inference(quant_intro,[status(thm)],[3])).
% 1.07/1.27  tff(5,plain,
% 1.07/1.27      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))) <=> ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))),
% 1.07/1.27      inference(transitivity,[status(thm)],[4, 2])).
% 1.07/1.27  tff(6,plain,
% 1.07/1.27      (^[Y: $i] : rewrite(((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) <=> ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46))))))),
% 1.07/1.27      inference(bind,[status(th)],[])).
% 1.07/1.27  tff(7,plain,
% 1.07/1.27      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) <=> ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))),
% 1.07/1.27      inference(quant_intro,[status(thm)],[6])).
% 1.07/1.27  tff(8,plain,
% 1.07/1.27      ((ssList(U!45) & (ssList(V!46) & ssList(U!45) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))) <=> (ssList(U!45) & ssList(V!46) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(9,plain,
% 1.07/1.27      ((ssList(V!46) & ssList(U!45) & (ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil)) <=> (ssList(V!46) & ssList(U!45) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(10,plain,
% 1.07/1.27      ((ssItem(X2!47) & (ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))) <=> (ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(11,plain,
% 1.07/1.27      ((ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))) <=> (ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(12,plain,
% 1.07/1.27      (((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))) <=> ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(13,plain,
% 1.07/1.27      ((ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))) <=> (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))),
% 1.07/1.27      inference(monotonicity,[status(thm)],[12])).
% 1.07/1.27  tff(14,plain,
% 1.07/1.27      ((ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))) <=> (ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))),
% 1.07/1.27      inference(transitivity,[status(thm)],[13, 11])).
% 1.07/1.27  tff(15,plain,
% 1.07/1.27      ((ssItem(X2!47) & (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))) <=> (ssItem(X2!47) & (ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))),
% 1.07/1.27      inference(monotonicity,[status(thm)],[14])).
% 1.07/1.27  tff(16,plain,
% 1.07/1.27      ((ssItem(X2!47) & (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))) <=> (ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))))),
% 1.07/1.27      inference(transitivity,[status(thm)],[15, 10])).
% 1.07/1.27  tff(17,plain,
% 1.07/1.27      ((ssList(V!46) & ssList(U!45) & (ssItem(X2!47) & (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil)) <=> (ssList(V!46) & ssList(U!45) & (ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))),
% 1.07/1.27      inference(monotonicity,[status(thm)],[16])).
% 1.07/1.27  tff(18,plain,
% 1.07/1.27      ((ssList(V!46) & ssList(U!45) & (ssItem(X2!47) & (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil)) <=> (ssList(V!46) & ssList(U!45) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))),
% 1.07/1.27      inference(transitivity,[status(thm)],[17, 9])).
% 1.07/1.27  tff(19,plain,
% 1.07/1.27      ((ssList(U!45) & (ssList(V!46) & ssList(U!45) & (ssItem(X2!47) & (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))) <=> (ssList(U!45) & (ssList(V!46) & ssList(U!45) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil)))),
% 1.07/1.27      inference(monotonicity,[status(thm)],[18])).
% 1.07/1.27  tff(20,plain,
% 1.07/1.27      ((ssList(U!45) & (ssList(V!46) & ssList(U!45) & (ssItem(X2!47) & (ssList(X3!48) & ((app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47)))))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))) <=> (ssList(U!45) & ssList(V!46) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil))),
% 1.07/1.27      inference(transitivity,[status(thm)],[19, 8])).
% 1.07/1.27  tff(21,plain,
% 1.07/1.27      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil)))))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(22,plain,
% 1.07/1.27      ((~![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] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : ((ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V)) & (app(Z, X1) = U))))) | ![X2: $i] : (ssItem(X2) => ![X3: $i] : (ssList(X3) => ![X4: $i] : (ssList(X4) => (((~(app(app(X3, cons(X2, nil)), X4) = X)) | (~(app(X3, X4) = W))) | ?[X5: $i] : (((ssItem(X5) & (~(X2 = X5))) & memberP(X, X5)) & geq(X5, X2))))))) & ((~neq(V, nil)) | neq(X, nil))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil)))))),
% 1.07/1.27      inference(rewrite,[status(thm)],[])).
% 1.07/1.27  tff(23,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] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : ((ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V)) & (app(Z, X1) = U))))) | ![X2: $i] : (ssItem(X2) => ![X3: $i] : (ssList(X3) => ![X4: $i] : (ssList(X4) => (((~(app(app(X3, cons(X2, nil)), X4) = X)) | (~(app(X3, X4) = W))) | ?[X5: $i] : (((ssItem(X5) & (~(X2 = X5))) & memberP(X, X5)) & geq(X5, X2))))))) & ((~neq(V, nil)) | neq(X, nil))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','co1')).
% 1.07/1.27  tff(24,plain,
% 1.07/1.27      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil))))),
% 1.07/1.27      inference(modus_ponens,[status(thm)],[23, 22])).
% 1.07/1.27  tff(25,plain,
% 1.07/1.27      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil))))),
% 1.07/1.27      inference(modus_ponens,[status(thm)],[24, 21])).
% 1.07/1.27  tff(26,plain,
% 1.07/1.27      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil))))),
% 1.07/1.27      inference(modus_ponens,[status(thm)],[25, 21])).
% 1.07/1.28  tff(27,plain,
% 1.07/1.28      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~ssList(U)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : ((~ssList(X3)) | ![X4: $i] : ((~(app(X3, X4) = U)) | (~(app(app(X3, cons(X2, nil)), X4) = V)) | (~ssList(X4)) | ?[X5: $i] : (ssItem(X5) & (~(X2 = X5)) & memberP(V, X5) & geq(X5, X2))))) | ?[Y: $i] : (ssItem(Y) & ?[Z: $i] : (ssList(Z) & ?[X1: $i] : (ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V) & (app(Z, X1) = U)))) | (~neq(V, nil))))),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[26, 21])).
% 1.07/1.28  tff(28,plain,
% 1.07/1.28      (ssList(U!45) & ssList(V!46) & ssItem(X2!47) & ssList(X3!48) & (app(X3!48, X4!49) = U!45) & (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46) & ssList(X4!49) & ![X5: $i] : (~(ssItem(X5) & (~(X2!47 = X5)) & memberP(V!46, X5) & geq(X5, X2!47))) & ![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45))))) & neq(V!46, nil)),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[27, 20])).
% 1.07/1.28  tff(29,plain,
% 1.07/1.28      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : (~(ssList(X1) & (app(app(Z, cons(Y, nil)), X1) = V!46) & (app(Z, X1) = U!45)))))),
% 1.07/1.28      inference(and_elim,[status(thm)],[28])).
% 1.07/1.28  tff(30,plain,
% 1.07/1.28      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[29, 7])).
% 1.07/1.28  tff(31,plain,
% 1.07/1.28      (![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[30, 5])).
% 1.07/1.28  tff(32,plain,
% 1.07/1.28      (ssItem(X2!47)),
% 1.07/1.28      inference(and_elim,[status(thm)],[28])).
% 1.07/1.28  tff(33,plain,
% 1.07/1.28      (((~![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))) | ((~ssItem(X2!47)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46)))))) <=> ((~![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))) | (~ssItem(X2!47)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46)))))),
% 1.07/1.28      inference(rewrite,[status(thm)],[])).
% 1.07/1.28  tff(34,plain,
% 1.07/1.28      ((~![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))) | ((~ssItem(X2!47)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46)))))),
% 1.07/1.28      inference(quant_inst,[status(thm)],[])).
% 1.07/1.28  tff(35,plain,
% 1.07/1.28      ((~![Y: $i] : ((~ssItem(Y)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(Y, nil)), X1) = V!46)))))) | (~ssItem(X2!47)) | ![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46))))),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[34, 33])).
% 1.07/1.28  tff(36,plain,
% 1.07/1.28      (![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46))))),
% 1.07/1.28      inference(unit_resolution,[status(thm)],[35, 32, 31])).
% 1.07/1.28  tff(37,plain,
% 1.07/1.28      (ssList(X3!48)),
% 1.07/1.28      inference(and_elim,[status(thm)],[28])).
% 1.07/1.28  tff(38,plain,
% 1.07/1.28      (((~![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46))))) | ((~ssList(X3!48)) | ![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46))))) <=> ((~![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46))))) | (~ssList(X3!48)) | ![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46))))),
% 1.07/1.28      inference(rewrite,[status(thm)],[])).
% 1.07/1.28  tff(39,plain,
% 1.07/1.28      ((~![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46))))) | ((~ssList(X3!48)) | ![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46))))),
% 1.07/1.28      inference(quant_inst,[status(thm)],[])).
% 1.07/1.28  tff(40,plain,
% 1.07/1.28      ((~![Z: $i] : ((~ssList(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(Z, X1) = U!45)) | (~(app(app(Z, cons(X2!47, nil)), X1) = V!46))))) | (~ssList(X3!48)) | ![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46)))),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[39, 38])).
% 1.07/1.28  tff(41,plain,
% 1.07/1.28      (![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46)))),
% 1.07/1.28      inference(unit_resolution,[status(thm)],[40, 37, 36])).
% 1.07/1.28  tff(42,plain,
% 1.07/1.28      (ssList(X4!49)),
% 1.07/1.28      inference(and_elim,[status(thm)],[28])).
% 1.07/1.28  tff(43,plain,
% 1.07/1.28      (app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46),
% 1.07/1.28      inference(and_elim,[status(thm)],[28])).
% 1.07/1.28  tff(44,plain,
% 1.07/1.28      (app(X3!48, X4!49) = U!45),
% 1.07/1.28      inference(and_elim,[status(thm)],[28])).
% 1.07/1.28  tff(45,plain,
% 1.07/1.28      (((~![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46)))) | ((~ssList(X4!49)) | (~(app(X3!48, X4!49) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46)))) <=> ((~![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46)))) | (~ssList(X4!49)) | (~(app(X3!48, X4!49) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46)))),
% 1.07/1.28      inference(rewrite,[status(thm)],[])).
% 1.07/1.28  tff(46,plain,
% 1.07/1.28      ((~![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46)))) | ((~ssList(X4!49)) | (~(app(X3!48, X4!49) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46)))),
% 1.07/1.28      inference(quant_inst,[status(thm)],[])).
% 1.07/1.28  tff(47,plain,
% 1.07/1.28      ((~![X1: $i] : ((~ssList(X1)) | (~(app(X3!48, X1) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X1) = V!46)))) | (~ssList(X4!49)) | (~(app(X3!48, X4!49) = U!45)) | (~(app(app(X3!48, cons(X2!47, nil)), X4!49) = V!46))),
% 1.07/1.28      inference(modus_ponens,[status(thm)],[46, 45])).
% 1.07/1.28  tff(48,plain,
% 1.07/1.28      ($false),
% 1.07/1.28      inference(unit_resolution,[status(thm)],[47, 44, 43, 42, 41])).
% 1.07/1.28  % SZS output end Proof
% 1.07/1.29  % E exiting
%------------------------------------------------------------------------------