TSTP Solution File: SWC371+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SWC371+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n028.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 : Tue Sep 20 11:57:29 EDT 2022

% Result   : Theorem 6.11s 4.19s
% Output   : Proof 6.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC371+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sun Sep  4 00:34:54 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35  Usage: tptp [options] [-file:]file
% 0.13/0.35    -h, -?       prints this message.
% 0.13/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.35    -m, -model   generate model.
% 0.13/0.35    -p, -proof   generate proof.
% 0.13/0.35    -c, -core    generate unsat core of named formulas.
% 0.13/0.35    -st, -statistics display statistics.
% 0.13/0.35    -t:timeout   set timeout (in second).
% 0.13/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35    -<param>:<value> configuration parameter and value.
% 0.13/0.35    -o:<output-file> file to place output in.
% 6.11/4.19  % SZS status Theorem
% 6.11/4.19  % SZS output start Proof
% 6.11/4.19  tff(segmentP_type, type, (
% 6.11/4.19     segmentP: ( $i * $i ) > $o)).
% 6.11/4.19  tff(tptp_fun_W_49_type, type, (
% 6.11/4.19     tptp_fun_W_49: $i)).
% 6.11/4.19  tff(app_type, type, (
% 6.11/4.19     app: ( $i * $i ) > $i)).
% 6.11/4.19  tff(tptp_fun_Y_51_type, type, (
% 6.11/4.19     tptp_fun_Y_51: $i)).
% 6.11/4.19  tff(tptp_fun_W_6_type, type, (
% 6.11/4.19     tptp_fun_W_6: ( $i * $i ) > $i)).
% 6.11/4.19  tff(nil_type, type, (
% 6.11/4.19     nil: $i)).
% 6.11/4.19  tff(tptp_fun_U_47_type, type, (
% 6.11/4.19     tptp_fun_U_47: $i)).
% 6.11/4.19  tff(tptp_fun_V_48_type, type, (
% 6.11/4.19     tptp_fun_V_48: $i)).
% 6.11/4.19  tff(leq_type, type, (
% 6.11/4.19     leq: ( $i * $i ) > $o)).
% 6.11/4.19  tff(cons_type, type, (
% 6.11/4.19     cons: ( $i * $i ) > $i)).
% 6.11/4.19  tff(ssList_type, type, (
% 6.11/4.19     ssList: $i > $o)).
% 6.11/4.19  tff(ssItem_type, type, (
% 6.11/4.19     ssItem: $i > $o)).
% 6.11/4.19  tff(tptp_fun_X_50_type, type, (
% 6.11/4.19     tptp_fun_X_50: $i)).
% 6.11/4.19  tff(totalorderedP_type, type, (
% 6.11/4.19     totalorderedP: $i > $o)).
% 6.11/4.19  tff(rearsegP_type, type, (
% 6.11/4.19     rearsegP: ( $i * $i ) > $o)).
% 6.11/4.19  tff(1,plain,
% 6.11/4.19      ((ssList(U!47) & (ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))) <=> (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(2,plain,
% 6.11/4.19      ((ssList(V!48) & (ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))) <=> (ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(3,plain,
% 6.11/4.19      ((ssList(W!49) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))) <=> (ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(4,plain,
% 6.11/4.19      (((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & (totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))) <=> ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(5,plain,
% 6.11/4.19      (((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))) <=> (totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(6,plain,
% 6.11/4.19      ((~(~ssList(X!50))) <=> ssList(X!50)),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(7,plain,
% 6.11/4.19      ((~(~(U!47 = W!49))) <=> (U!47 = W!49)),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(8,plain,
% 6.11/4.19      ((~(~(V!48 = X!50))) <=> (V!48 = X!50)),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(9,plain,
% 6.11/4.19      (((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))) <=> ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & (totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))),
% 6.11/4.19      inference(monotonicity,[status(thm)],[8, 7, 6, 5])).
% 6.11/4.19  tff(10,plain,
% 6.11/4.19      (((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))) <=> ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(transitivity,[status(thm)],[9, 4])).
% 6.11/4.19  tff(11,plain,
% 6.11/4.19      ((~(~ssList(W!49))) <=> ssList(W!49)),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(12,plain,
% 6.11/4.19      (((~(~ssList(W!49))) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))) <=> (ssList(W!49) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))),
% 6.11/4.19      inference(monotonicity,[status(thm)],[11, 10])).
% 6.11/4.19  tff(13,plain,
% 6.11/4.19      (((~(~ssList(W!49))) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))) <=> (ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(transitivity,[status(thm)],[12, 3])).
% 6.11/4.19  tff(14,plain,
% 6.11/4.19      ((~(~ssList(V!48))) <=> ssList(V!48)),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(15,plain,
% 6.11/4.19      (((~(~ssList(V!48))) & ((~(~ssList(W!49))) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))))) <=> (ssList(V!48) & (ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))),
% 6.11/4.19      inference(monotonicity,[status(thm)],[14, 13])).
% 6.11/4.19  tff(16,plain,
% 6.11/4.19      (((~(~ssList(V!48))) & ((~(~ssList(W!49))) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))))) <=> (ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(transitivity,[status(thm)],[15, 2])).
% 6.11/4.19  tff(17,plain,
% 6.11/4.19      ((~(~ssList(U!47))) <=> ssList(U!47)),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(18,plain,
% 6.11/4.19      (((~(~ssList(U!47))) & ((~(~ssList(V!48))) & ((~(~ssList(W!49))) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))))) <=> (ssList(U!47) & (ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))),
% 6.11/4.19      inference(monotonicity,[status(thm)],[17, 16])).
% 6.11/4.19  tff(19,plain,
% 6.11/4.19      (((~(~ssList(U!47))) & ((~(~ssList(V!48))) & ((~(~ssList(W!49))) & ((~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (~(~(V!48 = X!50))) & (~(~(U!47 = W!49))) & (~(~ssList(X!50))) & ((~(~totalorderedP(W!49))) & (~(~(app(W!49, Y!51) = X!50))) & (~(~ssList(Y!51))) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))))))) <=> (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z)))))))),
% 6.11/4.19      inference(transitivity,[status(thm)],[18, 1])).
% 6.11/4.19  tff(20,plain,
% 6.11/4.19      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z)))))))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(21,plain,
% 6.11/4.19      ((~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (((((~(V = X)) | (~(U = W))) | ![Y: $i] : (ssList(Y) => (((~(app(W, Y) = X)) | (~totalorderedP(W))) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : ((ssList(X1) & (app(cons(Z, nil), X1) = Y)) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : ((ssList(X3) & (app(X3, cons(X2, nil)) = W)) & leq(X2, Z)))))))) | segmentP(V, U)) | ((~(nil = X)) & (nil = W)))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z)))))))))))),
% 6.11/4.19      inference(rewrite,[status(thm)],[])).
% 6.11/4.19  tff(22,axiom,(~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (((((~(V = X)) | (~(U = W))) | ![Y: $i] : (ssList(Y) => (((~(app(W, Y) = X)) | (~totalorderedP(W))) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : ((ssList(X1) & (app(cons(Z, nil), X1) = Y)) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : ((ssList(X3) & (app(X3, cons(X2, nil)) = W)) & leq(X2, Z)))))))) | segmentP(V, U)) | ((~(nil = X)) & (nil = W)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','co1')).
% 6.11/4.19  tff(23,plain,
% 6.11/4.19      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.19      inference(modus_ponens,[status(thm)],[22, 21])).
% 6.11/4.19  tff(24,plain,
% 6.11/4.19      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.19      inference(modus_ponens,[status(thm)],[23, 20])).
% 6.11/4.19  tff(25,plain,
% 6.11/4.19      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[24, 20])).
% 6.11/4.20  tff(26,plain,
% 6.11/4.20      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[25, 20])).
% 6.11/4.20  tff(27,plain,
% 6.11/4.20      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[26, 20])).
% 6.11/4.20  tff(28,plain,
% 6.11/4.20      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[27, 20])).
% 6.11/4.20  tff(29,plain,
% 6.11/4.20      (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(V, U) | ((~(nil = X)) & (nil = W)) | (~(V = X)) | (~(U = W)) | (~ssList(X)) | ![Y: $i] : ((~totalorderedP(W)) | (~(app(W, Y) = X)) | (~ssList(Y)) | ?[Z: $i] : (ssItem(Z) & ?[X1: $i] : (ssList(X1) & (app(cons(Z, nil), X1) = Y) & ?[X2: $i] : (ssItem(X2) & ?[X3: $i] : (ssList(X3) & (app(X3, cons(X2, nil)) = W) & leq(X2, Z))))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[28, 20])).
% 6.11/4.20  tff(30,plain,
% 6.11/4.20      (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~segmentP(V!48, U!47)) & (~((~(nil = X!50)) & (nil = W!49))) & (V!48 = X!50) & (U!47 = W!49) & ssList(X!50) & totalorderedP(W!49) & (app(W!49, Y!51) = X!50) & ssList(Y!51) & ![Z: $i] : ((~ssItem(Z)) | ![X1: $i] : ((~ssList(X1)) | (~(app(cons(Z, nil), X1) = Y!51)) | ![X2: $i] : ((~ssItem(X2)) | ![X3: $i] : (~(ssList(X3) & (app(X3, cons(X2, nil)) = W!49) & leq(X2, Z))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[29, 19])).
% 6.11/4.20  tff(31,plain,
% 6.11/4.20      (U!47 = W!49),
% 6.11/4.20      inference(and_elim,[status(thm)],[30])).
% 6.11/4.20  tff(32,plain,
% 6.11/4.20      (W!49 = U!47),
% 6.11/4.20      inference(symmetry,[status(thm)],[31])).
% 6.11/4.20  tff(33,plain,
% 6.11/4.20      (V!48 = X!50),
% 6.11/4.20      inference(and_elim,[status(thm)],[30])).
% 6.11/4.20  tff(34,plain,
% 6.11/4.20      (X!50 = V!48),
% 6.11/4.20      inference(symmetry,[status(thm)],[33])).
% 6.11/4.20  tff(35,plain,
% 6.11/4.20      (app(W!49, Y!51) = X!50),
% 6.11/4.20      inference(and_elim,[status(thm)],[30])).
% 6.11/4.20  tff(36,plain,
% 6.11/4.20      (ssList(W!49)),
% 6.11/4.20      inference(and_elim,[status(thm)],[30])).
% 6.11/4.20  tff(37,plain,
% 6.11/4.20      (^[U: $i] : refl(((~ssList(U)) | (app(nil, U) = U)) <=> ((~ssList(U)) | (app(nil, U) = U)))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(38,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(nil, U) = U)) <=> ![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[37])).
% 6.11/4.20  tff(39,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(nil, U) = U)) <=> ![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(40,plain,
% 6.11/4.20      (^[U: $i] : rewrite((ssList(U) => (app(nil, U) = U)) <=> ((~ssList(U)) | (app(nil, U) = U)))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(41,plain,
% 6.11/4.20      (![U: $i] : (ssList(U) => (app(nil, U) = U)) <=> ![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[40])).
% 6.11/4.20  tff(42,axiom,(![U: $i] : (ssList(U) => (app(nil, U) = U))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax28')).
% 6.11/4.20  tff(43,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[42, 41])).
% 6.11/4.20  tff(44,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[43, 39])).
% 6.11/4.20  tff(45,plain,(
% 6.11/4.20      ![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(skolemize,[status(sab)],[44])).
% 6.11/4.20  tff(46,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(nil, U) = U))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[45, 38])).
% 6.11/4.20  tff(47,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | (app(nil, U) = U))) | ((~ssList(W!49)) | (app(nil, W!49) = W!49))) <=> ((~![U: $i] : ((~ssList(U)) | (app(nil, U) = U))) | (~ssList(W!49)) | (app(nil, W!49) = W!49))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(48,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | (app(nil, U) = U))) | ((~ssList(W!49)) | (app(nil, W!49) = W!49))),
% 6.11/4.20      inference(quant_inst,[status(thm)],[])).
% 6.11/4.20  tff(49,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | (app(nil, U) = U))) | (~ssList(W!49)) | (app(nil, W!49) = W!49)),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[48, 47])).
% 6.11/4.20  tff(50,plain,
% 6.11/4.20      (app(nil, W!49) = W!49),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[49, 46, 36])).
% 6.11/4.20  tff(51,plain,
% 6.11/4.20      (^[U: $i] : refl(((~ssList(U)) | (app(U, nil) = U)) <=> ((~ssList(U)) | (app(U, nil) = U)))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(52,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(U, nil) = U)) <=> ![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[51])).
% 6.11/4.20  tff(53,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(U, nil) = U)) <=> ![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(54,plain,
% 6.11/4.20      (^[U: $i] : rewrite((ssList(U) => (app(U, nil) = U)) <=> ((~ssList(U)) | (app(U, nil) = U)))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(55,plain,
% 6.11/4.20      (![U: $i] : (ssList(U) => (app(U, nil) = U)) <=> ![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[54])).
% 6.11/4.20  tff(56,axiom,(![U: $i] : (ssList(U) => (app(U, nil) = U))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax84')).
% 6.11/4.20  tff(57,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[56, 55])).
% 6.11/4.20  tff(58,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[57, 53])).
% 6.11/4.20  tff(59,plain,(
% 6.11/4.20      ![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(skolemize,[status(sab)],[58])).
% 6.11/4.20  tff(60,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (app(U, nil) = U))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[59, 52])).
% 6.11/4.20  tff(61,plain,
% 6.11/4.20      (ssList(nil) <=> ssList(nil)),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(62,axiom,(ssList(nil)), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax17')).
% 6.11/4.20  tff(63,plain,
% 6.11/4.20      (ssList(nil)),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[62, 61])).
% 6.11/4.20  tff(64,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | (app(U, nil) = U))) | ((~ssList(nil)) | (app(nil, nil) = nil))) <=> ((~![U: $i] : ((~ssList(U)) | (app(U, nil) = U))) | (~ssList(nil)) | (app(nil, nil) = nil))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(65,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | (app(U, nil) = U))) | ((~ssList(nil)) | (app(nil, nil) = nil))),
% 6.11/4.20      inference(quant_inst,[status(thm)],[])).
% 6.11/4.20  tff(66,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | (app(U, nil) = U))) | (~ssList(nil)) | (app(nil, nil) = nil)),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[65, 64])).
% 6.11/4.20  tff(67,plain,
% 6.11/4.20      (app(nil, nil) = nil),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[66, 63, 60])).
% 6.11/4.20  tff(68,plain,
% 6.11/4.20      (nil = app(nil, nil)),
% 6.11/4.20      inference(symmetry,[status(thm)],[67])).
% 6.11/4.20  tff(69,plain,
% 6.11/4.20      (^[U: $i] : refl(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(70,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[69])).
% 6.11/4.20  tff(71,plain,
% 6.11/4.20      (^[U: $i] : rewrite(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(72,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[71])).
% 6.11/4.20  tff(73,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))),
% 6.11/4.20      inference(transitivity,[status(thm)],[72, 70])).
% 6.11/4.20  tff(74,plain,
% 6.11/4.20      (^[U: $i] : rewrite(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (((~rearsegP(U, V)) | (ssList(tptp_fun_W_6(V, U)) & (app(tptp_fun_W_6(V, U), V) = U))) & (rearsegP(U, V) | ![W: $i] : (~(ssList(W) & (app(W, V) = U))))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U))))))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(75,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (((~rearsegP(U, V)) | (ssList(tptp_fun_W_6(V, U)) & (app(tptp_fun_W_6(V, U), V) = U))) & (rearsegP(U, V) | ![W: $i] : (~(ssList(W) & (app(W, V) = U))))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[74])).
% 6.11/4.20  tff(76,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(77,plain,
% 6.11/4.20      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : trans(monotonicity(rewrite((rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))) <=> (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))), ((ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))) <=> (ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))), rewrite((ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))) <=> ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))), ((ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))) <=> ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))))), (![V: $i] : (ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))) <=> ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))), ((ssList(U) => ![V: $i] : (ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))) <=> (ssList(U) => ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))))), rewrite((ssList(U) => ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))), ((ssList(U) => ![V: $i] : (ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(78,plain,
% 6.11/4.20      (![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[77])).
% 6.11/4.20  tff(79,axiom,(![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax6')).
% 6.11/4.20  tff(80,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[79, 78])).
% 6.11/4.20  tff(81,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (rearsegP(U, V) <=> ?[W: $i] : (ssList(W) & (app(W, V) = U)))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[80, 76])).
% 6.11/4.20  tff(82,plain,(
% 6.11/4.20      ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (((~rearsegP(U, V)) | (ssList(tptp_fun_W_6(V, U)) & (app(tptp_fun_W_6(V, U), V) = U))) & (rearsegP(U, V) | ![W: $i] : (~(ssList(W) & (app(W, V) = U)))))))),
% 6.11/4.20      inference(skolemize,[status(sab)],[81])).
% 6.11/4.20  tff(83,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[82, 75])).
% 6.11/4.20  tff(84,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[83, 73])).
% 6.11/4.20  tff(85,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil)))))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))) | (~ssList(nil)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil)))))))))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(86,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil)))))))))),
% 6.11/4.20      inference(quant_inst,[status(thm)],[])).
% 6.11/4.20  tff(87,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(U, V)) | (~((~ssList(tptp_fun_W_6(V, U))) | (~(app(tptp_fun_W_6(V, U), V) = U)))))) | (~(rearsegP(U, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = U)))))))))) | (~ssList(nil)) | ![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil))))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[86, 85])).
% 6.11/4.20  tff(88,plain,
% 6.11/4.20      (![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil))))))))),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[87, 84, 63])).
% 6.11/4.20  tff(89,plain,
% 6.11/4.20      (((~![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil))))))))) | ((~ssList(nil)) | (~((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~(rearsegP(nil, nil) | ![W: $i] : ((~ssList(W)) | (~(app(W, nil) = nil))))))))) <=> ((~![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil))))))))) | (~ssList(nil)) | (~((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~(rearsegP(nil, nil) | ![W: $i] : ((~ssList(W)) | (~(app(W, nil) = nil))))))))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(90,plain,
% 6.11/4.20      ((~![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil))))))))) | ((~ssList(nil)) | (~((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~(rearsegP(nil, nil) | ![W: $i] : ((~ssList(W)) | (~(app(W, nil) = nil))))))))),
% 6.11/4.20      inference(quant_inst,[status(thm)],[])).
% 6.11/4.20  tff(91,plain,
% 6.11/4.20      ((~![V: $i] : ((~ssList(V)) | (~((~((~rearsegP(nil, V)) | (~((~ssList(tptp_fun_W_6(V, nil))) | (~(app(tptp_fun_W_6(V, nil), V) = nil)))))) | (~(rearsegP(nil, V) | ![W: $i] : ((~ssList(W)) | (~(app(W, V) = nil))))))))) | (~ssList(nil)) | (~((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~(rearsegP(nil, nil) | ![W: $i] : ((~ssList(W)) | (~(app(W, nil) = nil)))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[90, 89])).
% 6.11/4.20  tff(92,plain,
% 6.11/4.20      (~((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~(rearsegP(nil, nil) | ![W: $i] : ((~ssList(W)) | (~(app(W, nil) = nil))))))),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[91, 63, 88])).
% 6.11/4.20  tff(93,plain,
% 6.11/4.20      (((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~(rearsegP(nil, nil) | ![W: $i] : ((~ssList(W)) | (~(app(W, nil) = nil)))))) | ((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))),
% 6.11/4.20      inference(tautology,[status(thm)],[])).
% 6.11/4.20  tff(94,plain,
% 6.11/4.20      ((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil))))),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[93, 92])).
% 6.11/4.20  tff(95,plain,
% 6.11/4.20      (^[U: $i] : refl(((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U))) <=> ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(96,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U))) <=> ![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[95])).
% 6.11/4.20  tff(97,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U))) <=> ![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(98,plain,
% 6.11/4.20      (^[U: $i] : rewrite((ssList(U) => (rearsegP(nil, U) <=> (nil = U))) <=> ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(99,plain,
% 6.11/4.20      (![U: $i] : (ssList(U) => (rearsegP(nil, U) <=> (nil = U))) <=> ![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[98])).
% 6.11/4.20  tff(100,axiom,(![U: $i] : (ssList(U) => (rearsegP(nil, U) <=> (nil = U)))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax52')).
% 6.11/4.20  tff(101,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[100, 99])).
% 6.11/4.20  tff(102,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[101, 97])).
% 6.11/4.20  tff(103,plain,(
% 6.11/4.20      ![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(skolemize,[status(sab)],[102])).
% 6.11/4.20  tff(104,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[103, 96])).
% 6.11/4.20  tff(105,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | ((~ssList(nil)) | rearsegP(nil, nil))) <=> ((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | (~ssList(nil)) | rearsegP(nil, nil))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(106,plain,
% 6.11/4.20      (((~ssList(nil)) | (rearsegP(nil, nil) <=> (nil = nil))) <=> ((~ssList(nil)) | rearsegP(nil, nil))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(107,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | ((~ssList(nil)) | (rearsegP(nil, nil) <=> (nil = nil)))) <=> ((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | ((~ssList(nil)) | rearsegP(nil, nil)))),
% 6.11/4.20      inference(monotonicity,[status(thm)],[106])).
% 6.11/4.20  tff(108,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | ((~ssList(nil)) | (rearsegP(nil, nil) <=> (nil = nil)))) <=> ((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | (~ssList(nil)) | rearsegP(nil, nil))),
% 6.11/4.20      inference(transitivity,[status(thm)],[107, 105])).
% 6.11/4.20  tff(109,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | ((~ssList(nil)) | (rearsegP(nil, nil) <=> (nil = nil)))),
% 6.11/4.20      inference(quant_inst,[status(thm)],[])).
% 6.11/4.20  tff(110,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | (rearsegP(nil, U) <=> (nil = U)))) | (~ssList(nil)) | rearsegP(nil, nil)),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[109, 108])).
% 6.11/4.20  tff(111,plain,
% 6.11/4.20      (rearsegP(nil, nil)),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[110, 63, 104])).
% 6.11/4.20  tff(112,plain,
% 6.11/4.20      ((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil))))),
% 6.11/4.20      inference(tautology,[status(thm)],[])).
% 6.11/4.20  tff(113,plain,
% 6.11/4.20      ((~((~rearsegP(nil, nil)) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))))) | (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil))))),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[112, 111])).
% 6.11/4.20  tff(114,plain,
% 6.11/4.20      (~((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil)))),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[113, 94])).
% 6.11/4.20  tff(115,plain,
% 6.11/4.20      (((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil))) | (app(tptp_fun_W_6(nil, nil), nil) = nil)),
% 6.11/4.20      inference(tautology,[status(thm)],[])).
% 6.11/4.20  tff(116,plain,
% 6.11/4.20      (app(tptp_fun_W_6(nil, nil), nil) = nil),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[115, 114])).
% 6.11/4.20  tff(117,plain,
% 6.11/4.20      (app(tptp_fun_W_6(nil, nil), nil) = app(nil, nil)),
% 6.11/4.20      inference(transitivity,[status(thm)],[116, 68])).
% 6.11/4.20  tff(118,plain,
% 6.11/4.20      (((~ssList(tptp_fun_W_6(nil, nil))) | (~(app(tptp_fun_W_6(nil, nil), nil) = nil))) | ssList(tptp_fun_W_6(nil, nil))),
% 6.11/4.20      inference(tautology,[status(thm)],[])).
% 6.11/4.20  tff(119,plain,
% 6.11/4.20      (ssList(tptp_fun_W_6(nil, nil))),
% 6.11/4.20      inference(unit_resolution,[status(thm)],[118, 114])).
% 6.11/4.20  tff(120,plain,
% 6.11/4.20      (^[U: $i] : refl(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(121,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[120])).
% 6.11/4.20  tff(122,plain,
% 6.11/4.20      (^[U: $i] : rewrite(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(123,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[122])).
% 6.11/4.20  tff(124,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(transitivity,[status(thm)],[123, 121])).
% 6.11/4.20  tff(125,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(126,plain,
% 6.11/4.20      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : trans(monotonicity(quant_intro(proof_bind(^[W: $i] : trans(monotonicity(rewrite(((app(W, V) = app(U, V)) => (W = U)) <=> ((~(app(W, V) = app(U, V))) | (W = U))), ((ssList(W) => ((app(W, V) = app(U, V)) => (W = U))) <=> (ssList(W) => ((~(app(W, V) = app(U, V))) | (W = U))))), rewrite((ssList(W) => ((~(app(W, V) = app(U, V))) | (W = U))) <=> ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))), ((ssList(W) => ((app(W, V) = app(U, V)) => (W = U))) <=> ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))), (![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U))) <=> ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))), ((ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U)))) <=> (ssList(V) => ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))), rewrite((ssList(V) => ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))) <=> ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))), ((ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U)))) <=> ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))))), (![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U)))) <=> ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))), ((ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U))))) <=> (ssList(U) => ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))))), rewrite((ssList(U) => ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))), ((ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))))),
% 6.11/4.20      inference(bind,[status(th)],[])).
% 6.11/4.20  tff(127,plain,
% 6.11/4.20      (![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(quant_intro,[status(thm)],[126])).
% 6.11/4.20  tff(128,axiom,(![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ((app(W, V) = app(U, V)) => (W = U)))))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax79')).
% 6.11/4.20  tff(129,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[128, 127])).
% 6.11/4.20  tff(130,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[129, 125])).
% 6.11/4.20  tff(131,plain,(
% 6.11/4.20      ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(skolemize,[status(sab)],[130])).
% 6.11/4.20  tff(132,plain,
% 6.11/4.20      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))),
% 6.11/4.20      inference(modus_ponens,[status(thm)],[131, 124])).
% 6.11/4.20  tff(133,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | (~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V))))))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(134,plain,
% 6.11/4.20      (((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = nil) | (~ssList(W)) | (~(app(W, V) = app(nil, V)))))) <=> ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V))))))),
% 6.11/4.20      inference(rewrite,[status(thm)],[])).
% 6.11/4.20  tff(135,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = nil) | (~ssList(W)) | (~(app(W, V) = app(nil, V))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))))),
% 6.11/4.20      inference(monotonicity,[status(thm)],[134])).
% 6.11/4.20  tff(136,plain,
% 6.11/4.20      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = nil) | (~ssList(W)) | (~(app(W, V) = app(nil, V))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | (~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V))))))),
% 6.11/4.20      inference(transitivity,[status(thm)],[135, 133])).
% 6.11/4.20  tff(137,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | ((~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = nil) | (~ssList(W)) | (~(app(W, V) = app(nil, V))))))),
% 6.11/4.20      inference(quant_inst,[status(thm)],[])).
% 6.11/4.20  tff(138,plain,
% 6.11/4.20      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((W = U) | (~ssList(W)) | (~(app(W, V) = app(U, V))))))) | (~ssList(nil)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[137, 136])).
% 6.11/4.21  tff(139,plain,
% 6.11/4.21      (![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))),
% 6.11/4.21      inference(unit_resolution,[status(thm)],[138, 63, 132])).
% 6.11/4.21  tff(140,plain,
% 6.11/4.21      (((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))) | ((~ssList(nil)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil)))))) <=> ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))) | (~ssList(nil)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil)))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(141,plain,
% 6.11/4.21      ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))) | ((~ssList(nil)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil)))))),
% 6.11/4.21      inference(quant_inst,[status(thm)],[])).
% 6.11/4.21  tff(142,plain,
% 6.11/4.21      ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, V) = app(nil, V)))))) | (~ssList(nil)) | ![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil))))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[141, 140])).
% 6.11/4.21  tff(143,plain,
% 6.11/4.21      (![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil))))),
% 6.11/4.21      inference(unit_resolution,[status(thm)],[142, 63, 139])).
% 6.11/4.21  tff(144,plain,
% 6.11/4.21      (((~![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil))))) | ((~ssList(tptp_fun_W_6(nil, nil))) | (tptp_fun_W_6(nil, nil) = nil) | (~(app(tptp_fun_W_6(nil, nil), nil) = app(nil, nil))))) <=> ((~![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil))))) | (~ssList(tptp_fun_W_6(nil, nil))) | (tptp_fun_W_6(nil, nil) = nil) | (~(app(tptp_fun_W_6(nil, nil), nil) = app(nil, nil))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(145,plain,
% 6.11/4.21      ((~![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil))))) | ((~ssList(tptp_fun_W_6(nil, nil))) | (tptp_fun_W_6(nil, nil) = nil) | (~(app(tptp_fun_W_6(nil, nil), nil) = app(nil, nil))))),
% 6.11/4.21      inference(quant_inst,[status(thm)],[])).
% 6.11/4.21  tff(146,plain,
% 6.11/4.21      ((~![W: $i] : ((~ssList(W)) | (W = nil) | (~(app(W, nil) = app(nil, nil))))) | (~ssList(tptp_fun_W_6(nil, nil))) | (tptp_fun_W_6(nil, nil) = nil) | (~(app(tptp_fun_W_6(nil, nil), nil) = app(nil, nil)))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[145, 144])).
% 6.11/4.21  tff(147,plain,
% 6.11/4.21      (tptp_fun_W_6(nil, nil) = nil),
% 6.11/4.21      inference(unit_resolution,[status(thm)],[146, 143, 119, 117])).
% 6.11/4.21  tff(148,plain,
% 6.11/4.21      (app(tptp_fun_W_6(nil, nil), W!49) = app(nil, W!49)),
% 6.11/4.21      inference(monotonicity,[status(thm)],[147])).
% 6.11/4.21  tff(149,plain,
% 6.11/4.21      (app(tptp_fun_W_6(nil, nil), W!49) = W!49),
% 6.11/4.21      inference(transitivity,[status(thm)],[148, 50])).
% 6.11/4.21  tff(150,plain,
% 6.11/4.21      (app(app(tptp_fun_W_6(nil, nil), W!49), Y!51) = app(W!49, Y!51)),
% 6.11/4.21      inference(monotonicity,[status(thm)],[149])).
% 6.11/4.21  tff(151,plain,
% 6.11/4.21      (app(app(tptp_fun_W_6(nil, nil), W!49), Y!51) = V!48),
% 6.11/4.21      inference(transitivity,[status(thm)],[150, 35, 34])).
% 6.11/4.21  tff(152,plain,
% 6.11/4.21      (segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49) <=> segmentP(V!48, U!47)),
% 6.11/4.21      inference(monotonicity,[status(thm)],[151, 32])).
% 6.11/4.21  tff(153,plain,
% 6.11/4.21      (segmentP(V!48, U!47) <=> segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49)),
% 6.11/4.21      inference(symmetry,[status(thm)],[152])).
% 6.11/4.21  tff(154,plain,
% 6.11/4.21      ((~segmentP(V!48, U!47)) <=> (~segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49))),
% 6.11/4.21      inference(monotonicity,[status(thm)],[153])).
% 6.11/4.21  tff(155,plain,
% 6.11/4.21      (~segmentP(V!48, U!47)),
% 6.11/4.21      inference(and_elim,[status(thm)],[30])).
% 6.11/4.21  tff(156,plain,
% 6.11/4.21      (~segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49)),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[155, 154])).
% 6.11/4.21  tff(157,plain,
% 6.11/4.21      (^[U: $i] : refl(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))))),
% 6.11/4.21      inference(bind,[status(th)],[])).
% 6.11/4.21  tff(158,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(quant_intro,[status(thm)],[157])).
% 6.11/4.21  tff(159,plain,
% 6.11/4.21      (^[U: $i] : rewrite(((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))))),
% 6.11/4.21      inference(bind,[status(th)],[])).
% 6.11/4.21  tff(160,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(quant_intro,[status(thm)],[159])).
% 6.11/4.21  tff(161,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(transitivity,[status(thm)],[160, 158])).
% 6.11/4.21  tff(162,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(163,plain,
% 6.11/4.21      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : trans(monotonicity(quant_intro(proof_bind(^[W: $i] : trans(monotonicity(quant_intro(proof_bind(^[X: $i] : trans(monotonicity(rewrite((segmentP(U, V) => segmentP(app(app(W, U), X), V)) <=> ((~segmentP(U, V)) | segmentP(app(app(W, U), X), V))), ((ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))) <=> (ssList(X) => ((~segmentP(U, V)) | segmentP(app(app(W, U), X), V))))), rewrite((ssList(X) => ((~segmentP(U, V)) | segmentP(app(app(W, U), X), V))) <=> (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))), ((ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))) <=> (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))), (![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))) <=> ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))), ((ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V)))) <=> (ssList(W) => ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))), rewrite((ssList(W) => ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))) <=> ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))), ((ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V)))) <=> ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))), (![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V)))) <=> ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))), ((ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))))) <=> (ssList(V) => ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))), rewrite((ssList(V) => ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))) <=> ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))), ((ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))))) <=> ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))))), (![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))))) <=> ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))), ((ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V)))))) <=> (ssList(U) => ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))))), rewrite((ssList(U) => ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))), ((ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V)))))) <=> ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))))),
% 6.11/4.21      inference(bind,[status(th)],[])).
% 6.11/4.21  tff(164,plain,
% 6.11/4.21      (![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V)))))) <=> ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(quant_intro,[status(thm)],[163])).
% 6.11/4.21  tff(165,axiom,(![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (segmentP(U, V) => segmentP(app(app(W, U), X), V))))))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax56')).
% 6.11/4.21  tff(166,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[165, 164])).
% 6.11/4.21  tff(167,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[166, 162])).
% 6.11/4.21  tff(168,plain,(
% 6.11/4.21      ![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(skolemize,[status(sab)],[167])).
% 6.11/4.21  tff(169,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[168, 161])).
% 6.11/4.21  tff(170,plain,
% 6.11/4.21      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | ((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | (~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V))))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(171,plain,
% 6.11/4.21      (((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, W!49), X), V) | (~ssList(X)) | (~segmentP(W!49, V)))))) <=> ((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V))))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(172,plain,
% 6.11/4.21      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | ((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, W!49), X), V) | (~ssList(X)) | (~segmentP(W!49, V))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | ((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))))),
% 6.11/4.21      inference(monotonicity,[status(thm)],[171])).
% 6.11/4.21  tff(173,plain,
% 6.11/4.21      (((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | ((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, W!49), X), V) | (~ssList(X)) | (~segmentP(W!49, V))))))) <=> ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | (~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V))))))),
% 6.11/4.21      inference(transitivity,[status(thm)],[172, 170])).
% 6.11/4.21  tff(174,plain,
% 6.11/4.21      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | ((~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, W!49), X), V) | (~ssList(X)) | (~segmentP(W!49, V))))))),
% 6.11/4.21      inference(quant_inst,[status(thm)],[])).
% 6.11/4.21  tff(175,plain,
% 6.11/4.21      ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (segmentP(app(app(W, U), X), V) | (~ssList(X)) | (~segmentP(U, V))))))) | (~ssList(W!49)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[174, 173])).
% 6.11/4.21  tff(176,plain,
% 6.11/4.21      (![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))),
% 6.11/4.21      inference(unit_resolution,[status(thm)],[175, 169, 36])).
% 6.11/4.21  tff(177,plain,
% 6.11/4.21      (((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | ((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49))))) <=> ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | (~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(178,plain,
% 6.11/4.21      (((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), W!49) | (~segmentP(W!49, W!49))))) <=> ((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49))))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(179,plain,
% 6.11/4.21      (((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | ((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), W!49) | (~segmentP(W!49, W!49)))))) <=> ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | ((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))))),
% 6.11/4.21      inference(monotonicity,[status(thm)],[178])).
% 6.11/4.21  tff(180,plain,
% 6.11/4.21      (((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | ((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), W!49) | (~segmentP(W!49, W!49)))))) <=> ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | (~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49))))),
% 6.11/4.21      inference(transitivity,[status(thm)],[179, 177])).
% 6.11/4.21  tff(181,plain,
% 6.11/4.21      ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | ((~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), W!49) | (~segmentP(W!49, W!49)))))),
% 6.11/4.21      inference(quant_inst,[status(thm)],[])).
% 6.11/4.21  tff(182,plain,
% 6.11/4.21      ((~![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | segmentP(app(app(W, W!49), X), V) | (~segmentP(W!49, V)))))) | (~ssList(W!49)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[181, 180])).
% 6.11/4.21  tff(183,plain,
% 6.11/4.21      (![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))),
% 6.11/4.21      inference(unit_resolution,[status(thm)],[182, 36, 176])).
% 6.11/4.21  tff(184,plain,
% 6.11/4.21      (((~![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))) | ((~ssList(tptp_fun_W_6(nil, nil))) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49)))) <=> ((~![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))) | (~ssList(tptp_fun_W_6(nil, nil))) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49)))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(185,plain,
% 6.11/4.21      ((~![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))) | ((~ssList(tptp_fun_W_6(nil, nil))) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49)))),
% 6.11/4.21      inference(quant_inst,[status(thm)],[])).
% 6.11/4.21  tff(186,plain,
% 6.11/4.21      ((~![W: $i] : ((~ssList(W)) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(W, W!49), X), W!49)))) | (~ssList(tptp_fun_W_6(nil, nil))) | ![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49))),
% 6.11/4.21      inference(modus_ponens,[status(thm)],[185, 184])).
% 6.11/4.21  tff(187,plain,
% 6.11/4.21      (![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49))),
% 6.11/4.21      inference(unit_resolution,[status(thm)],[186, 183, 119])).
% 6.11/4.21  tff(188,plain,
% 6.11/4.21      (^[U: $i] : refl(((~ssList(U)) | segmentP(U, U)) <=> ((~ssList(U)) | segmentP(U, U)))),
% 6.11/4.21      inference(bind,[status(th)],[])).
% 6.11/4.21  tff(189,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | segmentP(U, U)) <=> ![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.21      inference(quant_intro,[status(thm)],[188])).
% 6.11/4.21  tff(190,plain,
% 6.11/4.21      (![U: $i] : ((~ssList(U)) | segmentP(U, U)) <=> ![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.21      inference(rewrite,[status(thm)],[])).
% 6.11/4.21  tff(191,plain,
% 6.11/4.21      (^[U: $i] : rewrite((ssList(U) => segmentP(U, U)) <=> ((~ssList(U)) | segmentP(U, U)))),
% 6.11/4.23      inference(bind,[status(th)],[])).
% 6.11/4.23  tff(192,plain,
% 6.11/4.23      (![U: $i] : (ssList(U) => segmentP(U, U)) <=> ![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.23      inference(quant_intro,[status(thm)],[191])).
% 6.11/4.23  tff(193,axiom,(![U: $i] : (ssList(U) => segmentP(U, U))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax','ax55')).
% 6.11/4.23  tff(194,plain,
% 6.11/4.23      (![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.23      inference(modus_ponens,[status(thm)],[193, 192])).
% 6.11/4.23  tff(195,plain,
% 6.11/4.23      (![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.23      inference(modus_ponens,[status(thm)],[194, 190])).
% 6.11/4.23  tff(196,plain,(
% 6.11/4.23      ![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.23      inference(skolemize,[status(sab)],[195])).
% 6.11/4.23  tff(197,plain,
% 6.11/4.23      (![U: $i] : ((~ssList(U)) | segmentP(U, U))),
% 6.11/4.23      inference(modus_ponens,[status(thm)],[196, 189])).
% 6.11/4.23  tff(198,plain,
% 6.11/4.23      (((~![U: $i] : ((~ssList(U)) | segmentP(U, U))) | ((~ssList(W!49)) | segmentP(W!49, W!49))) <=> ((~![U: $i] : ((~ssList(U)) | segmentP(U, U))) | (~ssList(W!49)) | segmentP(W!49, W!49))),
% 6.11/4.23      inference(rewrite,[status(thm)],[])).
% 6.11/4.23  tff(199,plain,
% 6.11/4.23      ((~![U: $i] : ((~ssList(U)) | segmentP(U, U))) | ((~ssList(W!49)) | segmentP(W!49, W!49))),
% 6.11/4.23      inference(quant_inst,[status(thm)],[])).
% 6.11/4.23  tff(200,plain,
% 6.11/4.23      ((~![U: $i] : ((~ssList(U)) | segmentP(U, U))) | (~ssList(W!49)) | segmentP(W!49, W!49)),
% 6.11/4.23      inference(modus_ponens,[status(thm)],[199, 198])).
% 6.11/4.23  tff(201,plain,
% 6.11/4.23      (segmentP(W!49, W!49)),
% 6.11/4.23      inference(unit_resolution,[status(thm)],[200, 197, 36])).
% 6.11/4.23  tff(202,plain,
% 6.11/4.23      (ssList(Y!51)),
% 6.11/4.23      inference(and_elim,[status(thm)],[30])).
% 6.11/4.23  tff(203,plain,
% 6.11/4.23      (((~![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49))) | ((~ssList(Y!51)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49))) <=> ((~![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49))) | (~ssList(Y!51)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49))),
% 6.11/4.23      inference(rewrite,[status(thm)],[])).
% 6.11/4.23  tff(204,plain,
% 6.11/4.23      ((~![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49))) | ((~ssList(Y!51)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49))),
% 6.11/4.23      inference(quant_inst,[status(thm)],[])).
% 6.11/4.23  tff(205,plain,
% 6.11/4.23      ((~![X: $i] : ((~ssList(X)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), X), W!49))) | (~ssList(Y!51)) | (~segmentP(W!49, W!49)) | segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49)),
% 6.11/4.23      inference(modus_ponens,[status(thm)],[204, 203])).
% 6.11/4.23  tff(206,plain,
% 6.11/4.23      (segmentP(app(app(tptp_fun_W_6(nil, nil), W!49), Y!51), W!49)),
% 6.11/4.23      inference(unit_resolution,[status(thm)],[205, 202, 201, 187])).
% 6.11/4.23  tff(207,plain,
% 6.11/4.23      ($false),
% 6.11/4.23      inference(unit_resolution,[status(thm)],[206, 156])).
% 6.11/4.23  % SZS output end Proof
%------------------------------------------------------------------------------