TSTP Solution File: SWC192-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC192-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n012.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 18:00:53 EDT 2024
% Result : Unsatisfiable 26.18s 26.46s
% Output : Proof 26.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC192-1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 26 14:41:24 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.51/10.74 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.57/15.76 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.57/20.79 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.66/25.88 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 26.18/26.46 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.mppWFnLgNb/cvc5---1.0.5_2720.smt2
% 26.18/26.46 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.mppWFnLgNb/cvc5---1.0.5_2720.smt2
% 26.31/26.51 (assume a0 (tptp.equalelemsP tptp.nil))
% 26.31/26.51 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 26.31/26.51 (assume a2 (tptp.strictorderedP tptp.nil))
% 26.31/26.51 (assume a3 (tptp.totalorderedP tptp.nil))
% 26.31/26.51 (assume a4 (tptp.strictorderP tptp.nil))
% 26.31/26.51 (assume a5 (tptp.totalorderP tptp.nil))
% 26.31/26.51 (assume a6 (tptp.cyclefreeP tptp.nil))
% 26.31/26.51 (assume a7 (tptp.ssList tptp.nil))
% 26.31/26.51 (assume a8 (tptp.ssItem tptp.skac3))
% 26.31/26.51 (assume a9 (tptp.ssItem tptp.skac2))
% 26.31/26.51 (assume a10 (not (tptp.singletonP tptp.nil)))
% 26.31/26.51 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 26.31/26.51 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 26.31/26.51 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 26.31/26.51 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 26.31/26.51 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 26.31/26.51 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 26.31/26.51 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 26.31/26.51 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 26.31/26.51 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 26.31/26.51 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 26.31/26.51 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 26.31/26.51 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 26.31/26.51 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 26.31/26.51 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 26.31/26.51 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 26.31/26.51 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 26.31/26.51 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 26.31/26.51 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 26.31/26.51 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 26.31/26.51 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 26.31/26.51 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 26.31/26.51 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 26.31/26.51 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 26.31/26.51 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 26.31/26.51 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 26.31/26.51 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 26.31/26.51 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 26.31/26.51 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 26.31/26.51 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 26.31/26.51 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 26.31/26.51 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 26.31/26.51 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 26.31/26.51 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 26.31/26.51 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 26.31/26.51 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 26.31/26.51 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 26.31/26.51 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 26.31/26.51 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 26.31/26.51 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 26.31/26.51 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 26.31/26.51 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 26.31/26.51 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 26.31/26.51 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 26.31/26.51 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 26.31/26.51 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 26.31/26.51 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.31/26.51 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 26.31/26.51 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 26.31/26.51 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 26.31/26.51 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 26.31/26.51 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 26.31/26.51 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.31/26.51 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 26.31/26.51 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.31/26.51 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 26.31/26.51 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 26.31/26.51 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 26.31/26.51 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.31/26.51 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.31/26.51 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.31/26.51 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.31/26.51 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 26.31/26.51 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.31/26.51 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 26.31/26.51 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.31/26.51 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 26.31/26.51 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.31/26.51 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.31/26.51 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.31/26.51 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 26.31/26.51 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 26.31/26.51 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 26.31/26.51 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 26.31/26.51 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 26.31/26.51 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.31/26.51 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.31/26.51 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.31/26.51 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.31/26.51 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 26.31/26.51 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 26.31/26.51 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.31/26.51 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.31/26.51 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 26.31/26.51 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 26.31/26.51 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 26.31/26.51 (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))))
% 26.31/26.51 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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))))
% 26.31/26.51 (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)))))
% 26.31/26.51 (assume a185 (tptp.ssList tptp.sk1))
% 26.31/26.51 (assume a186 (tptp.ssList tptp.sk2))
% 26.31/26.51 (assume a187 (tptp.ssList tptp.sk3))
% 26.31/26.51 (assume a188 (tptp.ssList tptp.sk4))
% 26.31/26.51 (assume a189 (= tptp.sk2 tptp.sk4))
% 26.31/26.51 (assume a190 (= tptp.sk1 tptp.sk3))
% 26.31/26.51 (assume a191 (tptp.ssItem tptp.sk5))
% 26.31/26.51 (assume a192 (tptp.ssItem tptp.sk6))
% 26.31/26.51 (assume a193 (tptp.ssList tptp.sk7))
% 26.31/26.51 (assume a194 (tptp.ssList tptp.sk8))
% 26.31/26.51 (assume a195 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk1))
% 26.31/26.51 (assume a196 (not (= tptp.sk5 tptp.sk6)))
% 26.31/26.51 (assume a197 (or (tptp.ssItem tptp.sk9) (= tptp.nil tptp.sk4)))
% 26.31/26.51 (assume a198 (or (tptp.ssItem tptp.sk9) (= tptp.nil tptp.sk3)))
% 26.31/26.51 (assume a199 (or (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk4)))
% 26.31/26.51 (assume a200 (or (tptp.memberP tptp.sk4 tptp.sk9) (= tptp.nil tptp.sk4)))
% 26.31/26.51 (assume a201 (or (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk3)))
% 26.31/26.51 (assume a202 (or (tptp.memberP tptp.sk4 tptp.sk9) (= tptp.nil tptp.sk3)))
% 26.31/26.51 (step t1 (cl (not (= (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))))) (not (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule equiv_pos2)
% 26.31/26.51 (step t2 (cl (= (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))))) :rule refl)
% 26.31/26.51 (step t3 (cl (= (not (= tptp.sk6 tptp.sk9)) (not (= tptp.sk6 tptp.sk9)))) :rule refl)
% 26.31/26.51 (step t4 (cl (= (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule refl)
% 26.31/26.51 (step t5 (cl (= (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule refl)
% 26.31/26.51 (step t6 (cl (= (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule refl)
% 26.31/26.51 (step t7 (cl (= (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))))) :rule refl)
% 26.31/26.51 (step t8 (cl (= (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule refl)
% 26.31/26.51 (step t9 (cl (= (= (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) true) (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule equiv_simplify)
% 26.31/26.51 (step t10 (cl (not (= (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) true)) (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule equiv1 :premises (t9))
% 26.31/26.51 (step t11 (cl (= (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))))) :rule all_simplify)
% 26.31/26.51 (step t12 (cl (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule refl)
% 26.31/26.51 (step t13 (cl (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule all_simplify)
% 26.31/26.51 (step t14 (cl (= (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule cong :premises (t12 t13))
% 26.31/26.51 (step t15 (cl (= (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) true)) :rule all_simplify)
% 26.31/26.51 (step t16 (cl (= (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) true)) :rule trans :premises (t14 t15))
% 26.31/26.51 (step t17 (cl (= (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) true)) :rule trans :premises (t11 t16))
% 26.31/26.51 (step t18 (cl (= (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule resolution :premises (t10 t17))
% 26.31/26.51 (step t19 (cl (= (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule refl)
% 26.31/26.51 (step t20 (cl (= (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))))) :rule cong :premises (t2 t3 t4 t5 t6 t7 t8 t18 t19))
% 26.31/26.51 (step t21 (cl (not (= (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))))) (not (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule equiv_pos2)
% 26.31/26.51 (step t22 (cl (= (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule refl)
% 26.31/26.51 (step t23 (cl (= (= (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))))) :rule equiv_simplify)
% 26.31/26.51 (step t24 (cl (= (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (not (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))))) :rule equiv2 :premises (t23))
% 26.31/26.51 (step t25 (cl (not (not (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))))) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule not_not)
% 26.31/26.51 (step t26 (cl (= (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule resolution :premises (t24 t25))
% 26.31/26.51 (step t27 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t28)
% 26.31/26.51 (assume t28.a0 (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))
% 26.31/26.51 (assume t28.a1 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))
% 26.31/26.51 (assume t28.a2 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))))
% 26.31/26.51 (assume t28.a3 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))
% 26.31/26.51 (assume t28.a4 (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))
% 26.31/26.51 (assume t28.a5 (= tptp.sk6 tptp.sk9))
% 26.31/26.51 (assume t28.a6 (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))
% 26.31/26.51 (assume t28.a7 (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))
% 26.31/26.51 (assume t28.a8 (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))
% 26.31/26.51 (step t28.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 26.31/26.51 (step t28.t2 (cl (= (= false true) false)) :rule all_simplify)
% 26.31/26.51 (step t28.t3 (cl (= (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) false) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule equiv_simplify)
% 26.31/26.51 (step t28.t4 (cl (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) false) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule equiv2 :premises (t28.t3))
% 26.31/26.51 (step t28.t5 (cl (not (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) :rule not_not)
% 26.31/26.51 (step t28.t6 (cl (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) false) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) :rule resolution :premises (t28.t4 t28.t5))
% 26.31/26.51 (step t28.t7 (cl (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) false)) :rule resolution :premises (t28.t6 t28.a8))
% 26.31/26.51 (step t28.t8 (cl (= false (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule symm :premises (t28.t7))
% 26.31/26.51 (step t28.t9 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))) :rule symm :premises (t28.a7))
% 26.31/26.51 (step t28.t10 (cl (= tptp.sk9 tptp.sk6)) :rule symm :premises (t28.a5))
% 26.31/26.51 (step t28.t11 (cl (= tptp.sk6 tptp.sk9)) :rule symm :premises (t28.t10))
% 26.31/26.51 (step t28.t12 (cl (= (tptp.hd (tptp.cons tptp.sk9 tptp.nil)) tptp.sk9)) :rule symm :premises (t28.a4))
% 26.31/26.51 (step t28.t13 (cl (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) :rule symm :premises (t28.t12))
% 26.31/26.51 (step t28.t14 (cl (= (tptp.cons tptp.sk9 tptp.nil) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule symm :premises (t28.a1))
% 26.31/26.51 (step t28.t15 (cl (= (tptp.cons tptp.sk9 tptp.nil) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) :rule trans :premises (t28.t14 t28.a3))
% 26.31/26.51 (step t28.t16 (cl (= (tptp.hd (tptp.cons tptp.sk9 tptp.nil)) (tptp.hd (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule cong :premises (t28.t15))
% 26.31/26.51 (step t28.t17 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule symm :premises (t28.a3))
% 26.31/26.51 (step t28.t18 (cl (= (tptp.hd (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule cong :premises (t28.t17))
% 26.31/26.51 (step t28.t19 (cl (= tptp.sk6 (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule trans :premises (t28.t11 t28.t13 t28.t16 t28.t18))
% 26.31/26.51 (step t28.t20 (cl (= (tptp.tl (tptp.cons tptp.sk9 tptp.nil)) tptp.nil)) :rule symm :premises (t28.a6))
% 26.31/26.51 (step t28.t21 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) :rule symm :premises (t28.t20))
% 26.31/26.51 (step t28.t22 (cl (= (tptp.tl (tptp.cons tptp.sk9 tptp.nil)) (tptp.tl (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule cong :premises (t28.t15))
% 26.31/26.51 (step t28.t23 (cl (= (tptp.tl (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule cong :premises (t28.t17))
% 26.31/26.51 (step t28.t24 (cl (= tptp.nil (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule trans :premises (t28.t21 t28.t22 t28.t23))
% 26.31/26.51 (step t28.t25 (cl (= (tptp.cons tptp.sk6 tptp.nil) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule cong :premises (t28.t19 t28.t24))
% 26.31/26.51 (step t28.t26 (cl (= (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule symm :premises (t28.a2))
% 26.31/26.51 (step t28.t27 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule trans :premises (t28.t9 t28.t25 t28.t26))
% 26.31/26.51 (step t28.t28 (cl (= (tptp.cons tptp.sk6 tptp.nil) (tptp.cons tptp.sk9 tptp.nil))) :rule trans :premises (t28.a7 t28.t27 t28.a1))
% 26.31/26.51 (step t28.t29 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 26.31/26.51 (step t28.t30 (cl (= (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk5))) :rule cong :premises (t28.t28 t28.t29))
% 26.31/26.51 (step t28.t31 (cl (= (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk5) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule cong :premises (t28.t14 t28.t29))
% 26.31/26.51 (step t28.t32 (cl (= (= (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) true) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule equiv_simplify)
% 26.31/26.51 (step t28.t33 (cl (= (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) true) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule equiv2 :premises (t28.t32))
% 26.31/26.51 (step t28.t34 (cl (= (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) true)) :rule resolution :premises (t28.t33 t28.a0))
% 26.31/26.51 (step t28.t35 (cl (= false true)) :rule trans :premises (t28.t8 t28.t30 t28.t31 t28.t34))
% 26.31/26.51 (step t28.t36 (cl false) :rule resolution :premises (t28.t1 t28.t2 t28.t35))
% 26.31/26.51 (step t28 (cl (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk6 tptp.sk9)) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) :rule subproof :discharge (t28.a0 t28.a1 t28.a2 t28.a3 t28.a4 t28.a5 t28.a6 t28.a7 t28.a8))
% 26.31/26.51 (step t29 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) :rule and_pos)
% 26.31/26.51 (step t30 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t31 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule and_pos)
% 26.31/26.51 (step t32 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t33 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) :rule and_pos)
% 26.31/26.51 (step t34 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= tptp.sk6 tptp.sk9)) :rule and_pos)
% 26.31/26.51 (step t35 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) :rule and_pos)
% 26.31/26.51 (step t36 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t37 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule and_pos)
% 26.31/26.51 (step t38 (cl false (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule resolution :premises (t28 t29 t30 t31 t32 t33 t34 t35 t36 t37))
% 26.31/26.51 (step t39 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) false) :rule reordering :premises (t38))
% 26.31/26.51 (step t40 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) false) :rule contraction :premises (t39))
% 26.31/26.51 (step t41 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) false) :rule resolution :premises (t27 t40))
% 26.31/26.51 (step t42 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (not false)) :rule implies_neg2)
% 26.31/26.51 (step t43 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false)) :rule resolution :premises (t41 t42))
% 26.31/26.51 (step t44 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false)) :rule contraction :premises (t43))
% 26.31/26.51 (step t45 (cl (= (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))))) :rule implies_simplify)
% 26.31/26.51 (step t46 (cl (not (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false)) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule equiv1 :premises (t45))
% 26.31/26.51 (step t47 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule resolution :premises (t44 t46))
% 26.31/26.51 (step t48 (cl (= (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) false)) :rule resolution :premises (t26 t47))
% 26.31/26.51 (step t49 (cl (= (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) false))) :rule cong :premises (t22 t48))
% 26.31/26.51 (step t50 (cl (= (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) false) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))))) :rule all_simplify)
% 26.31/26.51 (step t51 (cl (= (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))))) :rule trans :premises (t49 t50))
% 26.31/26.51 (step t52 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t53)
% 26.31/26.51 (assume t53.a0 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))
% 26.31/26.51 (assume t53.a1 (= tptp.sk6 tptp.sk9))
% 26.31/26.51 (assume t53.a2 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))
% 26.31/26.51 (assume t53.a3 (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))
% 26.31/26.51 (assume t53.a4 (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))
% 26.31/26.51 (assume t53.a5 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))))
% 26.31/26.51 (assume t53.a6 (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))
% 26.31/26.51 (assume t53.a7 (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))
% 26.31/26.51 (assume t53.a8 (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))
% 26.31/26.51 (step t53.t1 (cl (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk6 tptp.sk9)) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule and_neg)
% 26.31/26.51 (step t53.t2 (cl (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule resolution :premises (t53.t1 t53.a8 t53.a0 t53.a5 t53.a2 t53.a4 t53.a1 t53.a3 t53.a6 t53.a7))
% 26.31/26.51 (step t53 (cl (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule subproof :discharge (t53.a0 t53.a1 t53.a2 t53.a3 t53.a4 t53.a5 t53.a6 t53.a7 t53.a8))
% 26.31/26.51 (step t54 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t55 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= tptp.sk6 tptp.sk9)) :rule and_pos)
% 26.31/26.51 (step t56 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t57 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) :rule and_pos)
% 26.31/26.51 (step t58 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) :rule and_pos)
% 26.31/26.51 (step t59 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule and_pos)
% 26.31/26.51 (step t60 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t61 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule and_pos)
% 26.31/26.51 (step t62 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) :rule and_pos)
% 26.31/26.51 (step t63 (cl (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule resolution :premises (t53 t54 t55 t56 t57 t58 t59 t60 t61 t62))
% 26.31/26.51 (step t64 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule reordering :premises (t63))
% 26.31/26.51 (step t65 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule contraction :premises (t64))
% 26.31/26.51 (step t66 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule resolution :premises (t52 t65))
% 26.31/26.51 (step t67 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule implies_neg2)
% 26.31/26.51 (step t68 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule resolution :premises (t66 t67))
% 26.31/26.51 (step t69 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk6 tptp.sk9) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule contraction :premises (t68))
% 26.31/26.51 (step t70 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.sk6 tptp.sk9) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule resolution :premises (t21 t51 t69))
% 26.31/26.51 (step t71 (cl (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule not_and :premises (t70))
% 26.31/26.51 (step t72 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))))) :rule or_neg)
% 26.31/26.51 (step t73 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= tptp.sk6 tptp.sk9)))) :rule or_neg)
% 26.31/26.51 (step t74 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule or_neg)
% 26.31/26.51 (step t75 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule or_neg)
% 26.31/26.51 (step t76 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule or_neg)
% 26.31/26.51 (step t77 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))))) :rule or_neg)
% 26.31/26.51 (step t78 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule or_neg)
% 26.31/26.51 (step t79 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))))) :rule or_neg)
% 26.31/26.51 (step t80 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule or_neg)
% 26.31/26.51 (step t81 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule resolution :premises (t71 t72 t73 t74 t75 t76 t77 t78 t79 t80))
% 26.31/26.51 (step t82 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule contraction :premises (t81))
% 26.31/26.51 (step t83 (cl (or (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule resolution :premises (t1 t20 t82))
% 26.31/26.51 (step t84 (cl (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule or :premises (t83))
% 26.31/26.51 (step t85 (cl (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (= tptp.sk6 tptp.sk9)) (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) (not (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule reordering :premises (t84))
% 26.31/26.51 (step t86 (cl (not (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) :rule or_pos)
% 26.31/26.51 (step t87 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5) (not (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule reordering :premises (t86))
% 26.31/26.51 (step t88 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule or_pos)
% 26.31/26.51 (step t89 (cl (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (not (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule reordering :premises (t88))
% 26.31/26.51 (step t90 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule or_pos)
% 26.31/26.51 (step t91 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule reordering :premises (t90))
% 26.31/26.51 (step t92 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t93)
% 26.31/26.51 (assume t93.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.31/26.51 (step t93.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil)))
% 26.31/26.51 (step t93.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t93.t1))
% 26.31/26.51 (step t93.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t93.t2 t93.a0))
% 26.31/26.51 (step t93 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t93.a0))
% 26.31/26.51 (step t94 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t92 t93))
% 26.31/26.51 (step t95 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 26.31/26.51 (step t96 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t94 t95))
% 26.31/26.51 (step t97 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t96))
% 26.31/26.51 (step t98 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t97))
% 26.31/26.51 (step t99 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t98 a85))
% 26.31/26.51 (step t100 (cl (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t91 a7 a192 t99))
% 26.31/26.51 (step t101 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 26.31/26.51 (step t102 (cl (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t101))
% 26.31/26.51 (step t103 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 26.31/26.51 (step t104 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t103))
% 26.31/26.51 (step t105 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t106)
% 26.31/26.51 (assume t106.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.31/26.51 (step t106.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 26.31/26.51 (step t106.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t106.t1))
% 26.31/26.51 (step t106.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t106.t2 t106.a0))
% 26.31/26.51 (step t106 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t106.a0))
% 26.31/26.51 (step t107 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t105 t106))
% 26.31/26.51 (step t108 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 26.31/26.51 (step t109 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t107 t108))
% 26.31/26.51 (step t110 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t109))
% 26.31/26.51 (step t111 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t110))
% 26.31/26.51 (step t112 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t111 a85))
% 26.31/26.51 (step t113 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t104 a7 a191 t112))
% 26.31/26.51 (step t114 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t115)
% 26.31/26.51 (assume t115.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.31/26.51 (step t115.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk7)))
% 26.31/26.51 (step t115.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t115.t1))
% 26.31/26.51 (step t115.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t115.t2 t115.a0))
% 26.31/26.51 (step t115 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t115.a0))
% 26.31/26.51 (step t116 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t114 t115))
% 26.31/26.51 (step t117 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 26.31/26.51 (step t118 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t116 t117))
% 26.31/26.51 (step t119 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t118))
% 26.31/26.51 (step t120 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t119))
% 26.31/26.51 (step t121 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t120 a84))
% 26.31/26.51 (step t122 (cl (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t102 a193 t113 t121))
% 26.31/26.51 (step t123 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t124)
% 26.31/26.51 (assume t124.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.31/26.51 (step t124.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk6 tptp.nil)) (:= V (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))
% 26.31/26.51 (step t124.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule or :premises (t124.t1))
% 26.31/26.51 (step t124.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t124.t2 t124.a0))
% 26.31/26.51 (step t124 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule subproof :discharge (t124.a0))
% 26.31/26.51 (step t125 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t123 t124))
% 26.31/26.51 (step t126 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule implies_neg2)
% 26.31/26.51 (step t127 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t125 t126))
% 26.31/26.51 (step t128 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule contraction :premises (t127))
% 26.31/26.51 (step t129 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies :premises (t128))
% 26.31/26.51 (step t130 (cl (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t129 a84))
% 26.31/26.51 (step t131 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t89 t100 t122 t130))
% 26.31/26.51 (step t132 (cl (not (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) :rule or_pos)
% 26.31/26.51 (step t133 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule reordering :premises (t132))
% 26.31/26.51 (step t134 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule or_pos)
% 26.31/26.51 (step t135 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)))) :rule reordering :premises (t134))
% 26.31/26.51 (step t136 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t137)
% 26.31/26.51 (assume t137.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))
% 26.31/26.51 (step t137.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk5) (:= W tptp.nil)))
% 26.31/26.51 (step t137.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) :rule or :premises (t137.t1))
% 26.31/26.51 (step t137.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) :rule resolution :premises (t137.t2 t137.a0))
% 26.31/26.51 (step t137 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) :rule subproof :discharge (t137.a0))
% 26.31/26.51 (step t138 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) :rule resolution :premises (t136 t137))
% 26.31/26.51 (step t139 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)))) :rule implies_neg2)
% 26.31/26.51 (step t140 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t138 t139))
% 26.31/26.51 (step t141 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)))) :rule contraction :premises (t140))
% 26.31/26.51 (step t142 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) :rule implies :premises (t141))
% 26.31/26.51 (step t143 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t144 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 26.31/26.51 (step t144.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t144.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t144.t3 (cl (= W W)) :rule refl)
% 26.31/26.51 (step t144.t4 (cl (= X X)) :rule refl)
% 26.31/26.51 (step t144.t5 (cl (= (= (tptp.app U (tptp.cons V W)) X) (= X (tptp.app U (tptp.cons V W))))) :rule all_simplify)
% 26.31/26.51 (step t144.t6 (cl (= (not (= (tptp.app U (tptp.cons V W)) X)) (not (= X (tptp.app U (tptp.cons V W)))))) :rule cong :premises (t144.t5))
% 26.31/26.51 (step t144.t7 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 26.31/26.51 (step t144.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.31/26.51 (step t144.t9 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.31/26.51 (step t144.t10 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 26.31/26.51 (step t144.t11 (cl (= (tptp.memberP X V) (tptp.memberP X V))) :rule refl)
% 26.31/26.51 (step t144.t12 (cl (= (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)) (or (not (= X (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V)))) :rule cong :premises (t144.t6 t144.t7 t144.t8 t144.t9 t144.t10 t144.t11))
% 26.31/26.51 (step t144 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))) :rule bind)
% 26.31/26.51 (step t145 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))) :rule all_simplify)
% 26.31/26.51 (anchor :step t146 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 26.31/26.51 (step t146.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t146.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t146.t3 (cl (= W W)) :rule refl)
% 26.31/26.51 (step t146.t4 (cl (= (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W))) true)) :rule all_simplify)
% 26.31/26.51 (step t146.t5 (cl (= (not (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W)))) (not true))) :rule cong :premises (t146.t4))
% 26.31/26.51 (step t146.t6 (cl (= (not true) false)) :rule all_simplify)
% 26.31/26.51 (step t146.t7 (cl (= (not (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W)))) false)) :rule trans :premises (t146.t5 t146.t6))
% 26.31/26.51 (step t146.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 26.31/26.51 (step t146.t9 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.31/26.51 (step t146.t10 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.31/26.51 (step t146.t11 (cl (= (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (not (tptp.ssList (tptp.app U (tptp.cons V W)))))) :rule refl)
% 26.31/26.51 (step t146.t12 (cl (= (tptp.memberP (tptp.app U (tptp.cons V W)) V) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) :rule refl)
% 26.31/26.51 (step t146.t13 (cl (= (or (not (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)) (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule cong :premises (t146.t7 t146.t8 t146.t9 t146.t10 t146.t11 t146.t12))
% 26.31/26.51 (step t146.t14 (cl (= (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule all_simplify)
% 26.31/26.51 (step t146.t15 (cl (= (or (not (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule trans :premises (t146.t13 t146.t14))
% 26.31/26.51 (step t146 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))) :rule bind)
% 26.31/26.51 (step t147 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app U (tptp.cons V W)))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))) :rule trans :premises (t145 t146))
% 26.31/26.51 (step t148 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))) :rule trans :premises (t144 t147))
% 26.31/26.51 (step t149 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule resolution :premises (t143 t148 a174))
% 26.31/26.51 (step t150 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5))) :rule resolution :premises (t142 t149))
% 26.31/26.51 (step t151 (cl (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule resolution :premises (t135 a7 a191 a193 t122 t150))
% 26.31/26.51 (step t152 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (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)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t153)
% 26.31/26.51 (assume t153.a0 (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))))
% 26.31/26.51 (step t153.t1 (cl (or (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule forall_inst :args ((:= U (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))) (:= V tptp.sk5) (:= W (tptp.cons tptp.sk6 tptp.nil))))
% 26.31/26.51 (step t153.t2 (cl (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule or :premises (t153.t1))
% 26.31/26.51 (step t153.t3 (cl (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t153.t2 t153.a0))
% 26.31/26.51 (step t153 (cl (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule subproof :discharge (t153.a0))
% 26.31/26.51 (step t154 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t152 t153))
% 26.31/26.51 (step t155 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule implies_neg2)
% 26.31/26.51 (step t156 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t154 t155))
% 26.31/26.51 (step t157 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule contraction :premises (t156))
% 26.31/26.51 (step t158 (cl (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule implies :premises (t157))
% 26.31/26.51 (step t159 (cl (or (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t158 a139))
% 26.31/26.51 (step t160 (cl (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) :rule resolution :premises (t133 a191 t100 t122 t151 t159))
% 26.31/26.51 (step t161 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (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)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t162)
% 26.31/26.51 (assume t162.a0 (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))))
% 26.31/26.51 (step t162.t1 (cl (or (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule forall_inst :args ((:= U (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (:= V tptp.sk5) (:= W tptp.sk8)))
% 26.31/26.51 (step t162.t2 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule or :premises (t162.t1))
% 26.31/26.51 (step t162.t3 (cl (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule resolution :premises (t162.t2 t162.a0))
% 26.31/26.51 (step t162 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule subproof :discharge (t162.a0))
% 26.31/26.51 (step t163 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule resolution :premises (t161 t162))
% 26.31/26.51 (step t164 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (not (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule implies_neg2)
% 26.31/26.51 (step t165 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule resolution :premises (t163 t164))
% 26.31/26.51 (step t166 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)))) :rule contraction :premises (t165))
% 26.31/26.51 (step t167 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule implies :premises (t166))
% 26.31/26.51 (step t168 (cl (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5))) :rule resolution :premises (t167 a139))
% 26.31/26.51 (step t169 (cl (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk5)) :rule resolution :premises (t87 a191 a194 t131 t160 t168))
% 26.31/26.51 (step t170 (cl (not (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9))) (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9)) :rule or_pos)
% 26.31/26.51 (step t171 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk9)) (= tptp.sk6 tptp.sk9) (tptp.memberP tptp.nil tptp.sk6) (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9)))) :rule reordering :premises (t170))
% 26.31/26.51 (step t172 (cl (not (= (or (tptp.ssItem tptp.sk9) (= tptp.nil tptp.sk3)) (or (tptp.ssItem tptp.sk9) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (or (tptp.ssItem tptp.sk9) (= tptp.nil tptp.sk3))) (or (tptp.ssItem tptp.sk9) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule equiv_pos2)
% 26.31/26.51 (step t173 (cl (= (tptp.ssItem tptp.sk9) (tptp.ssItem tptp.sk9))) :rule refl)
% 26.31/26.51 (step t174 (cl (= tptp.nil tptp.nil)) :rule refl)
% 26.31/26.51 (step t175 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.31/26.51 (step t176 (cl (not (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule equiv_pos2)
% 26.31/26.51 (step t177 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.31/26.51 (step t178 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t177 a190 a189))
% 26.31/26.51 (step t179 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t178))
% 26.31/26.51 (step t180 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule refl)
% 26.31/26.51 (step t181 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule cong :premises (t179 t180))
% 26.31/26.51 (step t182 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule symm :premises (a195))
% 26.31/26.51 (step t183 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule resolution :premises (t176 t181 t182))
% 26.31/26.51 (step t184 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t175 t183 a190 a189))
% 26.31/26.51 (step t185 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule and :premises (t184))
% 26.31/26.51 (step t186 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule cong :premises (t174 t185))
% 26.31/26.51 (step t187 (cl (= (or (tptp.ssItem tptp.sk9) (= tptp.nil tptp.sk3)) (or (tptp.ssItem tptp.sk9) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule cong :premises (t173 t186))
% 26.31/26.51 (step t188 (cl (or (tptp.ssItem tptp.sk9) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t172 t187 a198))
% 26.31/26.51 (step t189 (cl (tptp.ssItem tptp.sk9) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule or :premises (t188))
% 26.31/26.51 (step t190 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule or_pos)
% 26.31/26.51 (step t191 (cl (not (tptp.ssList tptp.sk8)) (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule reordering :premises (t190))
% 26.31/26.51 (step t192 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule or_pos)
% 26.31/26.51 (step t193 (cl (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule reordering :premises (t192))
% 26.31/26.51 (step t194 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 26.31/26.51 (step t195 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t194))
% 26.31/26.51 (step t196 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t197)
% 26.31/26.51 (assume t197.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.31/26.51 (step t197.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil)))
% 26.31/26.51 (step t197.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t197.t1))
% 26.31/26.51 (step t197.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t197.t2 t197.a0))
% 26.31/26.51 (step t197 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t197.a0))
% 26.31/26.51 (step t198 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t196 t197))
% 26.31/26.51 (step t199 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 26.31/26.51 (step t200 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t198 t199))
% 26.31/26.51 (step t201 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t200))
% 26.31/26.51 (step t202 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t201))
% 26.31/26.51 (step t203 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t204 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.31/26.51 (step t204.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t204.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t204.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 26.31/26.51 (step t204.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t204.t3))
% 26.31/26.51 (step t204.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 26.31/26.51 (step t204.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.31/26.51 (step t204.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t204.t4 t204.t5 t204.t6))
% 26.31/26.51 (step t204 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 26.31/26.51 (step t205 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t203 t204 a97))
% 26.31/26.51 (step t206 (cl (or (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t202 t205))
% 26.31/26.51 (step t207 (cl (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t195 a7 a192 t206))
% 26.31/26.51 (step t208 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t209)
% 26.31/26.51 (assume t209.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 26.31/26.51 (step t209.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 V)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))) (:= V (tptp.cons tptp.sk6 tptp.nil))))
% 26.31/26.51 (step t209.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 V)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t209.t1))
% 26.31/26.51 (step t209.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t209.t2 t209.a0))
% 26.31/26.51 (step t209 (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 V)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t209.a0))
% 26.31/26.51 (step t210 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t208 t209))
% 26.31/26.51 (step t211 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 26.31/26.51 (step t212 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t210 t211))
% 26.31/26.51 (step t213 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t212))
% 26.31/26.51 (step t214 (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 V)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t213))
% 26.31/26.51 (step t215 (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 V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t216 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.31/26.51 (step t216.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t216.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t216.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 26.31/26.51 (step t216.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t216.t3))
% 26.31/26.51 (step t216.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.31/26.51 (step t216.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.31/26.51 (step t216.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 26.31/26.51 (step t216.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule cong :premises (t216.t4 t216.t5 t216.t6 t216.t7))
% 26.31/26.51 (step t216 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) :rule bind)
% 26.31/26.51 (step t217 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule resolution :premises (t215 t216 a118))
% 26.31/26.51 (step t218 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t214 t217))
% 26.31/26.51 (step t219 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t193 t100 t122 t207 t218))
% 26.31/26.51 (step t220 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (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)
% 26.31/26.51 (anchor :step t221)
% 26.31/26.51 (assume t221.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))))
% 26.31/26.51 (step t221.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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (:= V tptp.sk8)))
% 26.31/26.51 (step t221.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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule or :premises (t221.t1))
% 26.31/26.51 (step t221.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t221.t2 t221.a0))
% 26.31/26.51 (step t221 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule subproof :discharge (t221.a0))
% 26.31/26.51 (step t222 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t220 t221))
% 26.31/26.51 (step t223 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule implies_neg2)
% 26.31/26.51 (step t224 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) (=> (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t222 t223))
% 26.31/26.51 (step t225 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule contraction :premises (t224))
% 26.31/26.51 (step t226 (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.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies :premises (t225))
% 26.31/26.51 (step t227 (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)
% 26.31/26.51 (anchor :step t228 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.31/26.51 (step t228.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t228.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t228.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 26.31/26.51 (step t228.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t228.t3))
% 26.31/26.51 (step t228.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.31/26.51 (step t228.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.31/26.51 (step t228.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 26.31/26.51 (step t228.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 (t228.t4 t228.t5 t228.t6 t228.t7))
% 26.31/26.51 (step t228 (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)
% 26.31/26.51 (step t229 (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 (t227 t228 a117))
% 26.31/26.51 (step t230 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t226 t229))
% 26.31/26.51 (step t231 (cl (not (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t191 a194 t219 t131 t230))
% 26.31/26.51 (step t232 (cl (tptp.ssItem tptp.sk9)) :rule resolution :premises (t189 t231))
% 26.31/26.51 (step t233 (cl (not (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6))) :rule or_pos)
% 26.31/26.51 (step t234 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.memberP tptp.nil tptp.sk6)) (not (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule reordering :premises (t233))
% 26.31/26.51 (step t235 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t236)
% 26.31/26.51 (assume t236.a0 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.31/26.51 (step t236.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 26.31/26.51 (step t236.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule or :premises (t236.t1))
% 26.31/26.51 (step t236.t3 (cl (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t236.t2 t236.a0))
% 26.31/26.51 (step t236 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule subproof :discharge (t236.a0))
% 26.31/26.51 (step t237 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t235 t236))
% 26.31/26.51 (step t238 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (not (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule implies_neg2)
% 26.31/26.51 (step t239 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule resolution :premises (t237 t238))
% 26.31/26.51 (step t240 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule contraction :premises (t239))
% 26.31/26.51 (step t241 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule implies :premises (t240))
% 26.31/26.51 (step t242 (cl (or (not (tptp.memberP tptp.nil tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t241 a70))
% 26.31/26.51 (step t243 (cl (not (tptp.memberP tptp.nil tptp.sk6))) :rule resolution :premises (t234 a192 t242))
% 26.31/26.51 (step t244 (cl (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule and_neg)
% 26.31/26.51 (step t245 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t246)
% 26.31/26.51 (assume t246.a0 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))
% 26.31/26.51 (assume t246.a1 (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))
% 26.31/26.51 (step t246.t1 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t246.t2)
% 26.31/26.51 (assume t246.t2.a0 (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))
% 26.31/26.51 (assume t246.t2.a1 (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))
% 26.31/26.51 (step t246.t2.t1 (cl (= (= (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6) true) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule equiv_simplify)
% 26.31/26.51 (step t246.t2.t2 (cl (not (= (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6) true)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule equiv1 :premises (t246.t2.t1))
% 26.31/26.51 (step t246.t2.t3 (cl (= (tptp.cons tptp.sk9 tptp.nil) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule symm :premises (t246.t2.a1))
% 26.31/26.51 (step t246.t2.t4 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 26.31/26.51 (step t246.t2.t5 (cl (= (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule cong :premises (t246.t2.t3 t246.t2.t4))
% 26.31/26.51 (step t246.t2.t6 (cl (= (= (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) true) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule equiv_simplify)
% 26.31/26.51 (step t246.t2.t7 (cl (= (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) true) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule equiv2 :premises (t246.t2.t6))
% 26.31/26.51 (step t246.t2.t8 (cl (= (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) true)) :rule resolution :premises (t246.t2.t7 t246.t2.a0))
% 26.31/26.51 (step t246.t2.t9 (cl (= (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6) true)) :rule trans :premises (t246.t2.t5 t246.t2.t8))
% 26.31/26.51 (step t246.t2.t10 (cl (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule resolution :premises (t246.t2.t2 t246.t2.t9))
% 26.31/26.51 (step t246.t2 (cl (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule subproof :discharge (t246.t2.a0 t246.t2.a1))
% 26.31/26.51 (step t246.t3 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) :rule and_pos)
% 26.31/26.51 (step t246.t4 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t246.t5 (cl (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t246.t2 t246.t3 t246.t4))
% 26.31/26.51 (step t246.t6 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule reordering :premises (t246.t5))
% 26.31/26.51 (step t246.t7 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule contraction :premises (t246.t6))
% 26.31/26.51 (step t246.t8 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule resolution :premises (t246.t1 t246.t7))
% 26.31/26.51 (step t246.t9 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule implies_neg2)
% 26.31/26.51 (step t246.t10 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule resolution :premises (t246.t8 t246.t9))
% 26.31/26.51 (step t246.t11 (cl (=> (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule contraction :premises (t246.t10))
% 26.31/26.51 (step t246.t12 (cl (not (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule implies :premises (t246.t11))
% 26.31/26.51 (step t246.t13 (cl (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) :rule and_neg)
% 26.31/26.51 (step t246.t14 (cl (and (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) :rule resolution :premises (t246.t13 t246.a1 t246.a0))
% 26.31/26.51 (step t246.t15 (cl (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule resolution :premises (t246.t12 t246.t14))
% 26.31/26.51 (step t246 (cl (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule subproof :discharge (t246.a0 t246.a1))
% 26.31/26.51 (step t247 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) :rule and_pos)
% 26.31/26.51 (step t248 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) :rule and_pos)
% 26.31/26.51 (step t249 (cl (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)))) :rule resolution :premises (t246 t247 t248))
% 26.31/26.51 (step t250 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule reordering :premises (t249))
% 26.31/26.51 (step t251 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule contraction :premises (t250))
% 26.31/26.51 (step t252 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule resolution :premises (t245 t251))
% 26.31/26.51 (step t253 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule implies_neg2)
% 26.31/26.51 (step t254 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule resolution :premises (t252 t253))
% 26.31/26.51 (step t255 (cl (=> (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6))) :rule contraction :premises (t254))
% 26.31/26.51 (step t256 (cl (not (and (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule implies :premises (t255))
% 26.31/26.51 (step t257 (cl (not (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) (not (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule resolution :premises (t244 t256))
% 26.31/26.51 (step t258 (cl (not (= (or (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk3)) (or (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) (not (or (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk3))) (or (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule equiv_pos2)
% 26.31/26.51 (step t259 (cl (= (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk9 tptp.nil)))) :rule all_simplify)
% 26.31/26.51 (step t260 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) :rule refl)
% 26.31/26.51 (step t261 (cl (= (or (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk3)) (or (= tptp.sk3 (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil tptp.sk3)))) :rule cong :premises (t259 t260))
% 26.31/26.51 (step t262 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule and :premises (t184))
% 26.31/26.51 (step t263 (cl (= (tptp.cons tptp.sk9 tptp.nil) (tptp.cons tptp.sk9 tptp.nil))) :rule refl)
% 26.31/26.51 (step t264 (cl (= (= tptp.sk3 (tptp.cons tptp.sk9 tptp.nil)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)))) :rule cong :premises (t262 t263))
% 26.31/26.51 (step t265 (cl (= tptp.nil tptp.nil)) :rule refl)
% 26.31/26.51 (step t266 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule cong :premises (t265 t262))
% 26.31/26.51 (step t267 (cl (= (or (= tptp.sk3 (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil tptp.sk3)) (or (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule cong :premises (t264 t266))
% 26.31/26.51 (step t268 (cl (= (or (= (tptp.cons tptp.sk9 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk3)) (or (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule trans :premises (t261 t267))
% 26.31/26.51 (step t269 (cl (or (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t258 t268 a201))
% 26.31/26.51 (step t270 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule or :premises (t269))
% 26.31/26.51 (step t271 (cl (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) :rule reordering :premises (t270))
% 26.31/26.51 (step t272 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk9 tptp.nil))) :rule resolution :premises (t271 t231))
% 26.31/26.51 (step t273 (cl (not (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) :rule or_pos)
% 26.31/26.51 (step t274 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6) (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)))) :rule reordering :premises (t273))
% 26.31/26.51 (step t275 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) :rule or_pos)
% 26.31/26.51 (step t276 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)))) :rule reordering :premises (t275))
% 26.31/26.51 (step t277 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t278)
% 26.31/26.51 (assume t278.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))))
% 26.31/26.51 (step t278.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)))) :rule forall_inst :args ((:= U (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))) (:= V tptp.sk6) (:= W tptp.nil)))
% 26.31/26.51 (step t278.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) :rule or :premises (t278.t1))
% 26.31/26.51 (step t278.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) :rule resolution :premises (t278.t2 t278.a0))
% 26.31/26.51 (step t278 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) :rule subproof :discharge (t278.a0))
% 26.31/26.51 (step t279 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) :rule resolution :premises (t277 t278))
% 26.31/26.51 (step t280 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)))) :rule implies_neg2)
% 26.31/26.51 (step t281 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t279 t280))
% 26.31/26.51 (step t282 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)))) :rule contraction :premises (t281))
% 26.31/26.51 (step t283 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList (tptp.app U (tptp.cons V W)))) (tptp.memberP (tptp.app U (tptp.cons V W)) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) :rule implies :premises (t282))
% 26.31/26.51 (step t284 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6))) :rule resolution :premises (t283 t149))
% 26.31/26.51 (step t285 (cl (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) :rule resolution :premises (t276 a7 a192 t122 t131 t284))
% 26.31/26.51 (step t286 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (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)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t287)
% 26.31/26.51 (assume t287.a0 (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))))
% 26.31/26.51 (step t287.t1 (cl (or (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)))) :rule forall_inst :args ((:= U (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (:= V tptp.sk6) (:= W tptp.sk8)))
% 26.31/26.51 (step t287.t2 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule or :premises (t287.t1))
% 26.31/26.51 (step t287.t3 (cl (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule resolution :premises (t287.t2 t287.a0))
% 26.31/26.51 (step t287 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule subproof :discharge (t287.a0))
% 26.31/26.51 (step t288 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule resolution :premises (t286 t287))
% 26.31/26.51 (step t289 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (not (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)))) :rule implies_neg2)
% 26.31/26.51 (step t290 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)))) :rule resolution :premises (t288 t289))
% 26.31/26.51 (step t291 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)))) :rule contraction :premises (t290))
% 26.31/26.51 (step t292 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule implies :premises (t291))
% 26.31/26.51 (step t293 (cl (or (not (tptp.memberP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6))) :rule resolution :premises (t292 a139))
% 26.31/26.51 (step t294 (cl (tptp.memberP (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.sk6)) :rule resolution :premises (t274 a192 a194 t131 t285 t293))
% 26.31/26.51 (step t295 (cl (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) :rule resolution :premises (t257 t272 t294))
% 26.31/26.51 (step t296 (cl (not (= (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9))))) (not (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6)))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9)))) :rule equiv_pos2)
% 26.31/26.51 (step t297 (cl (= (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) (= U W))) (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) (= U W))))) :rule refl)
% 26.31/26.51 (step t298 (cl (= (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)))) :rule refl)
% 26.31/26.51 (step t299 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 26.31/26.51 (step t300 (cl (= (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk9)))) :rule refl)
% 26.31/26.51 (step t301 (cl (= (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule refl)
% 26.31/26.51 (step t302 (cl (= (tptp.memberP tptp.nil tptp.sk6) (tptp.memberP tptp.nil tptp.sk6))) :rule refl)
% 26.31/26.51 (step t303 (cl (= (= tptp.sk9 tptp.sk6) (= tptp.sk6 tptp.sk9))) :rule all_simplify)
% 26.31/26.51 (step t304 (cl (= (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6)) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9)))) :rule cong :premises (t298 t299 t300 t301 t302 t303))
% 26.31/26.51 (step t305 (cl (= (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9))))) :rule cong :premises (t297 t304))
% 26.31/26.51 (step t306 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) (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) (= U W)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t307)
% 26.31/26.51 (assume t307.a0 (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) (= U W))))
% 26.31/26.51 (step t307.t1 (cl (or (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk9) (:= V tptp.nil) (:= W tptp.sk6)))
% 26.31/26.51 (step t307.t2 (cl (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) :rule or :premises (t307.t1))
% 26.31/26.51 (step t307.t3 (cl (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) :rule resolution :premises (t307.t2 t307.a0))
% 26.31/26.51 (step t307 (cl (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) :rule subproof :discharge (t307.a0))
% 26.31/26.51 (step t308 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) :rule resolution :premises (t306 t307))
% 26.31/26.51 (step t309 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) (not (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6)))) :rule implies_neg2)
% 26.31/26.51 (step t310 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6)))) :rule resolution :premises (t308 t309))
% 26.31/26.51 (step t311 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk9 tptp.sk6)))) :rule contraction :premises (t310))
% 26.31/26.51 (step t312 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9)))) :rule resolution :premises (t296 t305 t311))
% 26.31/26.51 (step t313 (cl (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9))) :rule implies :premises (t312))
% 26.31/26.51 (step t314 (cl (not (= (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))) (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) (= U W))))) (not (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)))) (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) (= U W)))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t315 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 26.31/26.51 (step t315.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t315.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t315.t3 (cl (= W W)) :rule refl)
% 26.31/26.51 (step t315.t4 (cl (= (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.memberP (tptp.cons U V) W)))) :rule refl)
% 26.31/26.51 (step t315.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.31/26.51 (step t315.t6 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 26.31/26.51 (step t315.t7 (cl (= (not (tptp.ssItem W)) (not (tptp.ssItem W)))) :rule refl)
% 26.31/26.51 (step t315.t8 (cl (= (tptp.memberP V W) (tptp.memberP V W))) :rule refl)
% 26.31/26.51 (step t315.t9 (cl (= (= W U) (= U W))) :rule all_simplify)
% 26.31/26.51 (step t315.t10 (cl (= (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)) (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) (= U W)))) :rule cong :premises (t315.t4 t315.t5 t315.t6 t315.t7 t315.t8 t315.t9))
% 26.31/26.51 (step t315 (cl (= (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))) (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) (= U W))))) :rule bind)
% 26.31/26.51 (step t316 (cl (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) (= U W)))) :rule resolution :premises (t314 t315 a160))
% 26.31/26.51 (step t317 (cl (or (not (tptp.memberP (tptp.cons tptp.sk9 tptp.nil) tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk6) (= tptp.sk6 tptp.sk9))) :rule resolution :premises (t313 t316))
% 26.31/26.51 (step t318 (cl (= tptp.sk6 tptp.sk9)) :rule resolution :premises (t171 a7 a192 t232 t243 t295 t317))
% 26.31/26.51 (step t319 (cl (not (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6))) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6)) :rule or_pos)
% 26.31/26.51 (step t320 (cl (= tptp.sk5 tptp.sk6) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.memberP tptp.nil tptp.sk5) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6)))) :rule reordering :premises (t319))
% 26.31/26.51 (step t321 (cl (not (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5))) :rule or_pos)
% 26.31/26.51 (step t322 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.memberP tptp.nil tptp.sk5)) (not (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5))))) :rule reordering :premises (t321))
% 26.31/26.51 (step t323 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t324)
% 26.31/26.51 (assume t324.a0 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.31/26.51 (step t324.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5))))) :rule forall_inst :args ((:= U tptp.sk5)))
% 26.31/26.51 (step t324.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule or :premises (t324.t1))
% 26.31/26.51 (step t324.t3 (cl (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule resolution :premises (t324.t2 t324.a0))
% 26.31/26.51 (step t324 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule subproof :discharge (t324.a0))
% 26.31/26.51 (step t325 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule resolution :premises (t323 t324))
% 26.31/26.51 (step t326 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) (not (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5))))) :rule implies_neg2)
% 26.31/26.51 (step t327 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5))))) :rule resolution :premises (t325 t326))
% 26.31/26.51 (step t328 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5))))) :rule contraction :premises (t327))
% 26.31/26.51 (step t329 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule implies :premises (t328))
% 26.31/26.51 (step t330 (cl (or (not (tptp.memberP tptp.nil tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule resolution :premises (t329 a70))
% 26.31/26.51 (step t331 (cl (not (tptp.memberP tptp.nil tptp.sk5))) :rule resolution :premises (t322 a191 t330))
% 26.31/26.51 (step t332 (cl (not (= (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6))))) (not (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5)))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6)))) :rule equiv_pos2)
% 26.31/26.51 (step t333 (cl (= (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)))) :rule refl)
% 26.31/26.51 (step t334 (cl (= (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule refl)
% 26.31/26.51 (step t335 (cl (= (tptp.memberP tptp.nil tptp.sk5) (tptp.memberP tptp.nil tptp.sk5))) :rule refl)
% 26.31/26.51 (step t336 (cl (= (= tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6))) :rule all_simplify)
% 26.31/26.51 (step t337 (cl (= (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5)) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6)))) :rule cong :premises (t333 t299 t301 t334 t335 t336))
% 26.31/26.51 (step t338 (cl (= (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6))))) :rule cong :premises (t297 t337))
% 26.31/26.51 (step t339 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) (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) (= U W)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t340)
% 26.31/26.51 (assume t340.a0 (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) (= U W))))
% 26.31/26.51 (step t340.t1 (cl (or (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil) (:= W tptp.sk5)))
% 26.31/26.51 (step t340.t2 (cl (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) :rule or :premises (t340.t1))
% 26.31/26.51 (step t340.t3 (cl (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) :rule resolution :premises (t340.t2 t340.a0))
% 26.31/26.51 (step t340 (cl (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) :rule subproof :discharge (t340.a0))
% 26.31/26.51 (step t341 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) :rule resolution :premises (t339 t340))
% 26.31/26.51 (step t342 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) (not (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5)))) :rule implies_neg2)
% 26.31/26.51 (step t343 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5))) (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5)))) :rule resolution :premises (t341 t342))
% 26.31/26.51 (step t344 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk6 tptp.sk5)))) :rule contraction :premises (t343))
% 26.31/26.51 (step t345 (cl (=> (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) (= U W))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6)))) :rule resolution :premises (t332 t338 t344))
% 26.31/26.51 (step t346 (cl (not (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) (= U W)))) (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6))) :rule implies :premises (t345))
% 26.31/26.51 (step t347 (cl (or (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.nil tptp.sk5) (= tptp.sk5 tptp.sk6))) :rule resolution :premises (t346 t316))
% 26.31/26.51 (step t348 (cl (not (tptp.memberP (tptp.cons tptp.sk6 tptp.nil) tptp.sk5))) :rule resolution :premises (t320 a196 a7 a191 a192 t331 t347))
% 26.31/26.51 (step t349 (cl (not (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) :rule or_pos)
% 26.31/26.51 (step t350 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule reordering :premises (t349))
% 26.31/26.51 (step t351 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t352)
% 26.31/26.51 (assume t352.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 26.31/26.51 (step t352.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk9) (:= V tptp.nil)))
% 26.31/26.51 (step t352.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) :rule or :premises (t352.t1))
% 26.31/26.51 (step t352.t3 (cl (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t352.t2 t352.a0))
% 26.31/26.51 (step t352 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) :rule subproof :discharge (t352.a0))
% 26.31/26.51 (step t353 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t351 t352))
% 26.31/26.51 (step t354 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule implies_neg2)
% 26.31/26.51 (step t355 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule resolution :premises (t353 t354))
% 26.31/26.51 (step t356 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))))) :rule contraction :premises (t355))
% 26.31/26.51 (step t357 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) :rule implies :premises (t356))
% 26.31/26.51 (step t358 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t359 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.31/26.51 (step t359.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t359.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t359.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 26.31/26.51 (step t359.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.31/26.51 (step t359.t5 (cl (= (= (tptp.hd (tptp.cons U V)) U) (= U (tptp.hd (tptp.cons U V))))) :rule all_simplify)
% 26.31/26.51 (step t359.t6 (cl (= (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule cong :premises (t359.t3 t359.t4 t359.t5))
% 26.31/26.51 (step t359 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) :rule bind)
% 26.31/26.51 (step t360 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule resolution :premises (t358 t359 a96))
% 26.31/26.51 (step t361 (cl (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t357 t360))
% 26.31/26.51 (step t362 (cl (= tptp.sk9 (tptp.hd (tptp.cons tptp.sk9 tptp.nil)))) :rule resolution :premises (t350 a7 t232 t361))
% 26.31/26.51 (step t363 (cl (not (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) :rule or_pos)
% 26.31/26.51 (step t364 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk9)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule reordering :premises (t363))
% 26.31/26.51 (step t365 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t366)
% 26.31/26.51 (assume t366.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 26.31/26.51 (step t366.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk9) (:= V tptp.nil)))
% 26.31/26.51 (step t366.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) :rule or :premises (t366.t1))
% 26.31/26.51 (step t366.t3 (cl (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t366.t2 t366.a0))
% 26.31/26.51 (step t366 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) :rule subproof :discharge (t366.a0))
% 26.31/26.51 (step t367 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t365 t366))
% 26.31/26.51 (step t368 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule implies_neg2)
% 26.31/26.51 (step t369 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule resolution :premises (t367 t368))
% 26.31/26.51 (step t370 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))))) :rule contraction :premises (t369))
% 26.31/26.51 (step t371 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) :rule implies :premises (t370))
% 26.31/26.51 (step t372 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t373 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.31/26.51 (step t373.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t373.t2 (cl (= V V)) :rule refl)
% 26.31/26.51 (step t373.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 26.31/26.51 (step t373.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.31/26.51 (step t373.t5 (cl (= (= (tptp.tl (tptp.cons U V)) V) (= V (tptp.tl (tptp.cons U V))))) :rule all_simplify)
% 26.31/26.51 (step t373.t6 (cl (= (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule cong :premises (t373.t3 t373.t4 t373.t5))
% 26.31/26.51 (step t373 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) :rule bind)
% 26.31/26.51 (step t374 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule resolution :premises (t372 t373 a95))
% 26.31/26.51 (step t375 (cl (or (not (tptp.ssItem tptp.sk9)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil))))) :rule resolution :premises (t371 t374))
% 26.31/26.51 (step t376 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk9 tptp.nil)))) :rule resolution :premises (t364 a7 t232 t375))
% 26.31/26.51 (step t377 (cl (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule or_pos)
% 26.31/26.51 (step t378 (cl (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule reordering :premises (t377))
% 26.31/26.51 (step t379 (cl (not (= (tptp.ssList tptp.sk1) (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (not (tptp.ssList tptp.sk1)) (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule equiv_pos2)
% 26.31/26.51 (step t380 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t184))
% 26.31/26.51 (step t381 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule and :premises (t184))
% 26.31/26.51 (step t382 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule trans :premises (t380 t381))
% 26.31/26.51 (step t383 (cl (= (tptp.ssList tptp.sk1) (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule cong :premises (t382))
% 26.31/26.51 (step t384 (cl (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) :rule resolution :premises (t379 t383 a185))
% 26.31/26.51 (step t385 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t386)
% 26.31/26.51 (assume t386.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))
% 26.31/26.51 (step t386.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule forall_inst :args ((:= U (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))
% 26.31/26.51 (step t386.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule or :premises (t386.t1))
% 26.31/26.51 (step t386.t3 (cl (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t386.t2 t386.a0))
% 26.31/26.51 (step t386 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule subproof :discharge (t386.a0))
% 26.31/26.51 (step t387 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t385 t386))
% 26.31/26.51 (step t388 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule implies_neg2)
% 26.31/26.51 (step t389 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule resolution :premises (t387 t388))
% 26.31/26.51 (step t390 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule contraction :premises (t389))
% 26.31/26.51 (step t391 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule implies :premises (t390))
% 26.31/26.51 (step t392 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t393 :args ((U $$unsorted) (:= U U)))
% 26.31/26.51 (step t393.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t393.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.31/26.51 (step t393.t3 (cl (= (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= U (tptp.cons (tptp.hd U) (tptp.tl U))))) :rule all_simplify)
% 26.31/26.51 (step t393.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 26.31/26.51 (step t393.t5 (cl (= (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule cong :premises (t393.t2 t393.t3 t393.t4))
% 26.31/26.51 (step t393 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))) :rule bind)
% 26.31/26.51 (step t394 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule resolution :premises (t392 t393 a103))
% 26.31/26.51 (step t395 (cl (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) (= tptp.nil (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t391 t394))
% 26.31/26.51 (step t396 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.cons (tptp.hd (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8)) (tptp.tl (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))) :rule resolution :premises (t378 t231 t384 t395))
% 26.31/26.51 (step t397 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule or_pos)
% 26.31/26.51 (step t398 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule reordering :premises (t397))
% 26.31/26.51 (step t399 (cl (not (= (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))))) (not (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule equiv_pos2)
% 26.31/26.51 (step t400 (cl (= (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)))) (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)))))) :rule refl)
% 26.31/26.51 (step t401 (cl (= (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule all_simplify)
% 26.31/26.51 (step t402 (cl (= (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule cong :premises (t301 t299 t401))
% 26.31/26.51 (step t403 (cl (= (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))))) :rule cong :premises (t400 t402))
% 26.31/26.51 (step t404 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) (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))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t405)
% 26.31/26.51 (assume t405.a0 (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)))))
% 26.31/26.51 (step t405.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil)))
% 26.31/26.51 (step t405.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t405.t1))
% 26.31/26.51 (step t405.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t405.t2 t405.a0))
% 26.31/26.51 (step t405 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t405.a0))
% 26.31/26.51 (step t406 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t404 t405))
% 26.31/26.51 (step t407 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 26.31/26.51 (step t408 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t406 t407))
% 26.31/26.51 (step t409 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t408))
% 26.31/26.51 (step t410 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule resolution :premises (t399 t403 t409))
% 26.31/26.51 (step t411 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule implies :premises (t410))
% 26.31/26.51 (step t412 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule resolution :premises (t411 a119))
% 26.31/26.51 (step t413 (cl (= (tptp.cons tptp.sk6 tptp.nil) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule resolution :premises (t398 a7 a192 t412))
% 26.31/26.51 (step t414 (cl (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) :rule or_pos)
% 26.31/26.51 (step t415 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)) (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule reordering :premises (t414))
% 26.31/26.51 (step t416 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 26.31/26.51 (anchor :step t417)
% 26.31/26.51 (assume t417.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 26.31/26.51 (step t417.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))))
% 26.31/26.51 (step t417.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule or :premises (t417.t1))
% 26.31/26.51 (step t417.t3 (cl (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule resolution :premises (t417.t2 t417.a0))
% 26.31/26.51 (step t417 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule subproof :discharge (t417.a0))
% 26.31/26.51 (step t418 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule resolution :premises (t416 t417))
% 26.31/26.51 (step t419 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule implies_neg2)
% 26.31/26.51 (step t420 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule resolution :premises (t418 t419))
% 26.31/26.51 (step t421 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))))) :rule contraction :premises (t420))
% 26.31/26.51 (step t422 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule implies :premises (t421))
% 26.31/26.51 (step t423 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule equiv_pos2)
% 26.31/26.51 (anchor :step t424 :args ((U $$unsorted) (:= U U)))
% 26.31/26.51 (step t424.t1 (cl (= U U)) :rule refl)
% 26.31/26.51 (step t424.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.31/26.51 (step t424.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 26.31/26.51 (step t424.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule cong :premises (t424.t2 t424.t3))
% 26.31/26.51 (step t424 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) :rule bind)
% 26.31/26.51 (step t425 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t423 t424 a72))
% 26.31/26.51 (step t426 (cl (or (not (tptp.ssList (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil)))) :rule resolution :premises (t422 t425))
% 26.31/26.51 (step t427 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk8) tptp.nil))) :rule resolution :premises (t415 t384 t426))
% 26.31/26.51 (step t428 (cl) :rule resolution :premises (t85 t169 t318 t348 t362 t376 t396 t272 t413 t427))
% 26.31/26.51
% 26.31/26.51 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.mppWFnLgNb/cvc5---1.0.5_2720.smt2
% 26.32/26.52 % cvc5---1.0.5 exiting
% 26.32/26.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------