TSTP Solution File: SWC018-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC018-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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 : Wed May 29 17:59:54 EDT 2024
% Result : Unsatisfiable 2.21s 2.44s
% Output : Proof 2.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC018-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 14:41:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 2.21/2.44 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.So7hn8idHY/cvc5---1.0.5_14801.smt2
% 2.21/2.44 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.So7hn8idHY/cvc5---1.0.5_14801.smt2
% 2.21/2.47 (assume a0 (tptp.equalelemsP tptp.nil))
% 2.21/2.47 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 2.21/2.47 (assume a2 (tptp.strictorderedP tptp.nil))
% 2.21/2.47 (assume a3 (tptp.totalorderedP tptp.nil))
% 2.21/2.47 (assume a4 (tptp.strictorderP tptp.nil))
% 2.21/2.47 (assume a5 (tptp.totalorderP tptp.nil))
% 2.21/2.47 (assume a6 (tptp.cyclefreeP tptp.nil))
% 2.21/2.47 (assume a7 (tptp.ssList tptp.nil))
% 2.21/2.47 (assume a8 (tptp.ssItem tptp.skac3))
% 2.21/2.47 (assume a9 (tptp.ssItem tptp.skac2))
% 2.21/2.47 (assume a10 (not (tptp.singletonP tptp.nil)))
% 2.21/2.47 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 2.21/2.47 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 2.21/2.47 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 2.21/2.47 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 2.21/2.47 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 2.21/2.47 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 2.21/2.47 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 2.21/2.47 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 2.21/2.47 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 2.21/2.47 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 2.21/2.47 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 2.21/2.47 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 2.21/2.47 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 2.21/2.47 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 2.21/2.47 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 2.21/2.47 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 2.21/2.47 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 2.21/2.47 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 2.21/2.47 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 2.21/2.47 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 2.21/2.47 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 2.21/2.47 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 2.21/2.47 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 2.21/2.47 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 2.21/2.47 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 2.21/2.47 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 2.21/2.47 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 2.21/2.47 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 2.21/2.47 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 2.21/2.47 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 2.21/2.47 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 2.21/2.47 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 2.21/2.47 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 2.21/2.47 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 2.21/2.47 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 2.21/2.47 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 2.21/2.47 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 2.21/2.47 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 2.21/2.47 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 2.21/2.47 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 2.21/2.47 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 2.21/2.47 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 2.21/2.47 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 2.21/2.47 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 2.21/2.47 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 2.21/2.47 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 2.21/2.47 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 2.21/2.47 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 2.21/2.47 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 2.21/2.47 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 2.21/2.47 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 2.21/2.47 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 2.21/2.47 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 2.21/2.47 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 2.21/2.47 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 2.21/2.47 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 2.21/2.47 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 2.21/2.47 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.21/2.47 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.21/2.47 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.21/2.47 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.21/2.47 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 2.21/2.47 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.21/2.47 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 2.21/2.47 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.21/2.47 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 2.21/2.47 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.21/2.47 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 2.21/2.47 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.21/2.47 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 2.21/2.47 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 2.21/2.47 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 2.21/2.47 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 2.21/2.47 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 2.21/2.47 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.21/2.47 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.21/2.47 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.21/2.47 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.21/2.47 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 2.21/2.47 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 2.21/2.47 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.21/2.47 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.21/2.47 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 2.21/2.47 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 2.21/2.47 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 2.21/2.47 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 2.21/2.47 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 2.21/2.47 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 2.21/2.47 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 2.21/2.47 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 2.21/2.47 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 2.21/2.47 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 2.21/2.47 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 2.21/2.47 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.21/2.47 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 2.21/2.47 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 2.21/2.47 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 2.21/2.47 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 2.21/2.47 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 2.21/2.47 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.21/2.47 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.21/2.47 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 2.21/2.47 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 2.21/2.47 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 2.21/2.47 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 2.21/2.47 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 2.21/2.47 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 2.21/2.47 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 2.21/2.47 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 2.21/2.47 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 2.21/2.47 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 2.21/2.47 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 2.21/2.47 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 2.21/2.47 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 2.21/2.47 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 2.21/2.47 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 2.21/2.47 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 2.21/2.47 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 2.21/2.47 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 2.21/2.47 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 2.21/2.47 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 2.21/2.47 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 2.21/2.47 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 2.21/2.47 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 2.21/2.47 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 2.21/2.47 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 2.21/2.47 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 2.21/2.47 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 2.21/2.47 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 2.21/2.47 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 2.21/2.47 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 2.21/2.47 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 2.21/2.47 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 2.21/2.47 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 2.21/2.47 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 2.21/2.47 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 2.21/2.47 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 2.21/2.47 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 2.21/2.47 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 2.21/2.47 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 2.21/2.47 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 2.21/2.47 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 2.21/2.47 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 2.21/2.47 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 2.21/2.47 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 2.21/2.47 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 2.21/2.47 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 2.21/2.47 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 2.21/2.47 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 2.21/2.47 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 2.21/2.47 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 2.21/2.47 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 2.21/2.47 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 2.21/2.47 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 2.21/2.47 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 2.21/2.47 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 2.21/2.47 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 2.21/2.47 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 2.21/2.47 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 2.21/2.47 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 2.21/2.47 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 2.21/2.47 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 2.21/2.47 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 2.21/2.47 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 2.21/2.47 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 2.21/2.47 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 2.21/2.47 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 2.21/2.47 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 2.21/2.47 (assume a185 (tptp.ssList tptp.sk1))
% 2.21/2.47 (assume a186 (tptp.ssList tptp.sk2))
% 2.21/2.47 (assume a187 (tptp.ssList tptp.sk3))
% 2.21/2.47 (assume a188 (tptp.ssList tptp.sk4))
% 2.21/2.47 (assume a189 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (assume a190 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (assume a191 (tptp.ssList tptp.sk5))
% 2.21/2.47 (assume a192 (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4))
% 2.21/2.47 (assume a193 (tptp.equalelemsP tptp.sk3))
% 2.21/2.47 (assume a194 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssList C)) (not (= (tptp.app C (tptp.cons A tptp.nil)) tptp.sk3)))))
% 2.21/2.47 (assume a195 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 2.21/2.47 (assume a196 (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))
% 2.21/2.47 (assume a197 (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))))
% 2.21/2.47 (assume a198 (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)))
% 2.21/2.47 (assume a199 (forall ((A $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))))
% 2.21/2.47 (step t1 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t2)
% 2.21/2.47 (assume t2.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 2.21/2.47 (step t2.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk3)))
% 2.21/2.47 (step t2.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule or :premises (t2.t1))
% 2.21/2.47 (step t2.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t2.t2 t2.a0))
% 2.21/2.47 (step t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t2.a0))
% 2.21/2.47 (step t3 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t1 t2))
% 2.21/2.47 (step t4 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 2.21/2.47 (step t5 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t3 t4))
% 2.21/2.47 (step t6 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t5))
% 2.21/2.47 (step t7 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule implies :premises (t6))
% 2.21/2.47 (step t8 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)) :rule or_pos)
% 2.21/2.47 (step t9 (cl (= tptp.nil tptp.sk3) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t8))
% 2.21/2.47 (step t10 (cl (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))) :rule or :premises (a195))
% 2.21/2.47 (step t11 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk1 tptp.sk1) (not (tptp.neq tptp.sk2 tptp.nil))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk1 tptp.sk1) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv_pos2)
% 2.21/2.47 (step t12 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 2.21/2.47 (step t13 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 2.21/2.47 (step t14 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 2.21/2.47 (step t15 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 2.21/2.47 (step t16 (cl (= (= (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1)) true) (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1)))) :rule equiv_simplify)
% 2.21/2.47 (step t17 (cl (not (= (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1)) true)) (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1))) :rule equiv1 :premises (t16))
% 2.21/2.47 (step t18 (cl (= (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1)) (= (tptp.neq tptp.sk1 tptp.sk1) (not (not (tptp.neq tptp.sk1 tptp.sk1)))))) :rule all_simplify)
% 2.21/2.47 (step t19 (cl (= (tptp.neq tptp.sk1 tptp.sk1) (tptp.neq tptp.sk1 tptp.sk1))) :rule refl)
% 2.21/2.47 (step t20 (cl (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1))) :rule all_simplify)
% 2.21/2.47 (step t21 (cl (= (= (tptp.neq tptp.sk1 tptp.sk1) (not (not (tptp.neq tptp.sk1 tptp.sk1)))) (= (tptp.neq tptp.sk1 tptp.sk1) (tptp.neq tptp.sk1 tptp.sk1)))) :rule cong :premises (t19 t20))
% 2.21/2.47 (step t22 (cl (= (= (tptp.neq tptp.sk1 tptp.sk1) (tptp.neq tptp.sk1 tptp.sk1)) true)) :rule all_simplify)
% 2.21/2.47 (step t23 (cl (= (= (tptp.neq tptp.sk1 tptp.sk1) (not (not (tptp.neq tptp.sk1 tptp.sk1)))) true)) :rule trans :premises (t21 t22))
% 2.21/2.47 (step t24 (cl (= (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1)) true)) :rule trans :premises (t18 t23))
% 2.21/2.47 (step t25 (cl (= (not (not (tptp.neq tptp.sk1 tptp.sk1))) (tptp.neq tptp.sk1 tptp.sk1))) :rule resolution :premises (t17 t24))
% 2.21/2.47 (step t26 (cl (= (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule refl)
% 2.21/2.47 (step t27 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk1 tptp.sk1) (not (tptp.neq tptp.sk2 tptp.nil))))) :rule cong :premises (t12 t13 t14 t15 t25 t26))
% 2.21/2.47 (step t28 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1)))) :rule and_neg)
% 2.21/2.47 (step t29 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t30)
% 2.21/2.47 (assume t30.a0 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (assume t30.a1 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (assume t30.a2 (= tptp.nil tptp.sk4))
% 2.21/2.47 (assume t30.a3 (= tptp.nil tptp.sk3))
% 2.21/2.47 (assume t30.a4 (not (tptp.neq tptp.sk1 tptp.sk1)))
% 2.21/2.47 (step t30.t1 (cl (=> (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t30.t2)
% 2.21/2.47 (assume t30.t2.a0 (not (tptp.neq tptp.sk1 tptp.sk1)))
% 2.21/2.47 (assume t30.t2.a1 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (assume t30.t2.a2 (= tptp.nil tptp.sk3))
% 2.21/2.47 (assume t30.t2.a3 (= tptp.nil tptp.sk4))
% 2.21/2.47 (assume t30.t2.a4 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (step t30.t2.t1 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) false) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv_simplify)
% 2.21/2.47 (step t30.t2.t2 (cl (not (= (tptp.neq tptp.sk2 tptp.nil) false)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv1 :premises (t30.t2.t1))
% 2.21/2.47 (step t30.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t30.t2.a4))
% 2.21/2.47 (step t30.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t30.t2.t3))
% 2.21/2.47 (step t30.t2.t5 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t30.t2.a3))
% 2.21/2.47 (step t30.t2.t6 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t30.t2.a2))
% 2.21/2.47 (step t30.t2.t7 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t30.t2.t6))
% 2.21/2.47 (step t30.t2.t8 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t30.t2.a1))
% 2.21/2.47 (step t30.t2.t9 (cl (= tptp.sk2 tptp.sk1)) :rule trans :premises (t30.t2.t4 t30.t2.t5 t30.t2.t7 t30.t2.t8))
% 2.21/2.47 (step t30.t2.t10 (cl (= tptp.nil tptp.sk1)) :rule trans :premises (t30.t2.t7 t30.t2.t8))
% 2.21/2.47 (step t30.t2.t11 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk1 tptp.sk1))) :rule cong :premises (t30.t2.t9 t30.t2.t10))
% 2.21/2.47 (step t30.t2.t12 (cl (= (= (tptp.neq tptp.sk1 tptp.sk1) false) (not (tptp.neq tptp.sk1 tptp.sk1)))) :rule equiv_simplify)
% 2.21/2.47 (step t30.t2.t13 (cl (= (tptp.neq tptp.sk1 tptp.sk1) false) (not (not (tptp.neq tptp.sk1 tptp.sk1)))) :rule equiv2 :premises (t30.t2.t12))
% 2.21/2.47 (step t30.t2.t14 (cl (not (not (not (tptp.neq tptp.sk1 tptp.sk1)))) (tptp.neq tptp.sk1 tptp.sk1)) :rule not_not)
% 2.21/2.47 (step t30.t2.t15 (cl (= (tptp.neq tptp.sk1 tptp.sk1) false) (tptp.neq tptp.sk1 tptp.sk1)) :rule resolution :premises (t30.t2.t13 t30.t2.t14))
% 2.21/2.47 (step t30.t2.t16 (cl (= (tptp.neq tptp.sk1 tptp.sk1) false)) :rule resolution :premises (t30.t2.t15 t30.t2.a0))
% 2.21/2.47 (step t30.t2.t17 (cl (= (tptp.neq tptp.sk2 tptp.nil) false)) :rule trans :premises (t30.t2.t11 t30.t2.t16))
% 2.21/2.47 (step t30.t2.t18 (cl (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t30.t2.t2 t30.t2.t17))
% 2.21/2.47 (step t30.t2 (cl (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t30.t2.a0 t30.t2.a1 t30.t2.a2 t30.t2.a3 t30.t2.a4))
% 2.21/2.47 (step t30.t3 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk1 tptp.sk1))) :rule and_pos)
% 2.21/2.47 (step t30.t4 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t30.t5 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t30.t6 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t30.t7 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t30.t8 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t30.t2 t30.t3 t30.t4 t30.t5 t30.t6 t30.t7))
% 2.21/2.47 (step t30.t9 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t30.t8))
% 2.21/2.47 (step t30.t10 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t30.t9))
% 2.21/2.47 (step t30.t11 (cl (=> (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t30.t1 t30.t10))
% 2.21/2.47 (step t30.t12 (cl (=> (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 2.21/2.47 (step t30.t13 (cl (=> (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (=> (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t30.t11 t30.t12))
% 2.21/2.47 (step t30.t14 (cl (=> (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t30.t13))
% 2.21/2.47 (step t30.t15 (cl (not (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule implies :premises (t30.t14))
% 2.21/2.47 (step t30.t16 (cl (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 2.21/2.47 (step t30.t17 (cl (and (not (tptp.neq tptp.sk1 tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t30.t16 t30.a4 t30.a1 t30.a3 t30.a2 t30.a0))
% 2.21/2.47 (step t30.t18 (cl (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t30.t15 t30.t17))
% 2.21/2.47 (step t30 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t30.a0 t30.a1 t30.a2 t30.a3 t30.a4))
% 2.21/2.47 (step t31 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t32 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t33 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t34 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t35 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (tptp.neq tptp.sk1 tptp.sk1))) :rule and_pos)
% 2.21/2.47 (step t36 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))))) :rule resolution :premises (t30 t31 t32 t33 t34 t35))
% 2.21/2.47 (step t37 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t36))
% 2.21/2.47 (step t38 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t37))
% 2.21/2.47 (step t39 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t29 t38))
% 2.21/2.47 (step t40 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 2.21/2.47 (step t41 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t39 t40))
% 2.21/2.47 (step t42 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t41))
% 2.21/2.47 (step t43 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk1 tptp.sk1)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule implies :premises (t42))
% 2.21/2.47 (step t44 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t28 t43))
% 2.21/2.47 (step t45 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 2.21/2.47 (step t46 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 2.21/2.47 (step t47 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 2.21/2.47 (step t48 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 2.21/2.47 (step t49 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (not (tptp.neq tptp.sk1 tptp.sk1))))) :rule or_neg)
% 2.21/2.47 (step t50 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 2.21/2.47 (step t51 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t44 t45 t46 t47 t48 t49 t50))
% 2.21/2.47 (step t52 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk1 tptp.sk1))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t51))
% 2.21/2.47 (step t53 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk1 tptp.sk1) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t11 t27 t52))
% 2.21/2.47 (step t54 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk1 tptp.sk1) (not (tptp.neq tptp.sk2 tptp.nil))) :rule or :premises (t53))
% 2.21/2.47 (step t55 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk1 tptp.sk1)) :rule reordering :premises (t54))
% 2.21/2.47 (step t56 (cl (not (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1))) :rule or_pos)
% 2.21/2.47 (step t57 (cl (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.sk1)) (not (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1))))) :rule reordering :premises (t56))
% 2.21/2.47 (step t58 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t59)
% 2.21/2.47 (assume t59.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 2.21/2.47 (step t59.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1))))) :rule forall_inst :args ((:= V tptp.sk1)))
% 2.21/2.47 (step t59.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule or :premises (t59.t1))
% 2.21/2.47 (step t59.t3 (cl (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule resolution :premises (t59.t2 t59.a0))
% 2.21/2.47 (step t59 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule subproof :discharge (t59.a0))
% 2.21/2.47 (step t60 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule resolution :premises (t58 t59))
% 2.21/2.47 (step t61 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) (not (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1))))) :rule implies_neg2)
% 2.21/2.47 (step t62 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1))))) :rule resolution :premises (t60 t61))
% 2.21/2.47 (step t63 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1))))) :rule contraction :premises (t62))
% 2.21/2.47 (step t64 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule implies :premises (t63))
% 2.21/2.47 (step t65 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 2.21/2.47 (step t66 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 2.21/2.47 (anchor :step t67 :args ((V $$unsorted) (:= V V)))
% 2.21/2.47 (step t67.t1 (cl (= V V)) :rule refl)
% 2.21/2.47 (step t67.t2 (cl (= (= V V) true)) :rule all_simplify)
% 2.21/2.47 (step t67.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t67.t2))
% 2.21/2.47 (step t67.t4 (cl (= (not true) false)) :rule all_simplify)
% 2.21/2.47 (step t67.t5 (cl (= (not (= V V)) false)) :rule trans :premises (t67.t3 t67.t4))
% 2.21/2.47 (step t67.t6 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 2.21/2.47 (step t67.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.21/2.47 (step t67.t8 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t67.t5 t67.t6 t67.t7 t67.t7))
% 2.21/2.47 (step t67.t9 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 2.21/2.47 (step t67.t10 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t67.t8 t67.t9))
% 2.21/2.47 (step t67 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 2.21/2.47 (step t68 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t66 t67))
% 2.21/2.47 (step t69 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t65 t68 a114))
% 2.21/2.47 (step t70 (cl (or (not (tptp.neq tptp.sk1 tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule resolution :premises (t64 t69))
% 2.21/2.47 (step t71 (cl (not (tptp.neq tptp.sk1 tptp.sk1))) :rule resolution :premises (t57 a185 t70))
% 2.21/2.47 (step t72 (cl (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) :rule or :premises (a198))
% 2.21/2.47 (step t73 (cl (tptp.neq tptp.sk2 tptp.nil) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t72))
% 2.21/2.47 (step t74 (cl (not (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)) :rule or_pos)
% 2.21/2.47 (step t75 (cl (= tptp.nil tptp.sk1) (not (tptp.ssList tptp.sk1)) (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule reordering :premises (t74))
% 2.21/2.47 (step t76 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t77)
% 2.21/2.47 (assume t77.a0 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.21/2.47 (step t77.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.21/2.47 (step t77.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule or :premises (t77.t1))
% 2.21/2.47 (step t77.t3 (cl (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule resolution :premises (t77.t2 t77.a0))
% 2.21/2.47 (step t77 (cl (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule subproof :discharge (t77.a0))
% 2.21/2.47 (step t78 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule resolution :premises (t76 t77))
% 2.21/2.47 (step t79 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (not (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 2.21/2.47 (step t80 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t78 t79))
% 2.21/2.47 (step t81 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule contraction :premises (t80))
% 2.21/2.47 (step t82 (cl (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule implies :premises (t81))
% 2.21/2.47 (step t83 (cl (or (not (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule resolution :premises (t82 a83))
% 2.21/2.47 (step t84 (cl (not (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)) :rule or_pos)
% 2.21/2.47 (step t85 (cl (= tptp.nil tptp.sk3) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t84))
% 2.21/2.47 (step t86 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t87)
% 2.21/2.47 (assume t87.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.21/2.47 (step t87.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk5)))
% 2.21/2.47 (step t87.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule or :premises (t87.t1))
% 2.21/2.47 (step t87.t3 (cl (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t87.t2 t87.a0))
% 2.21/2.47 (step t87 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t87.a0))
% 2.21/2.47 (step t88 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t86 t87))
% 2.21/2.47 (step t89 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (not (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 2.21/2.47 (step t90 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t88 t89))
% 2.21/2.47 (step t91 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t90))
% 2.21/2.47 (step t92 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies :premises (t91))
% 2.21/2.47 (step t93 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 2.21/2.47 (anchor :step t94 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.21/2.47 (step t94.t1 (cl (= U U)) :rule refl)
% 2.21/2.47 (step t94.t2 (cl (= V V)) :rule refl)
% 2.21/2.47 (step t94.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 2.21/2.47 (step t94.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t94.t3))
% 2.21/2.47 (step t94.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.21/2.47 (step t94.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.21/2.47 (step t94.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 2.21/2.47 (step t94.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t94.t4 t94.t5 t94.t6 t94.t7))
% 2.21/2.47 (step t94 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 2.21/2.47 (step t95 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t93 t94 a117))
% 2.21/2.47 (step t96 (cl (or (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t92 t95))
% 2.21/2.47 (step t97 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule and_neg)
% 2.21/2.47 (step t98 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t99)
% 2.21/2.47 (assume t99.a0 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (assume t99.a1 (= tptp.nil tptp.sk4))
% 2.21/2.47 (assume t99.a2 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (assume t99.a3 (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))
% 2.21/2.47 (step t99.t1 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t99.t2)
% 2.21/2.47 (assume t99.t2.a0 (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))
% 2.21/2.47 (assume t99.t2.a1 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (assume t99.t2.a2 (= tptp.nil tptp.sk4))
% 2.21/2.47 (assume t99.t2.a3 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (step t99.t2.t1 (cl (= (= (tptp.frontsegP tptp.nil tptp.sk1) true) (tptp.frontsegP tptp.nil tptp.sk1))) :rule equiv_simplify)
% 2.21/2.47 (step t99.t2.t2 (cl (not (= (tptp.frontsegP tptp.nil tptp.sk1) true)) (tptp.frontsegP tptp.nil tptp.sk1)) :rule equiv1 :premises (t99.t2.t1))
% 2.21/2.47 (step t99.t2.t3 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t99.t2.a2))
% 2.21/2.47 (step t99.t2.t4 (cl (= tptp.nil tptp.sk4)) :rule symm :premises (t99.t2.t3))
% 2.21/2.47 (step t99.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t99.t2.a1))
% 2.21/2.47 (step t99.t2.t6 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (t99.t2.t5))
% 2.21/2.47 (step t99.t2.t7 (cl (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t99.t2.t4 t99.t2.t6))
% 2.21/2.47 (step t99.t2.t8 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t99.t2.a3))
% 2.21/2.47 (step t99.t2.t9 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t99.t2.t8))
% 2.21/2.47 (step t99.t2.t10 (cl (= (tptp.frontsegP tptp.nil tptp.sk1) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule cong :premises (t99.t2.t7 t99.t2.t9))
% 2.21/2.47 (step t99.t2.t11 (cl (= (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule equiv_simplify)
% 2.21/2.47 (step t99.t2.t12 (cl (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule equiv2 :premises (t99.t2.t11))
% 2.21/2.47 (step t99.t2.t13 (cl (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true)) :rule resolution :premises (t99.t2.t12 t99.t2.a0))
% 2.21/2.47 (step t99.t2.t14 (cl (= (tptp.frontsegP tptp.nil tptp.sk1) true)) :rule trans :premises (t99.t2.t10 t99.t2.t13))
% 2.21/2.47 (step t99.t2.t15 (cl (tptp.frontsegP tptp.nil tptp.sk1)) :rule resolution :premises (t99.t2.t2 t99.t2.t14))
% 2.21/2.47 (step t99.t2 (cl (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) :rule subproof :discharge (t99.t2.a0 t99.t2.a1 t99.t2.a2 t99.t2.a3))
% 2.21/2.47 (step t99.t3 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t99.t4 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t99.t5 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t99.t6 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t99.t7 (cl (tptp.frontsegP tptp.nil tptp.sk1) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t99.t2 t99.t3 t99.t4 t99.t5 t99.t6))
% 2.21/2.47 (step t99.t8 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.nil tptp.sk1)) :rule reordering :premises (t99.t7))
% 2.21/2.47 (step t99.t9 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.nil tptp.sk1)) :rule contraction :premises (t99.t8))
% 2.21/2.47 (step t99.t10 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (tptp.frontsegP tptp.nil tptp.sk1)) :rule resolution :premises (t99.t1 t99.t9))
% 2.21/2.47 (step t99.t11 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.frontsegP tptp.nil tptp.sk1))) :rule implies_neg2)
% 2.21/2.47 (step t99.t12 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1))) :rule resolution :premises (t99.t10 t99.t11))
% 2.21/2.47 (step t99.t13 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1))) :rule contraction :premises (t99.t12))
% 2.21/2.47 (step t99.t14 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.nil tptp.sk1)) :rule implies :premises (t99.t13))
% 2.21/2.47 (step t99.t15 (cl (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3)) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.21/2.47 (step t99.t16 (cl (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t99.t15 t99.a3 t99.a2 t99.a1 t99.a0))
% 2.21/2.47 (step t99.t17 (cl (tptp.frontsegP tptp.nil tptp.sk1)) :rule resolution :premises (t99.t14 t99.t16))
% 2.21/2.47 (step t99 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) :rule subproof :discharge (t99.a0 t99.a1 t99.a2 t99.a3))
% 2.21/2.47 (step t100 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t101 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t102 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t103 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t104 (cl (tptp.frontsegP tptp.nil tptp.sk1) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule resolution :premises (t99 t100 t101 t102 t103))
% 2.21/2.47 (step t105 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.nil tptp.sk1)) :rule reordering :premises (t104))
% 2.21/2.47 (step t106 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.nil tptp.sk1)) :rule contraction :premises (t105))
% 2.21/2.47 (step t107 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (tptp.frontsegP tptp.nil tptp.sk1)) :rule resolution :premises (t98 t106))
% 2.21/2.47 (step t108 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (not (tptp.frontsegP tptp.nil tptp.sk1))) :rule implies_neg2)
% 2.21/2.47 (step t109 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1))) :rule resolution :premises (t107 t108))
% 2.21/2.47 (step t110 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1))) :rule contraction :premises (t109))
% 2.21/2.47 (step t111 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.nil tptp.sk1)) :rule implies :premises (t110))
% 2.21/2.47 (step t112 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.nil tptp.sk1)) :rule resolution :premises (t97 t111))
% 2.21/2.47 (step t113 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil tptp.sk1) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule reordering :premises (t112))
% 2.21/2.47 (step t114 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule or_pos)
% 2.21/2.47 (step t115 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule reordering :premises (t114))
% 2.21/2.47 (step t116 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule and_neg)
% 2.21/2.47 (step t117 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t118)
% 2.21/2.47 (assume t118.a0 (tptp.ssList tptp.sk2))
% 2.21/2.47 (assume t118.a1 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (assume t118.a2 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (step t118.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t118.t2)
% 2.21/2.47 (assume t118.t2.a0 (tptp.ssList tptp.sk2))
% 2.21/2.47 (assume t118.t2.a1 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (assume t118.t2.a2 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (step t118.t2.t1 (cl (= (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) true) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 2.21/2.47 (step t118.t2.t2 (cl (not (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) true)) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule equiv1 :premises (t118.t2.t1))
% 2.21/2.47 (step t118.t2.t3 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t118.t2.a2))
% 2.21/2.47 (step t118.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (t118.t2.t3))
% 2.21/2.47 (step t118.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t118.t2.t4))
% 2.21/2.47 (step t118.t2.t6 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t118.t2.a1))
% 2.21/2.47 (step t118.t2.t7 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t118.t2.t6))
% 2.21/2.47 (step t118.t2.t8 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t118.t2.t7))
% 2.21/2.47 (step t118.t2.t9 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk2)) :rule trans :premises (t118.t2.t5 t118.t2.t8))
% 2.21/2.47 (step t118.t2.t10 (cl (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) (tptp.ssList tptp.sk2))) :rule cong :premises (t118.t2.t9))
% 2.21/2.47 (step t118.t2.t11 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 2.21/2.47 (step t118.t2.t12 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t118.t2.t11))
% 2.21/2.47 (step t118.t2.t13 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t118.t2.t12 t118.t2.a0))
% 2.21/2.47 (step t118.t2.t14 (cl (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) true)) :rule trans :premises (t118.t2.t10 t118.t2.t13))
% 2.21/2.47 (step t118.t2.t15 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t118.t2.t2 t118.t2.t14))
% 2.21/2.47 (step t118.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule subproof :discharge (t118.t2.a0 t118.t2.a1 t118.t2.a2))
% 2.21/2.47 (step t118.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 2.21/2.47 (step t118.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t118.t5 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t118.t6 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))))) :rule resolution :premises (t118.t2 t118.t3 t118.t4 t118.t5))
% 2.21/2.47 (step t118.t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t118.t6))
% 2.21/2.47 (step t118.t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule contraction :premises (t118.t7))
% 2.21/2.47 (step t118.t9 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t118.t1 t118.t8))
% 2.21/2.47 (step t118.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 2.21/2.47 (step t118.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t118.t9 t118.t10))
% 2.21/2.47 (step t118.t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t118.t11))
% 2.21/2.47 (step t118.t13 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule implies :premises (t118.t12))
% 2.21/2.47 (step t118.t14 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule and_neg)
% 2.21/2.47 (step t118.t15 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t118.t14 t118.a0 t118.a1 t118.a2))
% 2.21/2.47 (step t118.t16 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t118.t13 t118.t15))
% 2.21/2.47 (step t118 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule subproof :discharge (t118.a0 t118.a1 t118.a2))
% 2.21/2.47 (step t119 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 2.21/2.47 (step t120 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t121 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t122 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))))) :rule resolution :premises (t118 t119 t120 t121))
% 2.21/2.47 (step t123 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t122))
% 2.21/2.47 (step t124 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule contraction :premises (t123))
% 2.21/2.47 (step t125 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t117 t124))
% 2.21/2.47 (step t126 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 2.21/2.47 (step t127 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t125 t126))
% 2.21/2.47 (step t128 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t127))
% 2.21/2.47 (step t129 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule implies :premises (t128))
% 2.21/2.47 (step t130 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t116 t129))
% 2.21/2.47 (step t131 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (a192))
% 2.21/2.47 (step t132 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t130 a186 a189 t131))
% 2.21/2.47 (step t133 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t134)
% 2.21/2.47 (assume t134.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))
% 2.21/2.47 (step t134.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk5)))
% 2.21/2.47 (step t134.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule or :premises (t134.t1))
% 2.21/2.47 (step t134.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule resolution :premises (t134.t2 t134.a0))
% 2.21/2.47 (step t134 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule subproof :discharge (t134.a0))
% 2.21/2.47 (step t135 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule resolution :premises (t133 t134))
% 2.21/2.47 (step t136 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule implies_neg2)
% 2.21/2.47 (step t137 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule resolution :premises (t135 t136))
% 2.21/2.47 (step t138 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule contraction :premises (t137))
% 2.21/2.47 (step t139 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule implies :premises (t138))
% 2.21/2.47 (step t140 (cl (not (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule equiv_pos2)
% 2.21/2.47 (anchor :step t141 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 2.21/2.47 (step t141.t1 (cl (= U U)) :rule refl)
% 2.21/2.47 (step t141.t2 (cl (= V V)) :rule refl)
% 2.21/2.47 (step t141.t3 (cl (= W W)) :rule refl)
% 2.21/2.47 (step t141.t4 (cl (= (= (tptp.app U V) W) (= W (tptp.app U V)))) :rule all_simplify)
% 2.21/2.47 (step t141.t5 (cl (= (not (= (tptp.app U V) W)) (not (= W (tptp.app U V))))) :rule cong :premises (t141.t4))
% 2.21/2.47 (step t141.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.21/2.47 (step t141.t7 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.21/2.47 (step t141.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.21/2.47 (step t141.t9 (cl (= (tptp.frontsegP W U) (tptp.frontsegP W U))) :rule refl)
% 2.21/2.47 (step t141.t10 (cl (= (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)))) :rule cong :premises (t141.t5 t141.t6 t141.t7 t141.t8 t141.t9))
% 2.21/2.47 (step t141 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))) :rule bind)
% 2.21/2.47 (step t142 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule all_simplify)
% 2.21/2.47 (anchor :step t143 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.21/2.47 (step t143.t1 (cl (= U U)) :rule refl)
% 2.21/2.47 (step t143.t2 (cl (= V V)) :rule refl)
% 2.21/2.47 (step t143.t3 (cl (= (= (tptp.app U V) (tptp.app U V)) true)) :rule all_simplify)
% 2.21/2.47 (step t143.t4 (cl (= (not (= (tptp.app U V) (tptp.app U V))) (not true))) :rule cong :premises (t143.t3))
% 2.21/2.47 (step t143.t5 (cl (= (not true) false)) :rule all_simplify)
% 2.21/2.47 (step t143.t6 (cl (= (not (= (tptp.app U V) (tptp.app U V))) false)) :rule trans :premises (t143.t4 t143.t5))
% 2.21/2.47 (step t143.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.21/2.47 (step t143.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.21/2.47 (step t143.t9 (cl (= (not (tptp.ssList (tptp.app U V))) (not (tptp.ssList (tptp.app U V))))) :rule refl)
% 2.21/2.47 (step t143.t10 (cl (= (tptp.frontsegP (tptp.app U V) U) (tptp.frontsegP (tptp.app U V) U))) :rule refl)
% 2.21/2.47 (step t143.t11 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule cong :premises (t143.t6 t143.t7 t143.t8 t143.t9 t143.t10))
% 2.21/2.47 (step t143.t12 (cl (= (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule all_simplify)
% 2.21/2.47 (step t143.t13 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule trans :premises (t143.t11 t143.t12))
% 2.21/2.47 (step t143 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule bind)
% 2.21/2.47 (step t144 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t142 t143))
% 2.21/2.47 (step t145 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t141 t144))
% 2.21/2.47 (step t146 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule resolution :premises (t140 t145 a143))
% 2.21/2.47 (step t147 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule resolution :premises (t139 t146))
% 2.21/2.47 (step t148 (cl (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule resolution :premises (t115 a187 a191 t132 t147))
% 2.21/2.47 (step t149 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (a192))
% 2.21/2.47 (step t150 (cl (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule and_neg)
% 2.21/2.47 (step t151 (cl (=> (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t152)
% 2.21/2.47 (assume t152.a0 (= tptp.nil tptp.sk4))
% 2.21/2.47 (assume t152.a1 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (step t152.t1 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t152.t2)
% 2.21/2.47 (assume t152.t2.a0 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (assume t152.t2.a1 (= tptp.nil tptp.sk4))
% 2.21/2.47 (step t152.t2.t1 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t152.t2.a1))
% 2.21/2.47 (step t152.t2.t2 (cl (= tptp.nil tptp.sk4)) :rule symm :premises (t152.t2.t1))
% 2.21/2.47 (step t152.t2.t3 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t152.t2.a0))
% 2.21/2.47 (step t152.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (t152.t2.t3))
% 2.21/2.47 (step t152.t2.t5 (cl (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t152.t2.t2 t152.t2.t4))
% 2.21/2.47 (step t152.t2 (cl (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule subproof :discharge (t152.t2.a0 t152.t2.a1))
% 2.21/2.47 (step t152.t3 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t152.t4 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t152.t5 (cl (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)) (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t152.t2 t152.t3 t152.t4))
% 2.21/2.47 (step t152.t6 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t152.t5))
% 2.21/2.47 (step t152.t7 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule contraction :premises (t152.t6))
% 2.21/2.47 (step t152.t8 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t152.t1 t152.t7))
% 2.21/2.47 (step t152.t9 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 2.21/2.47 (step t152.t10 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (=> (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t152.t8 t152.t9))
% 2.21/2.47 (step t152.t11 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t152.t10))
% 2.21/2.47 (step t152.t12 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule implies :premises (t152.t11))
% 2.21/2.47 (step t152.t13 (cl (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4))) :rule and_neg)
% 2.21/2.47 (step t152.t14 (cl (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t152.t13 t152.a1 t152.a0))
% 2.21/2.47 (step t152.t15 (cl (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t152.t12 t152.t14))
% 2.21/2.47 (step t152 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule subproof :discharge (t152.a0 t152.a1))
% 2.21/2.47 (step t153 (cl (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t154 (cl (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t155 (cl (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)) (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))))) :rule resolution :premises (t152 t153 t154))
% 2.21/2.47 (step t156 (cl (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t155))
% 2.21/2.47 (step t157 (cl (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule contraction :premises (t156))
% 2.21/2.47 (step t158 (cl (=> (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t151 t157))
% 2.21/2.47 (step t159 (cl (=> (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 2.21/2.47 (step t160 (cl (=> (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (=> (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t158 t159))
% 2.21/2.47 (step t161 (cl (=> (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t160))
% 2.21/2.47 (step t162 (cl (not (and (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule implies :premises (t161))
% 2.21/2.47 (step t163 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t150 t162))
% 2.21/2.47 (step t164 (cl (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t163))
% 2.21/2.47 (step t165 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t55 t71 a190 a189 t73 t75 t83 a185 t85 t96 a191 a187 t113 t148 t149 a190 t164 t149))
% 2.21/2.47 (step t166 (cl (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t165))
% 2.21/2.47 (step t167 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t10 t166))
% 2.21/2.47 (step t168 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule or_pos)
% 2.21/2.47 (step t169 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))))) :rule reordering :premises (t168))
% 2.21/2.47 (step t170 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule and_neg)
% 2.21/2.47 (step t171 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t172)
% 2.21/2.47 (assume t172.a0 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (assume t172.a1 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (assume t172.a2 (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))
% 2.21/2.47 (step t172.t1 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t172.t2)
% 2.21/2.47 (assume t172.t2.a0 (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))
% 2.21/2.47 (assume t172.t2.a1 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 2.21/2.47 (assume t172.t2.a2 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (step t172.t2.t1 (cl (= (= (tptp.frontsegP tptp.sk2 tptp.sk3) true) (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule equiv_simplify)
% 2.21/2.47 (step t172.t2.t2 (cl (not (= (tptp.frontsegP tptp.sk2 tptp.sk3) true)) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule equiv1 :premises (t172.t2.t1))
% 2.21/2.47 (step t172.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t172.t2.a2))
% 2.21/2.47 (step t172.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t172.t2.t3))
% 2.21/2.47 (step t172.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t172.t2.a1))
% 2.21/2.47 (step t172.t2.t6 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (t172.t2.t5))
% 2.21/2.47 (step t172.t2.t7 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t172.t2.t4 t172.t2.t6))
% 2.21/2.47 (step t172.t2.t8 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 2.21/2.47 (step t172.t2.t9 (cl (= (tptp.frontsegP tptp.sk2 tptp.sk3) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule cong :premises (t172.t2.t7 t172.t2.t8))
% 2.21/2.47 (step t172.t2.t10 (cl (= (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule equiv_simplify)
% 2.21/2.47 (step t172.t2.t11 (cl (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule equiv2 :premises (t172.t2.t10))
% 2.21/2.47 (step t172.t2.t12 (cl (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true)) :rule resolution :premises (t172.t2.t11 t172.t2.a0))
% 2.21/2.47 (step t172.t2.t13 (cl (= (tptp.frontsegP tptp.sk2 tptp.sk3) true)) :rule trans :premises (t172.t2.t9 t172.t2.t12))
% 2.21/2.47 (step t172.t2.t14 (cl (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t172.t2.t2 t172.t2.t13))
% 2.21/2.47 (step t172.t2 (cl (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule subproof :discharge (t172.t2.a0 t172.t2.a1 t172.t2.a2))
% 2.21/2.47 (step t172.t3 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t172.t4 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t172.t5 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t172.t6 (cl (tptp.frontsegP tptp.sk2 tptp.sk3) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t172.t2 t172.t3 t172.t4 t172.t5))
% 2.21/2.47 (step t172.t7 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule reordering :premises (t172.t6))
% 2.21/2.47 (step t172.t8 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule contraction :premises (t172.t7))
% 2.21/2.47 (step t172.t9 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t172.t1 t172.t8))
% 2.21/2.47 (step t172.t10 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule implies_neg2)
% 2.21/2.47 (step t172.t11 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule resolution :premises (t172.t9 t172.t10))
% 2.21/2.47 (step t172.t12 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule contraction :premises (t172.t11))
% 2.21/2.47 (step t172.t13 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule implies :premises (t172.t12))
% 2.21/2.47 (step t172.t14 (cl (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 2.21/2.47 (step t172.t15 (cl (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t172.t14 t172.a2 t172.a1 t172.a0))
% 2.21/2.47 (step t172.t16 (cl (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t172.t13 t172.t15))
% 2.21/2.47 (step t172 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule subproof :discharge (t172.a0 t172.a1 t172.a2))
% 2.21/2.47 (step t173 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t174 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 2.21/2.47 (step t175 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t176 (cl (tptp.frontsegP tptp.sk2 tptp.sk3) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule resolution :premises (t172 t173 t174 t175))
% 2.21/2.47 (step t177 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule reordering :premises (t176))
% 2.21/2.47 (step t178 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule contraction :premises (t177))
% 2.21/2.47 (step t179 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t171 t178))
% 2.21/2.47 (step t180 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule implies_neg2)
% 2.21/2.47 (step t181 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule resolution :premises (t179 t180))
% 2.21/2.47 (step t182 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3))) :rule contraction :premises (t181))
% 2.21/2.47 (step t183 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule implies :premises (t182))
% 2.21/2.47 (step t184 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t170 t183))
% 2.21/2.47 (step t185 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (a192))
% 2.21/2.47 (step t186 (cl (tptp.frontsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t184 a189 t185 t148))
% 2.21/2.47 (step t187 (cl (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule and_neg)
% 2.21/2.47 (step t188 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t189)
% 2.21/2.47 (assume t189.a0 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (assume t189.a1 (tptp.frontsegP tptp.sk1 tptp.sk1))
% 2.21/2.47 (step t189.t1 (cl (=> (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t189.t2)
% 2.21/2.47 (assume t189.t2.a0 (tptp.frontsegP tptp.sk1 tptp.sk1))
% 2.21/2.47 (assume t189.t2.a1 (= tptp.sk1 tptp.sk3))
% 2.21/2.47 (step t189.t2.t1 (cl (= (= (tptp.frontsegP tptp.sk1 tptp.sk3) true) (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule equiv_simplify)
% 2.21/2.47 (step t189.t2.t2 (cl (not (= (tptp.frontsegP tptp.sk1 tptp.sk3) true)) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule equiv1 :premises (t189.t2.t1))
% 2.21/2.47 (step t189.t2.t3 (cl (= tptp.sk1 tptp.sk1)) :rule refl)
% 2.21/2.47 (step t189.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t189.t2.a1))
% 2.21/2.47 (step t189.t2.t5 (cl (= (tptp.frontsegP tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule cong :premises (t189.t2.t3 t189.t2.t4))
% 2.21/2.47 (step t189.t2.t6 (cl (= (= (tptp.frontsegP tptp.sk1 tptp.sk1) true) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule equiv_simplify)
% 2.21/2.47 (step t189.t2.t7 (cl (= (tptp.frontsegP tptp.sk1 tptp.sk1) true) (not (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule equiv2 :premises (t189.t2.t6))
% 2.21/2.47 (step t189.t2.t8 (cl (= (tptp.frontsegP tptp.sk1 tptp.sk1) true)) :rule resolution :premises (t189.t2.t7 t189.t2.a0))
% 2.21/2.47 (step t189.t2.t9 (cl (= (tptp.frontsegP tptp.sk1 tptp.sk3) true)) :rule trans :premises (t189.t2.t5 t189.t2.t8))
% 2.21/2.47 (step t189.t2.t10 (cl (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t189.t2.t2 t189.t2.t9))
% 2.21/2.47 (step t189.t2 (cl (not (tptp.frontsegP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule subproof :discharge (t189.t2.a0 t189.t2.a1))
% 2.21/2.47 (step t189.t3 (cl (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk1 tptp.sk1)) :rule and_pos)
% 2.21/2.47 (step t189.t4 (cl (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t189.t5 (cl (tptp.frontsegP tptp.sk1 tptp.sk3) (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t189.t2 t189.t3 t189.t4))
% 2.21/2.47 (step t189.t6 (cl (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule reordering :premises (t189.t5))
% 2.21/2.47 (step t189.t7 (cl (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule contraction :premises (t189.t6))
% 2.21/2.47 (step t189.t8 (cl (=> (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t189.t1 t189.t7))
% 2.21/2.47 (step t189.t9 (cl (=> (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule implies_neg2)
% 2.21/2.47 (step t189.t10 (cl (=> (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (=> (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule resolution :premises (t189.t8 t189.t9))
% 2.21/2.47 (step t189.t11 (cl (=> (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule contraction :premises (t189.t10))
% 2.21/2.47 (step t189.t12 (cl (not (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule implies :premises (t189.t11))
% 2.21/2.47 (step t189.t13 (cl (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.21/2.47 (step t189.t14 (cl (and (tptp.frontsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t189.t13 t189.a1 t189.a0))
% 2.21/2.47 (step t189.t15 (cl (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t189.t12 t189.t14))
% 2.21/2.47 (step t189 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule subproof :discharge (t189.a0 t189.a1))
% 2.21/2.47 (step t190 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.21/2.47 (step t191 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (tptp.frontsegP tptp.sk1 tptp.sk1)) :rule and_pos)
% 2.21/2.47 (step t192 (cl (tptp.frontsegP tptp.sk1 tptp.sk3) (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t189 t190 t191))
% 2.21/2.47 (step t193 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule reordering :premises (t192))
% 2.21/2.47 (step t194 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule contraction :premises (t193))
% 2.21/2.47 (step t195 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t188 t194))
% 2.21/2.47 (step t196 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule implies_neg2)
% 2.21/2.47 (step t197 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule resolution :premises (t195 t196))
% 2.21/2.47 (step t198 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3))) :rule contraction :premises (t197))
% 2.21/2.47 (step t199 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.frontsegP tptp.sk1 tptp.sk1))) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule implies :premises (t198))
% 2.21/2.47 (step t200 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t187 t199))
% 2.21/2.47 (step t201 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1)) :rule or_pos)
% 2.21/2.47 (step t202 (cl (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1)))) :rule reordering :premises (t201))
% 2.21/2.47 (step t203 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t204)
% 2.21/2.47 (assume t204.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 2.21/2.47 (step t204.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.21/2.47 (step t204.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule or :premises (t204.t1))
% 2.21/2.47 (step t204.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule resolution :premises (t204.t2 t204.a0))
% 2.21/2.47 (step t204 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t204.a0))
% 2.21/2.47 (step t205 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule resolution :premises (t203 t204))
% 2.21/2.47 (step t206 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 2.21/2.47 (step t207 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t205 t206))
% 2.21/2.47 (step t208 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t207))
% 2.21/2.47 (step t209 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule implies :premises (t208))
% 2.21/2.47 (step t210 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.sk1))) :rule resolution :premises (t209 a60))
% 2.21/2.47 (step t211 (cl (tptp.frontsegP tptp.sk1 tptp.sk1)) :rule resolution :premises (t202 a185 t210))
% 2.21/2.47 (step t212 (cl (tptp.frontsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t200 a190 t211))
% 2.21/2.47 (step t213 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t214)
% 2.21/2.47 (assume t214.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))))
% 2.21/2.47 (step t214.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk3)))
% 2.21/2.47 (step t214.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) :rule or :premises (t214.t1))
% 2.21/2.47 (step t214.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t214.t2 t214.a0))
% 2.21/2.47 (step t214 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t214.a0))
% 2.21/2.47 (step t215 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t213 t214))
% 2.21/2.47 (step t216 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 2.21/2.47 (step t217 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))))) :rule resolution :premises (t215 t216))
% 2.21/2.47 (step t218 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3))))) :rule contraction :premises (t217))
% 2.21/2.47 (step t219 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) :rule implies :premises (t218))
% 2.21/2.47 (step t220 (cl (not (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))))) (not (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))))) :rule equiv_pos2)
% 2.21/2.47 (step t221 (cl (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))))) :rule all_simplify)
% 2.21/2.47 (step t222 (cl (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A)))))) :rule resolution :premises (t220 t221 a197))
% 2.21/2.47 (step t223 (cl (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) :rule or :premises (t222))
% 2.21/2.47 (step t224 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk2))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk2)))) :rule equiv_pos2)
% 2.21/2.47 (step t225 (cl (= (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) true) (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 2.21/2.47 (step t226 (cl (not (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) true)) (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4))) :rule equiv1 :premises (t225))
% 2.21/2.47 (step t227 (cl (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) (= (= tptp.nil tptp.sk4) (not (not (= tptp.nil tptp.sk4)))))) :rule all_simplify)
% 2.21/2.47 (step t228 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))) :rule refl)
% 2.21/2.47 (step t229 (cl (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4))) :rule all_simplify)
% 2.21/2.47 (step t230 (cl (= (= (= tptp.nil tptp.sk4) (not (not (= tptp.nil tptp.sk4)))) (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)))) :rule cong :premises (t228 t229))
% 2.21/2.47 (step t231 (cl (= (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)) true)) :rule all_simplify)
% 2.21/2.47 (step t232 (cl (= (= (= tptp.nil tptp.sk4) (not (not (= tptp.nil tptp.sk4)))) true)) :rule trans :premises (t230 t231))
% 2.21/2.47 (step t233 (cl (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) true)) :rule trans :premises (t227 t232))
% 2.21/2.47 (step t234 (cl (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4))) :rule resolution :premises (t226 t233))
% 2.21/2.47 (step t235 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 2.21/2.47 (step t236 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t12 t234 t235))
% 2.21/2.47 (step t237 (cl (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4)))) :rule and_neg)
% 2.21/2.47 (step t238 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t239)
% 2.21/2.47 (assume t239.a0 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (assume t239.a1 (not (= tptp.nil tptp.sk4)))
% 2.21/2.47 (step t239.t1 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 2.21/2.47 (anchor :step t239.t2)
% 2.21/2.47 (assume t239.t2.a0 (not (= tptp.nil tptp.sk4)))
% 2.21/2.47 (assume t239.t2.a1 (= tptp.sk2 tptp.sk4))
% 2.21/2.47 (step t239.t2.t1 (cl (= (= (= tptp.nil tptp.sk2) false) (not (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 2.21/2.47 (step t239.t2.t2 (cl (not (= (= tptp.nil tptp.sk2) false)) (not (= tptp.nil tptp.sk2))) :rule equiv1 :premises (t239.t2.t1))
% 2.21/2.47 (step t239.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 2.21/2.47 (step t239.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t239.t2.a1))
% 2.21/2.47 (step t239.t2.t5 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t239.t2.t4))
% 2.21/2.47 (step t239.t2.t6 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk4))) :rule cong :premises (t239.t2.t3 t239.t2.t5))
% 2.21/2.47 (step t239.t2.t7 (cl (= (= (= tptp.nil tptp.sk4) false) (not (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 2.21/2.47 (step t239.t2.t8 (cl (= (= tptp.nil tptp.sk4) false) (not (not (= tptp.nil tptp.sk4)))) :rule equiv2 :premises (t239.t2.t7))
% 2.21/2.47 (step t239.t2.t9 (cl (not (not (not (= tptp.nil tptp.sk4)))) (= tptp.nil tptp.sk4)) :rule not_not)
% 2.21/2.47 (step t239.t2.t10 (cl (= (= tptp.nil tptp.sk4) false) (= tptp.nil tptp.sk4)) :rule resolution :premises (t239.t2.t8 t239.t2.t9))
% 2.21/2.47 (step t239.t2.t11 (cl (= (= tptp.nil tptp.sk4) false)) :rule resolution :premises (t239.t2.t10 t239.t2.a0))
% 2.21/2.47 (step t239.t2.t12 (cl (= (= tptp.nil tptp.sk2) false)) :rule trans :premises (t239.t2.t6 t239.t2.t11))
% 2.21/2.47 (step t239.t2.t13 (cl (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t239.t2.t2 t239.t2.t12))
% 2.21/2.47 (step t239.t2 (cl (not (not (= tptp.nil tptp.sk4))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule subproof :discharge (t239.t2.a0 t239.t2.a1))
% 2.21/2.47 (step t239.t3 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule and_pos)
% 2.21/2.47 (step t239.t4 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t239.t5 (cl (not (= tptp.nil tptp.sk2)) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t239.t2 t239.t3 t239.t4))
% 2.21/2.47 (step t239.t6 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t239.t5))
% 2.21/2.47 (step t239.t7 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule contraction :premises (t239.t6))
% 2.21/2.47 (step t239.t8 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t239.t1 t239.t7))
% 2.21/2.47 (step t239.t9 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) (not (not (= tptp.nil tptp.sk2)))) :rule implies_neg2)
% 2.21/2.47 (step t239.t10 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)))) :rule resolution :premises (t239.t8 t239.t9))
% 2.21/2.47 (step t239.t11 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)))) :rule contraction :premises (t239.t10))
% 2.21/2.47 (step t239.t12 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule implies :premises (t239.t11))
% 2.21/2.47 (step t239.t13 (cl (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 2.21/2.47 (step t239.t14 (cl (and (not (= tptp.nil tptp.sk4)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t239.t13 t239.a1 t239.a0))
% 2.21/2.47 (step t239.t15 (cl (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t239.t12 t239.t14))
% 2.21/2.47 (step t239 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule subproof :discharge (t239.a0 t239.a1))
% 2.21/2.47 (step t240 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.21/2.47 (step t241 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (not (= tptp.nil tptp.sk4))) :rule and_pos)
% 2.21/2.47 (step t242 (cl (not (= tptp.nil tptp.sk2)) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))))) :rule resolution :premises (t239 t240 t241))
% 2.21/2.47 (step t243 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t242))
% 2.21/2.47 (step t244 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (not (= tptp.nil tptp.sk2))) :rule contraction :premises (t243))
% 2.21/2.47 (step t245 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t238 t244))
% 2.21/2.47 (step t246 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (not (not (= tptp.nil tptp.sk2)))) :rule implies_neg2)
% 2.21/2.47 (step t247 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2)))) :rule resolution :premises (t245 t246))
% 2.21/2.47 (step t248 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2)))) :rule contraction :premises (t247))
% 2.21/2.47 (step t249 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk4)))) (not (= tptp.nil tptp.sk2))) :rule implies :premises (t248))
% 2.21/2.47 (step t250 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t237 t249))
% 2.21/2.47 (step t251 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 2.21/2.47 (step t252 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (not (not (not (= tptp.nil tptp.sk4))))) :rule or_neg)
% 2.21/2.47 (step t253 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (not (not (= tptp.nil tptp.sk2)))) :rule or_neg)
% 2.21/2.47 (step t254 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2)))) :rule resolution :premises (t250 t251 t252 t253))
% 2.21/2.47 (step t255 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk2)))) :rule contraction :premises (t254))
% 2.21/2.47 (step t256 (cl (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk2)))) :rule resolution :premises (t224 t236 t255))
% 2.21/2.47 (step t257 (cl (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk2))) :rule or :premises (t256))
% 2.21/2.47 (step t258 (cl (= tptp.nil tptp.sk4) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t257))
% 2.21/2.47 (step t259 (cl (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t258 t166 a189))
% 2.21/2.47 (step t260 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.frontsegP tptp.sk2 A)) (not (tptp.frontsegP tptp.sk1 A))))) :rule resolution :premises (t223 t259))
% 2.21/2.47 (step t261 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk3)) (not (tptp.frontsegP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t219 t260))
% 2.21/2.47 (step t262 (cl (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t169 a187 t186 t212 t261))
% 2.21/2.47 (step t263 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t9 t167 a7 a187 t262))
% 2.21/2.47 (step t264 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 2.21/2.47 (anchor :step t265 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.21/2.47 (step t265.t1 (cl (= U U)) :rule refl)
% 2.21/2.47 (step t265.t2 (cl (= V V)) :rule refl)
% 2.21/2.47 (step t265.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.21/2.47 (step t265.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.21/2.47 (step t265.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 2.21/2.47 (step t265.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 2.21/2.47 (step t265.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t265.t3 t265.t4 t265.t5 t265.t6))
% 2.21/2.47 (step t265 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 2.21/2.47 (step t266 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t264 t265 a99))
% 2.21/2.47 (step t267 (cl) :rule resolution :premises (t7 t263 t266))
% 2.21/2.47
% 2.21/2.48 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.So7hn8idHY/cvc5---1.0.5_14801.smt2
% 2.21/2.48 % cvc5---1.0.5 exiting
% 2.21/2.49 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------