TSTP Solution File: SWC410-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC410-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n024.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:02:00 EDT 2024
% Result : Unsatisfiable 21.61s 21.86s
% Output : Proof 21.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : SWC410-1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.15 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 26 14:45:24 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.52/10.73 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.54/15.75 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.53/20.77 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 21.61/21.86 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.2AHZU2wDmp/cvc5---1.0.5_23084.smt2
% 21.61/21.86 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.2AHZU2wDmp/cvc5---1.0.5_23084.smt2
% 21.61/21.89 (assume a0 (tptp.equalelemsP tptp.nil))
% 21.61/21.89 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 21.61/21.89 (assume a2 (tptp.strictorderedP tptp.nil))
% 21.61/21.89 (assume a3 (tptp.totalorderedP tptp.nil))
% 21.61/21.89 (assume a4 (tptp.strictorderP tptp.nil))
% 21.61/21.89 (assume a5 (tptp.totalorderP tptp.nil))
% 21.61/21.89 (assume a6 (tptp.cyclefreeP tptp.nil))
% 21.61/21.89 (assume a7 (tptp.ssList tptp.nil))
% 21.61/21.89 (assume a8 (tptp.ssItem tptp.skac3))
% 21.61/21.89 (assume a9 (tptp.ssItem tptp.skac2))
% 21.61/21.89 (assume a10 (not (tptp.singletonP tptp.nil)))
% 21.61/21.89 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 21.61/21.89 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 21.61/21.89 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 21.61/21.89 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 21.61/21.89 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 21.61/21.89 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 21.61/21.89 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 21.61/21.89 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 21.61/21.89 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 21.61/21.89 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 21.61/21.89 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 21.61/21.89 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 21.61/21.89 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 21.61/21.89 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 21.61/21.89 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 21.61/21.89 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 21.61/21.89 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 21.61/21.89 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 21.61/21.89 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 21.61/21.89 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 21.61/21.89 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 21.61/21.89 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 21.61/21.89 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 21.61/21.89 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 21.61/21.89 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 21.61/21.89 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 21.61/21.89 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 21.61/21.89 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 21.61/21.89 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 21.61/21.89 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 21.61/21.89 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 21.61/21.89 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 21.61/21.89 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 21.61/21.89 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 21.61/21.89 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 21.61/21.89 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 21.61/21.89 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 21.61/21.89 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 21.61/21.89 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 21.61/21.89 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 21.61/21.89 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 21.61/21.89 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 21.61/21.89 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 21.61/21.89 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 21.61/21.89 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 21.61/21.89 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 21.61/21.89 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 21.61/21.89 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 21.61/21.89 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 21.61/21.89 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 21.61/21.89 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 21.61/21.89 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 21.61/21.89 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 21.61/21.89 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 21.61/21.89 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 21.61/21.89 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 21.61/21.89 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 21.61/21.89 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 21.61/21.89 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 21.61/21.89 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 21.61/21.89 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 21.61/21.89 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 21.61/21.89 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.61/21.89 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 21.61/21.89 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.61/21.89 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 21.61/21.89 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.61/21.89 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 21.61/21.89 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 21.61/21.89 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 21.61/21.89 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 21.61/21.89 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 21.61/21.89 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 21.61/21.89 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 21.61/21.89 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 21.61/21.89 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 21.61/21.89 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 21.61/21.89 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 21.61/21.89 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 21.61/21.89 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 21.61/21.89 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 21.61/21.89 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 21.61/21.89 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 21.61/21.89 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 21.61/21.89 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 21.61/21.89 (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))))
% 21.61/21.89 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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))))
% 21.61/21.89 (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)))))
% 21.61/21.89 (assume a185 (tptp.ssList tptp.sk1))
% 21.61/21.89 (assume a186 (tptp.ssList tptp.sk2))
% 21.61/21.89 (assume a187 (tptp.ssList tptp.sk3))
% 21.61/21.89 (assume a188 (tptp.ssList tptp.sk4))
% 21.61/21.89 (assume a189 (= tptp.sk2 tptp.sk4))
% 21.61/21.89 (assume a190 (= tptp.sk1 tptp.sk3))
% 21.61/21.89 (assume a191 (tptp.ssItem tptp.sk5))
% 21.61/21.89 (assume a192 (tptp.memberP tptp.sk2 tptp.sk5))
% 21.61/21.89 (assume a193 (not (tptp.memberP tptp.sk1 tptp.sk5)))
% 21.61/21.89 (assume a194 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 21.61/21.89 (assume a195 (or (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk3 tptp.nil)))
% 21.61/21.89 (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))))
% 21.61/21.89 (step t1 (cl (not (= (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) (not (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule equiv_pos2)
% 21.61/21.89 (step t2 (cl (= (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) true) (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 21.61/21.89 (step t3 (cl (not (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) true)) (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv1 :premises (t2))
% 21.61/21.89 (step t4 (cl (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) (= (tptp.memberP tptp.sk3 tptp.sk5) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))))) :rule all_simplify)
% 21.61/21.89 (step t5 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule refl)
% 21.61/21.89 (step t6 (cl (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5))) :rule all_simplify)
% 21.61/21.89 (step t7 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule cong :premises (t5 t6))
% 21.61/21.89 (step t8 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5)) true)) :rule all_simplify)
% 21.61/21.89 (step t9 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) true)) :rule trans :premises (t7 t8))
% 21.61/21.89 (step t10 (cl (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) true)) :rule trans :premises (t4 t9))
% 21.61/21.89 (step t11 (cl (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t3 t10))
% 21.61/21.89 (step t12 (cl (= (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule refl)
% 21.61/21.89 (step t13 (cl (= (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule refl)
% 21.61/21.89 (step t14 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule refl)
% 21.61/21.89 (step t15 (cl (= (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule cong :premises (t11 t12 t13 t14))
% 21.61/21.89 (step t16 (cl (not (= (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) (not (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule equiv_pos2)
% 21.61/21.89 (step t17 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule refl)
% 21.61/21.89 (step t18 (cl (= (= (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))))) :rule equiv_simplify)
% 21.61/21.89 (step t19 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (not (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))))) :rule equiv2 :premises (t18))
% 21.61/21.89 (step t20 (cl (not (not (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule not_not)
% 21.61/21.89 (step t21 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t19 t20))
% 21.61/21.89 (step t22 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t23)
% 21.61/21.89 (assume t23.a0 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.61/21.89 (assume t23.a1 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 21.61/21.89 (assume t23.a2 (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))
% 21.61/21.89 (assume t23.a3 (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))
% 21.61/21.89 (step t23.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 21.61/21.89 (step t23.t2 (cl (= (= true false) false)) :rule all_simplify)
% 21.61/21.89 (step t23.t3 (cl (= (= (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) true) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule equiv_simplify)
% 21.61/21.89 (step t23.t4 (cl (= (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) true) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule equiv2 :premises (t23.t3))
% 21.61/21.89 (step t23.t5 (cl (= (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) true)) :rule resolution :premises (t23.t4 t23.a3))
% 21.61/21.89 (step t23.t6 (cl (= true (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule symm :premises (t23.t5))
% 21.61/21.89 (step t23.t7 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule symm :premises (t23.a2))
% 21.61/21.89 (step t23.t8 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk3)) :rule symm :premises (t23.a1))
% 21.61/21.89 (step t23.t9 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk3)) :rule trans :premises (t23.t7 t23.t8))
% 21.61/21.89 (step t23.t10 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.61/21.89 (step t23.t11 (cl (= (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t23.t9 t23.t10))
% 21.61/21.89 (step t23.t12 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 21.61/21.89 (step t23.t13 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv2 :premises (t23.t12))
% 21.61/21.89 (step t23.t14 (cl (not (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule not_not)
% 21.61/21.89 (step t23.t15 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t23.t13 t23.t14))
% 21.61/21.89 (step t23.t16 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false)) :rule resolution :premises (t23.t15 t23.a0))
% 21.61/21.89 (step t23.t17 (cl (= true false)) :rule trans :premises (t23.t6 t23.t11 t23.t16))
% 21.61/21.89 (step t23.t18 (cl false) :rule resolution :premises (t23.t1 t23.t2 t23.t17))
% 21.61/21.89 (step t23 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) :rule subproof :discharge (t23.a0 t23.a1 t23.a2 t23.a3))
% 21.61/21.89 (step t24 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.61/21.89 (step t25 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 21.61/21.89 (step t26 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_pos)
% 21.61/21.89 (step t27 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) :rule and_pos)
% 21.61/21.89 (step t28 (cl false (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t23 t24 t25 t26 t27))
% 21.61/21.89 (step t29 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) false) :rule reordering :premises (t28))
% 21.61/21.89 (step t30 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) false) :rule contraction :premises (t29))
% 21.61/21.89 (step t31 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) false) :rule resolution :premises (t22 t30))
% 21.61/21.89 (step t32 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (not false)) :rule implies_neg2)
% 21.61/21.89 (step t33 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false)) :rule resolution :premises (t31 t32))
% 21.61/21.89 (step t34 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false)) :rule contraction :premises (t33))
% 21.61/21.89 (step t35 (cl (= (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))))) :rule implies_simplify)
% 21.61/21.89 (step t36 (cl (not (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false)) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule equiv1 :premises (t35))
% 21.61/21.89 (step t37 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t34 t36))
% 21.61/21.89 (step t38 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) false)) :rule resolution :premises (t21 t37))
% 21.61/21.89 (step t39 (cl (= (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) false))) :rule cong :premises (t17 t38))
% 21.61/21.89 (step t40 (cl (= (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) false) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule all_simplify)
% 21.61/21.89 (step t41 (cl (= (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule trans :premises (t39 t40))
% 21.61/21.89 (step t42 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t43)
% 21.61/21.89 (assume t43.a0 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.61/21.89 (assume t43.a1 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 21.61/21.89 (assume t43.a2 (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))
% 21.61/21.89 (assume t43.a3 (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))
% 21.61/21.89 (step t43.t1 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule and_neg)
% 21.61/21.89 (step t43.t2 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t43.t1 t43.a0 t43.a1 t43.a3 t43.a2))
% 21.61/21.89 (step t43 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule subproof :discharge (t43.a0 t43.a1 t43.a2 t43.a3))
% 21.61/21.89 (step t44 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.61/21.89 (step t45 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 21.61/21.89 (step t46 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) :rule and_pos)
% 21.61/21.89 (step t47 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_pos)
% 21.61/21.89 (step t48 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t43 t44 t45 t46 t47))
% 21.61/21.89 (step t49 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule reordering :premises (t48))
% 21.61/21.89 (step t50 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule contraction :premises (t49))
% 21.61/21.89 (step t51 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t42 t50))
% 21.61/21.89 (step t52 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule implies_neg2)
% 21.61/21.89 (step t53 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t51 t52))
% 21.61/21.89 (step t54 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule contraction :premises (t53))
% 21.61/21.89 (step t55 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t16 t41 t54))
% 21.61/21.89 (step t56 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule not_and :premises (t55))
% 21.61/21.89 (step t57 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule or_neg)
% 21.61/21.89 (step t58 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule or_neg)
% 21.61/21.89 (step t59 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule or_neg)
% 21.61/21.89 (step t60 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule or_neg)
% 21.61/21.89 (step t61 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t56 t57 t58 t59 t60))
% 21.61/21.89 (step t62 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule contraction :premises (t61))
% 21.61/21.89 (step t63 (cl (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t1 t15 t62))
% 21.61/21.89 (step t64 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule or :premises (t63))
% 21.61/21.89 (step t65 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule or_pos)
% 21.61/21.89 (step t66 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule reordering :premises (t65))
% 21.61/21.89 (step t67 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)) :rule or_pos)
% 21.61/21.89 (step t68 (cl (= tptp.nil tptp.sk3) (tptp.ssList (tptp.tl tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t67))
% 21.61/21.89 (step t69 (cl (not (= (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk3 tptp.sk3) (not (tptp.neq tptp.sk3 tptp.nil))))) (not (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk3 tptp.sk3) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule equiv_pos2)
% 21.61/21.89 (step t70 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 21.61/21.89 (step t71 (cl (= (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) true) (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)))) :rule equiv_simplify)
% 21.61/21.89 (step t72 (cl (not (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) true)) (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3))) :rule equiv1 :premises (t71))
% 21.61/21.89 (step t73 (cl (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) (= (tptp.neq tptp.sk3 tptp.sk3) (not (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule all_simplify)
% 21.61/21.89 (step t74 (cl (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.sk3))) :rule refl)
% 21.61/21.89 (step t75 (cl (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3))) :rule all_simplify)
% 21.61/21.89 (step t76 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.sk3)))) :rule cong :premises (t74 t75))
% 21.61/21.89 (step t77 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.sk3)) true)) :rule all_simplify)
% 21.61/21.89 (step t78 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) true)) :rule trans :premises (t76 t77))
% 21.61/21.89 (step t79 (cl (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) true)) :rule trans :premises (t73 t78))
% 21.61/21.89 (step t80 (cl (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3))) :rule resolution :premises (t72 t79))
% 21.61/21.89 (step t81 (cl (= (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule refl)
% 21.61/21.89 (step t82 (cl (= (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk3 tptp.sk3) (not (tptp.neq tptp.sk3 tptp.nil))))) :rule cong :premises (t70 t80 t81))
% 21.61/21.89 (step t83 (cl (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule and_neg)
% 21.61/21.89 (step t84 (cl (=> (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t85)
% 21.61/21.89 (assume t85.a0 (= tptp.nil tptp.sk3))
% 21.61/21.89 (assume t85.a1 (not (tptp.neq tptp.sk3 tptp.sk3)))
% 21.61/21.89 (step t85.t1 (cl (=> (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil))) (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t85.t2)
% 21.61/21.89 (assume t85.t2.a0 (not (tptp.neq tptp.sk3 tptp.sk3)))
% 21.61/21.89 (assume t85.t2.a1 (= tptp.nil tptp.sk3))
% 21.61/21.89 (step t85.t2.t1 (cl (= (= (tptp.neq tptp.sk3 tptp.nil) false) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule equiv_simplify)
% 21.61/21.89 (step t85.t2.t2 (cl (not (= (tptp.neq tptp.sk3 tptp.nil) false)) (not (tptp.neq tptp.sk3 tptp.nil))) :rule equiv1 :premises (t85.t2.t1))
% 21.61/21.89 (step t85.t2.t3 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 21.61/21.89 (step t85.t2.t4 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t85.t2.a1))
% 21.61/21.89 (step t85.t2.t5 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t85.t2.t4))
% 21.61/21.89 (step t85.t2.t6 (cl (= (tptp.neq tptp.sk3 tptp.nil) (tptp.neq tptp.sk3 tptp.sk3))) :rule cong :premises (t85.t2.t3 t85.t2.t5))
% 21.61/21.89 (step t85.t2.t7 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) false) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule equiv_simplify)
% 21.61/21.89 (step t85.t2.t8 (cl (= (tptp.neq tptp.sk3 tptp.sk3) false) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule equiv2 :premises (t85.t2.t7))
% 21.61/21.89 (step t85.t2.t9 (cl (not (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (tptp.neq tptp.sk3 tptp.sk3)) :rule not_not)
% 21.61/21.89 (step t85.t2.t10 (cl (= (tptp.neq tptp.sk3 tptp.sk3) false) (tptp.neq tptp.sk3 tptp.sk3)) :rule resolution :premises (t85.t2.t8 t85.t2.t9))
% 21.61/21.89 (step t85.t2.t11 (cl (= (tptp.neq tptp.sk3 tptp.sk3) false)) :rule resolution :premises (t85.t2.t10 t85.t2.a0))
% 21.61/21.89 (step t85.t2.t12 (cl (= (tptp.neq tptp.sk3 tptp.nil) false)) :rule trans :premises (t85.t2.t6 t85.t2.t11))
% 21.61/21.89 (step t85.t2.t13 (cl (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t85.t2.t2 t85.t2.t12))
% 21.61/21.89 (step t85.t2 (cl (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil))) :rule subproof :discharge (t85.t2.a0 t85.t2.a1))
% 21.61/21.89 (step t85.t3 (cl (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.sk3))) :rule and_pos)
% 21.61/21.89 (step t85.t4 (cl (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.61/21.89 (step t85.t5 (cl (not (tptp.neq tptp.sk3 tptp.nil)) (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t85.t2 t85.t3 t85.t4))
% 21.61/21.89 (step t85.t6 (cl (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule reordering :premises (t85.t5))
% 21.61/21.89 (step t85.t7 (cl (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule contraction :premises (t85.t6))
% 21.61/21.89 (step t85.t8 (cl (=> (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t85.t1 t85.t7))
% 21.61/21.89 (step t85.t9 (cl (=> (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil))) (not (not (tptp.neq tptp.sk3 tptp.nil)))) :rule implies_neg2)
% 21.61/21.89 (step t85.t10 (cl (=> (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil))) (=> (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule resolution :premises (t85.t8 t85.t9))
% 21.61/21.89 (step t85.t11 (cl (=> (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule contraction :premises (t85.t10))
% 21.61/21.89 (step t85.t12 (cl (not (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule implies :premises (t85.t11))
% 21.61/21.89 (step t85.t13 (cl (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 21.61/21.89 (step t85.t14 (cl (and (not (tptp.neq tptp.sk3 tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t85.t13 t85.a1 t85.a0))
% 21.61/21.89 (step t85.t15 (cl (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t85.t12 t85.t14))
% 21.61/21.89 (step t85 (cl (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule subproof :discharge (t85.a0 t85.a1))
% 21.61/21.89 (step t86 (cl (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.61/21.89 (step t87 (cl (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.sk3))) :rule and_pos)
% 21.61/21.89 (step t88 (cl (not (tptp.neq tptp.sk3 tptp.nil)) (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t85 t86 t87))
% 21.61/21.89 (step t89 (cl (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule reordering :premises (t88))
% 21.61/21.89 (step t90 (cl (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule contraction :premises (t89))
% 21.61/21.89 (step t91 (cl (=> (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t84 t90))
% 21.61/21.89 (step t92 (cl (=> (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (not (not (tptp.neq tptp.sk3 tptp.nil)))) :rule implies_neg2)
% 21.61/21.89 (step t93 (cl (=> (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (=> (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule resolution :premises (t91 t92))
% 21.61/21.89 (step t94 (cl (=> (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule contraction :premises (t93))
% 21.61/21.89 (step t95 (cl (not (and (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule implies :premises (t94))
% 21.61/21.89 (step t96 (cl (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t83 t95))
% 21.61/21.89 (step t97 (cl (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 21.61/21.89 (step t98 (cl (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (not (not (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule or_neg)
% 21.61/21.89 (step t99 (cl (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (not (not (tptp.neq tptp.sk3 tptp.nil)))) :rule or_neg)
% 21.61/21.89 (step t100 (cl (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil))) (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule resolution :premises (t96 t97 t98 t99))
% 21.61/21.89 (step t101 (cl (or (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule contraction :premises (t100))
% 21.61/21.89 (step t102 (cl (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk3 tptp.sk3) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule resolution :premises (t69 t82 t101))
% 21.61/21.89 (step t103 (cl (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk3 tptp.sk3) (not (tptp.neq tptp.sk3 tptp.nil))) :rule or :premises (t102))
% 21.61/21.89 (step t104 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (tptp.neq tptp.sk3 tptp.sk3)) :rule reordering :premises (t103))
% 21.61/21.89 (step t105 (cl (not (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))) :rule or_pos)
% 21.61/21.89 (step t106 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.sk3)) (not (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule reordering :premises (t105))
% 21.61/21.89 (step t107 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t108)
% 21.61/21.89 (assume t108.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 21.61/21.89 (step t108.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule forall_inst :args ((:= V tptp.sk3)))
% 21.61/21.89 (step t108.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule or :premises (t108.t1))
% 21.61/21.89 (step t108.t3 (cl (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule resolution :premises (t108.t2 t108.a0))
% 21.61/21.89 (step t108 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule subproof :discharge (t108.a0))
% 21.61/21.89 (step t109 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule resolution :premises (t107 t108))
% 21.61/21.89 (step t110 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (not (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule implies_neg2)
% 21.61/21.89 (step t111 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule resolution :premises (t109 t110))
% 21.61/21.89 (step t112 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule contraction :premises (t111))
% 21.61/21.89 (step t113 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule implies :premises (t112))
% 21.61/21.89 (step t114 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 21.61/21.89 (step t115 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 21.61/21.89 (anchor :step t116 :args ((V $$unsorted) (:= V V)))
% 21.61/21.89 (step t116.t1 (cl (= V V)) :rule refl)
% 21.61/21.89 (step t116.t2 (cl (= (= V V) true)) :rule all_simplify)
% 21.61/21.89 (step t116.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t116.t2))
% 21.61/21.89 (step t116.t4 (cl (= (not true) false)) :rule all_simplify)
% 21.61/21.89 (step t116.t5 (cl (= (not (= V V)) false)) :rule trans :premises (t116.t3 t116.t4))
% 21.61/21.89 (step t116.t6 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 21.61/21.89 (step t116.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 21.61/21.89 (step t116.t8 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t116.t5 t116.t6 t116.t7 t116.t7))
% 21.61/21.89 (step t116.t9 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 21.61/21.89 (step t116.t10 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t116.t8 t116.t9))
% 21.61/21.89 (step t116 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 21.61/21.89 (step t117 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t115 t116))
% 21.61/21.89 (step t118 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t114 t117 a114))
% 21.61/21.89 (step t119 (cl (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule resolution :premises (t113 t118))
% 21.61/21.89 (step t120 (cl (not (tptp.neq tptp.sk3 tptp.sk3))) :rule resolution :premises (t106 a187 t119))
% 21.61/21.89 (step t121 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk3 tptp.nil)) :rule or :premises (a195))
% 21.61/21.89 (step t122 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)) :rule or_pos)
% 21.61/21.89 (step t123 (cl (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t122))
% 21.61/21.89 (step t124 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t125)
% 21.61/21.89 (assume t125.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 21.61/21.89 (step t125.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk4)))
% 21.61/21.89 (step t125.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule or :premises (t125.t1))
% 21.61/21.89 (step t125.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t125.t2 t125.a0))
% 21.61/21.89 (step t125 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule subproof :discharge (t125.a0))
% 21.61/21.89 (step t126 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t124 t125))
% 21.61/21.89 (step t127 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 21.61/21.89 (step t128 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t126 t127))
% 21.61/21.89 (step t129 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t128))
% 21.61/21.89 (step t130 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule implies :premises (t129))
% 21.61/21.89 (step t131 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 21.61/21.89 (anchor :step t132 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 21.61/21.89 (step t132.t1 (cl (= U U)) :rule refl)
% 21.61/21.89 (step t132.t2 (cl (= V V)) :rule refl)
% 21.61/21.89 (step t132.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.61/21.89 (step t132.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 21.61/21.89 (step t132.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 21.61/21.89 (step t132.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 21.61/21.89 (step t132.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t132.t3 t132.t4 t132.t5 t132.t6))
% 21.61/21.89 (step t132 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 21.61/21.89 (step t133 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t131 t132 a99))
% 21.61/21.89 (step t134 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t130 t133))
% 21.61/21.89 (step t135 (cl (not (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)))) (not (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv_pos2)
% 21.61/21.89 (step t136 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 21.61/21.89 (step t137 (cl (= (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule refl)
% 21.61/21.89 (step t138 (cl (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule cong :premises (t70 t136 t137 t11))
% 21.61/21.89 (step t139 (cl (not (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) (not (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule equiv_pos2)
% 21.61/21.89 (step t140 (cl (= (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule refl)
% 21.61/21.89 (step t141 (cl (= (= (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) :rule equiv_simplify)
% 21.61/21.89 (step t142 (cl (= (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (not (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) :rule equiv2 :premises (t141))
% 21.61/21.89 (step t143 (cl (not (not (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule not_not)
% 21.61/21.89 (step t144 (cl (= (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t142 t143))
% 21.61/21.89 (step t145 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t146)
% 21.61/21.89 (assume t146.a0 (tptp.memberP tptp.sk4 tptp.sk5))
% 21.61/21.89 (assume t146.a1 (= tptp.nil tptp.sk4))
% 21.61/21.89 (assume t146.a2 (= tptp.nil tptp.sk3))
% 21.61/21.89 (assume t146.a3 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.61/21.89 (step t146.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 21.61/21.89 (step t146.t2 (cl (= (= false true) false)) :rule all_simplify)
% 21.61/21.89 (step t146.t3 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 21.61/21.89 (step t146.t4 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv2 :premises (t146.t3))
% 21.61/21.89 (step t146.t5 (cl (not (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule not_not)
% 21.61/21.89 (step t146.t6 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t146.t4 t146.t5))
% 21.61/21.89 (step t146.t7 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false)) :rule resolution :premises (t146.t6 t146.a3))
% 21.61/21.89 (step t146.t8 (cl (= false (tptp.memberP tptp.sk3 tptp.sk5))) :rule symm :premises (t146.t7))
% 21.61/21.89 (step t146.t9 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t146.a2))
% 21.61/21.89 (step t146.t10 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t146.a1))
% 21.61/21.89 (step t146.t11 (cl (= tptp.nil tptp.sk4)) :rule symm :premises (t146.t10))
% 21.61/21.89 (step t146.t12 (cl (= tptp.sk3 tptp.sk4)) :rule trans :premises (t146.t9 t146.t11))
% 21.61/21.89 (step t146.t13 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.61/21.89 (step t146.t14 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t146.t12 t146.t13))
% 21.61/21.89 (step t146.t15 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) true) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv_simplify)
% 21.61/21.89 (step t146.t16 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv2 :premises (t146.t15))
% 21.61/21.89 (step t146.t17 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true)) :rule resolution :premises (t146.t16 t146.a0))
% 21.61/21.89 (step t146.t18 (cl (= false true)) :rule trans :premises (t146.t8 t146.t14 t146.t17))
% 21.61/21.89 (step t146.t19 (cl false) :rule resolution :premises (t146.t1 t146.t2 t146.t18))
% 21.61/21.89 (step t146 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) false) :rule subproof :discharge (t146.a0 t146.a1 t146.a2 t146.a3))
% 21.61/21.89 (step t147 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule and_pos)
% 21.61/21.89 (step t148 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 21.61/21.89 (step t149 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.61/21.89 (step t150 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.61/21.89 (step t151 (cl false (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t146 t147 t148 t149 t150))
% 21.61/21.89 (step t152 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) false) :rule reordering :premises (t151))
% 21.61/21.89 (step t153 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) false) :rule contraction :premises (t152))
% 21.61/21.89 (step t154 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) false) :rule resolution :premises (t145 t153))
% 21.61/21.89 (step t155 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (not false)) :rule implies_neg2)
% 21.61/21.89 (step t156 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false)) :rule resolution :premises (t154 t155))
% 21.61/21.89 (step t157 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false)) :rule contraction :premises (t156))
% 21.61/21.89 (step t158 (cl (= (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) :rule implies_simplify)
% 21.61/21.89 (step t159 (cl (not (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false)) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule equiv1 :premises (t158))
% 21.61/21.89 (step t160 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t157 t159))
% 21.61/21.89 (step t161 (cl (= (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) false)) :rule resolution :premises (t144 t160))
% 21.61/21.89 (step t162 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) false))) :rule cong :premises (t140 t161))
% 21.61/21.89 (step t163 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) false) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) :rule all_simplify)
% 21.61/21.89 (step t164 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))))) :rule trans :premises (t162 t163))
% 21.61/21.89 (step t165 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t166)
% 21.61/21.89 (assume t166.a0 (= tptp.nil tptp.sk3))
% 21.61/21.89 (assume t166.a1 (= tptp.nil tptp.sk4))
% 21.61/21.89 (assume t166.a2 (tptp.memberP tptp.sk4 tptp.sk5))
% 21.61/21.89 (assume t166.a3 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.61/21.89 (step t166.t1 (cl (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule and_neg)
% 21.61/21.89 (step t166.t2 (cl (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t166.t1 t166.a2 t166.a1 t166.a0 t166.a3))
% 21.61/21.89 (step t166 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule subproof :discharge (t166.a0 t166.a1 t166.a2 t166.a3))
% 21.61/21.89 (step t167 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.61/21.89 (step t168 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 21.61/21.89 (step t169 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule and_pos)
% 21.61/21.89 (step t170 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.61/21.89 (step t171 (cl (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t166 t167 t168 t169 t170))
% 21.61/21.89 (step t172 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule reordering :premises (t171))
% 21.61/21.89 (step t173 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule contraction :premises (t172))
% 21.61/21.89 (step t174 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t165 t173))
% 21.61/21.89 (step t175 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule implies_neg2)
% 21.61/21.89 (step t176 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t174 t175))
% 21.61/21.89 (step t177 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule contraction :premises (t176))
% 21.61/21.89 (step t178 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t139 t164 t177))
% 21.61/21.89 (step t179 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule not_and :premises (t178))
% 21.61/21.89 (step t180 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 21.61/21.89 (step t181 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 21.61/21.89 (step t182 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule or_neg)
% 21.61/21.89 (step t183 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule or_neg)
% 21.61/21.89 (step t184 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t179 t180 t181 t182 t183))
% 21.61/21.89 (step t185 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule contraction :premises (t184))
% 21.61/21.89 (step t186 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t135 t138 t185))
% 21.61/21.89 (step t187 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule or :premises (t186))
% 21.61/21.89 (step t188 (cl (not (= tptp.nil tptp.sk4)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t187))
% 21.61/21.89 (step t189 (cl (not (= (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv_pos2)
% 21.61/21.89 (step t190 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 21.61/21.89 (step t191 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t190 a190 a189))
% 21.61/21.89 (step t192 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t191))
% 21.61/21.89 (step t193 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.61/21.89 (step t194 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t192 t193))
% 21.61/21.89 (step t195 (cl (= (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule cong :premises (t194))
% 21.61/21.89 (step t196 (cl (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t189 t195 a193))
% 21.61/21.89 (step t197 (cl (not (= (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule equiv_pos2)
% 21.61/21.89 (step t198 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t191))
% 21.61/21.89 (step t199 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.61/21.89 (step t200 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t198 t199))
% 21.61/21.89 (step t201 (cl (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t197 t200 a192))
% 21.61/21.89 (step t202 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t104 t120 t121 t123 t134 a188 a7 t188 t196 t201))
% 21.61/21.89 (step t203 (cl (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t202))
% 21.61/21.89 (step t204 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t205)
% 21.61/21.89 (assume t205.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 21.61/21.89 (step t205.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 21.61/21.89 (step t205.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule or :premises (t205.t1))
% 21.61/21.89 (step t205.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t205.t2 t205.a0))
% 21.61/21.89 (step t205 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t205.a0))
% 21.61/21.89 (step t206 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t204 t205))
% 21.61/21.89 (step t207 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 21.61/21.89 (step t208 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t206 t207))
% 21.61/21.89 (step t209 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t208))
% 21.61/21.89 (step t210 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies :premises (t209))
% 21.61/21.89 (step t211 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t210 a74))
% 21.61/21.89 (step t212 (cl (tptp.ssList (tptp.tl tptp.sk3))) :rule resolution :premises (t68 t203 a187 t211))
% 21.61/21.89 (step t213 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)) :rule or_pos)
% 21.61/21.89 (step t214 (cl (= tptp.nil tptp.sk3) (tptp.ssItem (tptp.hd tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t213))
% 21.61/21.89 (step t215 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t216)
% 21.61/21.89 (assume t216.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 21.61/21.89 (step t216.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 21.61/21.89 (step t216.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule or :premises (t216.t1))
% 21.61/21.89 (step t216.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t216.t2 t216.a0))
% 21.61/21.89 (step t216 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t216.a0))
% 21.61/21.89 (step t217 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t215 t216))
% 21.61/21.89 (step t218 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 21.61/21.89 (step t219 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t217 t218))
% 21.61/21.89 (step t220 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t219))
% 21.61/21.89 (step t221 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies :premises (t220))
% 21.61/21.89 (step t222 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t221 a75))
% 21.61/21.89 (step t223 (cl (tptp.ssItem (tptp.hd tptp.sk3))) :rule resolution :premises (t214 t203 a187 t222))
% 21.61/21.89 (step t224 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule equiv_pos2)
% 21.61/21.89 (step t225 (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)
% 21.61/21.89 (step t226 (cl (= (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) :rule refl)
% 21.61/21.89 (step t227 (cl (= (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))))) :rule refl)
% 21.61/21.89 (step t228 (cl (= (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule all_simplify)
% 21.61/21.89 (step t229 (cl (= (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule cong :premises (t226 t227 t228))
% 21.61/21.89 (step t230 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule cong :premises (t225 t229))
% 21.61/21.89 (step t231 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (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)
% 21.61/21.89 (anchor :step t232)
% 21.61/21.89 (assume t232.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)))))
% 21.61/21.89 (step t232.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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk3)) (:= V (tptp.tl tptp.sk3))))
% 21.61/21.89 (step t232.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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule or :premises (t232.t1))
% 21.61/21.89 (step t232.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule resolution :premises (t232.t2 t232.a0))
% 21.61/21.89 (step t232 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule subproof :discharge (t232.a0))
% 21.61/21.89 (step t233 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule resolution :premises (t231 t232))
% 21.61/21.89 (step t234 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule implies_neg2)
% 21.61/21.89 (step t235 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t233 t234))
% 21.61/21.89 (step t236 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule contraction :premises (t235))
% 21.61/21.89 (step t237 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t224 t230 t236))
% 21.61/21.89 (step t238 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule implies :premises (t237))
% 21.61/21.89 (step t239 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule resolution :premises (t238 a119))
% 21.61/21.89 (step t240 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule resolution :premises (t66 t212 t223 t239))
% 21.61/21.89 (step t241 (cl (not (or (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) :rule or_pos)
% 21.61/21.89 (step t242 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5) (not (or (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule reordering :premises (t241))
% 21.61/21.89 (step t243 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule or_pos)
% 21.61/21.89 (step t244 (cl (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule reordering :premises (t243))
% 21.61/21.89 (step t245 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) 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)
% 21.61/21.89 (anchor :step t246)
% 21.61/21.89 (assume t246.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 21.61/21.89 (step t246.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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk3)) (:= V tptp.nil)))
% 21.61/21.89 (step t246.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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule or :premises (t246.t1))
% 21.61/21.89 (step t246.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t246.t2 t246.a0))
% 21.61/21.89 (step t246 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule subproof :discharge (t246.a0))
% 21.61/21.89 (step t247 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t245 t246))
% 21.61/21.89 (step t248 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 21.61/21.89 (step t249 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) 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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t247 t248))
% 21.61/21.89 (step t250 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule contraction :premises (t249))
% 21.61/21.89 (step t251 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule implies :premises (t250))
% 21.61/21.89 (step t252 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t251 a85))
% 21.61/21.89 (step t253 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule resolution :premises (t244 a7 t223 t252))
% 21.61/21.89 (step t254 (cl (not (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) :rule or_pos)
% 21.61/21.89 (step t255 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)))) :rule reordering :premises (t254))
% 21.61/21.89 (step t256 (cl (not (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)) :rule or_pos)
% 21.61/21.89 (step t257 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5) (not (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule reordering :premises (t256))
% 21.61/21.89 (step t258 (cl (not (= (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))))) (not (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule equiv_pos2)
% 21.61/21.89 (step t259 (cl (= (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule refl)
% 21.61/21.89 (step t260 (cl (= (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))))) :rule cong :premises (t11 t12 t259))
% 21.61/21.89 (step t261 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule and_neg)
% 21.61/21.89 (step t262 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t263)
% 21.61/21.89 (assume t263.a0 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.61/21.89 (assume t263.a1 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 21.61/21.89 (step t263.t1 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule implies_neg1)
% 21.61/21.89 (anchor :step t263.t2)
% 21.61/21.89 (assume t263.t2.a0 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.61/21.89 (assume t263.t2.a1 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 21.61/21.89 (step t263.t2.t1 (cl (= (= (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5) false) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule equiv_simplify)
% 21.61/21.89 (step t263.t2.t2 (cl (not (= (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5) false)) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule equiv1 :premises (t263.t2.t1))
% 21.61/21.89 (step t263.t2.t3 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk3)) :rule symm :premises (t263.t2.a1))
% 21.61/21.89 (step t263.t2.t4 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.61/21.89 (step t263.t2.t5 (cl (= (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t263.t2.t3 t263.t2.t4))
% 21.61/21.89 (step t263.t2.t6 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 21.61/21.89 (step t263.t2.t7 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv2 :premises (t263.t2.t6))
% 21.61/21.89 (step t263.t2.t8 (cl (not (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule not_not)
% 21.61/21.89 (step t263.t2.t9 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t263.t2.t7 t263.t2.t8))
% 21.61/21.89 (step t263.t2.t10 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false)) :rule resolution :premises (t263.t2.t9 t263.t2.a0))
% 21.61/21.89 (step t263.t2.t11 (cl (= (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5) false)) :rule trans :premises (t263.t2.t5 t263.t2.t10))
% 21.61/21.89 (step t263.t2.t12 (cl (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t263.t2.t2 t263.t2.t11))
% 21.61/21.89 (step t263.t2 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule subproof :discharge (t263.t2.a0 t263.t2.a1))
% 21.61/21.89 (step t263.t3 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.61/21.89 (step t263.t4 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 21.61/21.89 (step t263.t5 (cl (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t263.t2 t263.t3 t263.t4))
% 21.61/21.89 (step t263.t6 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule reordering :premises (t263.t5))
% 21.61/21.89 (step t263.t7 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule contraction :premises (t263.t6))
% 21.61/21.89 (step t263.t8 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t263.t1 t263.t7))
% 21.61/21.89 (step t263.t9 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule implies_neg2)
% 21.61/21.89 (step t263.t10 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t263.t8 t263.t9))
% 21.61/21.89 (step t263.t11 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule contraction :premises (t263.t10))
% 21.61/21.89 (step t263.t12 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule implies :premises (t263.t11))
% 21.61/21.89 (step t263.t13 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule and_neg)
% 21.61/21.89 (step t263.t14 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule resolution :premises (t263.t13 t263.a0 t263.a1))
% 21.61/21.89 (step t263.t15 (cl (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t263.t12 t263.t14))
% 21.61/21.89 (step t263 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule subproof :discharge (t263.a0 t263.a1))
% 21.61/21.89 (step t264 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.61/21.89 (step t265 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 21.61/21.89 (step t266 (cl (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t263 t264 t265))
% 21.61/21.89 (step t267 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule reordering :premises (t266))
% 21.61/21.89 (step t268 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule contraction :premises (t267))
% 21.61/21.89 (step t269 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t262 t268))
% 21.61/21.89 (step t270 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule implies_neg2)
% 21.61/21.90 (step t271 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t269 t270))
% 21.61/21.90 (step t272 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule contraction :premises (t271))
% 21.61/21.90 (step t273 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule implies :premises (t272))
% 21.61/21.90 (step t274 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t261 t273))
% 21.61/21.90 (step t275 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule or_neg)
% 21.61/21.90 (step t276 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule or_neg)
% 21.61/21.90 (step t277 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule or_neg)
% 21.61/21.90 (step t278 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t274 t275 t276 t277))
% 21.61/21.90 (step t279 (cl (or (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule contraction :premises (t278))
% 21.61/21.90 (step t280 (cl (or (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t258 t260 t279))
% 21.61/21.90 (step t281 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule or :premises (t280))
% 21.61/21.90 (step t282 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)) :rule or_pos)
% 21.61/21.90 (step t283 (cl (= tptp.nil tptp.sk3) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t282))
% 21.61/21.90 (step t284 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule implies_neg1)
% 21.61/21.90 (anchor :step t285)
% 21.61/21.90 (assume t285.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))
% 21.61/21.90 (step t285.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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 21.61/21.90 (step t285.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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule or :premises (t285.t1))
% 21.61/21.90 (step t285.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t285.t2 t285.a0))
% 21.61/21.90 (step t285 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t285.a0))
% 21.61/21.90 (step t286 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t284 t285))
% 21.61/21.90 (step t287 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 21.61/21.90 (step t288 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (=> (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t286 t287))
% 21.61/21.90 (step t289 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t288))
% 21.61/21.90 (step t290 (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.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule implies :premises (t289))
% 21.61/21.90 (step t291 (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)
% 21.61/21.90 (anchor :step t292 :args ((U $$unsorted) (:= U U)))
% 21.61/21.90 (step t292.t1 (cl (= U U)) :rule refl)
% 21.61/21.90 (step t292.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.61/21.90 (step t292.t3 (cl (= (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= U (tptp.cons (tptp.hd U) (tptp.tl U))))) :rule all_simplify)
% 21.61/21.90 (step t292.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 21.61/21.90 (step t292.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 (t292.t2 t292.t3 t292.t4))
% 21.61/21.90 (step t292 (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)
% 21.61/21.90 (step t293 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule resolution :premises (t291 t292 a103))
% 21.61/21.90 (step t294 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t290 t293))
% 21.61/21.90 (step t295 (cl (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule resolution :premises (t283 t203 a187 t294))
% 21.61/21.90 (step t296 (cl (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t281 t196 t295))
% 21.61/21.90 (step t297 (cl (=> (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))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (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)))) :rule implies_neg1)
% 21.61/21.90 (anchor :step t298)
% 21.61/21.90 (assume t298.a0 (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))))
% 21.61/21.90 (step t298.t1 (cl (or (not (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)))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule forall_inst :args ((:= U (tptp.tl tptp.sk3)) (:= V tptp.sk5) (:= W (tptp.hd tptp.sk3))))
% 21.61/21.90 (step t298.t2 (cl (not (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)))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule or :premises (t298.t1))
% 21.61/21.90 (step t298.t3 (cl (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t298.t2 t298.a0))
% 21.61/21.90 (step t298 (cl (not (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)))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule subproof :discharge (t298.a0))
% 21.61/21.90 (step t299 (cl (=> (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))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t297 t298))
% 21.61/21.90 (step t300 (cl (=> (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))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (not (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule implies_neg2)
% 21.61/21.90 (step t301 (cl (=> (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))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) (=> (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))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t299 t300))
% 21.61/21.90 (step t302 (cl (=> (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))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule contraction :premises (t301))
% 21.61/21.90 (step t303 (cl (not (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)))) (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule implies :premises (t302))
% 21.61/21.90 (step t304 (cl (or (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t303 a138))
% 21.61/21.90 (step t305 (cl (not (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule resolution :premises (t257 t212 t223 a191 t296 t304))
% 21.61/21.90 (step t306 (cl (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_neg)
% 21.61/21.90 (step t307 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule implies_neg1)
% 21.61/21.90 (anchor :step t308)
% 21.61/21.90 (assume t308.a0 (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 21.61/21.90 (assume t308.a1 (tptp.memberP tptp.sk4 tptp.sk5))
% 21.61/21.90 (step t308.t1 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg1)
% 21.61/21.90 (anchor :step t308.t2)
% 21.61/21.90 (assume t308.t2.a0 (tptp.memberP tptp.sk4 tptp.sk5))
% 21.61/21.90 (assume t308.t2.a1 (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 21.61/21.90 (step t308.t2.t1 (cl (= (= (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5) true) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule equiv_simplify)
% 21.61/21.90 (step t308.t2.t2 (cl (not (= (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5) true)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule equiv1 :premises (t308.t2.t1))
% 21.61/21.90 (step t308.t2.t3 (cl (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk4)) :rule symm :premises (t308.t2.a1))
% 21.61/21.90 (step t308.t2.t4 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.61/21.90 (step t308.t2.t5 (cl (= (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t308.t2.t3 t308.t2.t4))
% 21.61/21.90 (step t308.t2.t6 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) true) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv_simplify)
% 21.61/21.90 (step t308.t2.t7 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv2 :premises (t308.t2.t6))
% 21.61/21.90 (step t308.t2.t8 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true)) :rule resolution :premises (t308.t2.t7 t308.t2.a0))
% 21.61/21.90 (step t308.t2.t9 (cl (= (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5) true)) :rule trans :premises (t308.t2.t5 t308.t2.t8))
% 21.61/21.90 (step t308.t2.t10 (cl (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule resolution :premises (t308.t2.t2 t308.t2.t9))
% 21.61/21.90 (step t308.t2 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule subproof :discharge (t308.t2.a0 t308.t2.a1))
% 21.61/21.90 (step t308.t3 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule and_pos)
% 21.61/21.90 (step t308.t4 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_pos)
% 21.61/21.90 (step t308.t5 (cl (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule resolution :premises (t308.t2 t308.t3 t308.t4))
% 21.61/21.90 (step t308.t6 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule reordering :premises (t308.t5))
% 21.61/21.90 (step t308.t7 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule contraction :premises (t308.t6))
% 21.61/21.90 (step t308.t8 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule resolution :premises (t308.t1 t308.t7))
% 21.61/21.90 (step t308.t9 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule implies_neg2)
% 21.61/21.90 (step t308.t10 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule resolution :premises (t308.t8 t308.t9))
% 21.61/21.90 (step t308.t11 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule contraction :premises (t308.t10))
% 21.61/21.90 (step t308.t12 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule implies :premises (t308.t11))
% 21.61/21.90 (step t308.t13 (cl (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule and_neg)
% 21.61/21.90 (step t308.t14 (cl (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t308.t13 t308.a1 t308.a0))
% 21.61/21.90 (step t308.t15 (cl (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule resolution :premises (t308.t12 t308.t14))
% 21.61/21.90 (step t308 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule subproof :discharge (t308.a0 t308.a1))
% 21.61/21.90 (step t309 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_pos)
% 21.61/21.90 (step t310 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule and_pos)
% 21.61/21.90 (step t311 (cl (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule resolution :premises (t308 t309 t310))
% 21.61/21.90 (step t312 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule reordering :premises (t311))
% 21.61/21.90 (step t313 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule contraction :premises (t312))
% 21.61/21.90 (step t314 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule resolution :premises (t307 t313))
% 21.61/21.90 (step t315 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule implies_neg2)
% 21.61/21.90 (step t316 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule resolution :premises (t314 t315))
% 21.61/21.90 (step t317 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5))) :rule contraction :premises (t316))
% 21.61/21.90 (step t318 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule implies :premises (t317))
% 21.61/21.90 (step t319 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule resolution :premises (t306 t318))
% 21.61/21.90 (step t320 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule reordering :premises (t319))
% 21.61/21.90 (step t321 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) :rule equiv_pos2)
% 21.61/21.90 (anchor :step t322 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 21.61/21.90 (step t322.t1 (cl (= A A)) :rule refl)
% 21.61/21.90 (step t322.t2 (cl (= B B)) :rule refl)
% 21.61/21.90 (step t322.t3 (cl (= C C)) :rule refl)
% 21.61/21.90 (step t322.t4 (cl (= D D)) :rule refl)
% 21.61/21.90 (step t322.t5 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 21.61/21.90 (step t322.t6 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 21.61/21.90 (step t322.t7 (cl (= (= tptp.sk4 A) (= tptp.sk4 A))) :rule refl)
% 21.61/21.90 (step t322.t8 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 21.61/21.90 (step t322.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 21.61/21.90 (step t322.t10 (cl (= (= (tptp.tl tptp.sk3) B) (= B (tptp.tl tptp.sk3)))) :rule all_simplify)
% 21.61/21.90 (step t322.t11 (cl (= (not (= (tptp.tl tptp.sk3) B)) (not (= B (tptp.tl tptp.sk3))))) :rule cong :premises (t322.t10))
% 21.61/21.90 (step t322.t12 (cl (= (= (tptp.app B C) A) (= A (tptp.app B C)))) :rule all_simplify)
% 21.61/21.90 (step t322.t13 (cl (= (not (= (tptp.app B C) A)) (not (= A (tptp.app B C))))) :rule cong :premises (t322.t12))
% 21.61/21.90 (step t322.t14 (cl (= (not (tptp.ssItem D)) (not (tptp.ssItem D)))) :rule refl)
% 21.61/21.90 (step t322.t15 (cl (= (= (tptp.cons D tptp.nil) C) (= C (tptp.cons D tptp.nil)))) :rule all_simplify)
% 21.61/21.90 (step t322.t16 (cl (= (not (= (tptp.cons D tptp.nil) C)) (not (= C (tptp.cons D tptp.nil))))) :rule cong :premises (t322.t15))
% 21.61/21.90 (step t322.t17 (cl (= (= (tptp.hd tptp.sk3) D) (= D (tptp.hd tptp.sk3)))) :rule all_simplify)
% 21.61/21.90 (step t322.t18 (cl (= (not (= (tptp.hd tptp.sk3) D)) (not (= D (tptp.hd tptp.sk3))))) :rule cong :premises (t322.t17))
% 21.61/21.90 (step t322.t19 (cl (= (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) :rule refl)
% 21.61/21.90 (step t322.t20 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3))))) :rule cong :premises (t322.t5 t322.t6 t322.t7 t322.t8 t322.t9 t322.t11 t322.t13 t322.t14 t322.t16 t322.t18 t322.t19 t322.t19))
% 21.61/21.90 (step t322 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))))) :rule bind)
% 21.61/21.90 (step t323 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)))))) :rule all_simplify)
% 21.61/21.90 (step t324 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3)))))))) :rule all_simplify)
% 21.61/21.90 (step t325 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 21.61/21.90 (step t326 (cl (= (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) :rule refl)
% 21.61/21.90 (step t327 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)))))) :rule all_simplify)
% 21.61/21.90 (step t328 (cl (= (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule refl)
% 21.61/21.90 (step t329 (cl (= (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule refl)
% 21.61/21.90 (step t330 (cl (= (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)) true)) :rule all_simplify)
% 21.61/21.90 (step t331 (cl (= (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not true))) :rule cong :premises (t330))
% 21.61/21.90 (step t332 (cl (= (not true) false)) :rule all_simplify)
% 21.61/21.90 (step t333 (cl (= (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) false)) :rule trans :premises (t331 t332))
% 21.61/21.90 (step t334 (cl (= (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule refl)
% 21.61/21.90 (step t335 (cl (= (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) true)) :rule all_simplify)
% 21.61/21.90 (step t336 (cl (= (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not true))) :rule cong :premises (t335))
% 21.61/21.90 (step t337 (cl (= (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) false)) :rule trans :premises (t336 t332))
% 21.61/21.90 (step t338 (cl (= (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) true)) :rule all_simplify)
% 21.61/21.90 (step t339 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not true))) :rule cong :premises (t338))
% 21.61/21.90 (step t340 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false)) :rule trans :premises (t339 t332))
% 21.61/21.90 (step t341 (cl (= (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)) true)) :rule all_simplify)
% 21.61/21.90 (step t342 (cl (= (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3))) (not true))) :rule cong :premises (t341))
% 21.61/21.90 (step t343 (cl (= (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3))) false)) :rule trans :premises (t342 t332))
% 21.61/21.90 (step t344 (cl (= (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false (not (tptp.ssItem (tptp.hd tptp.sk3))) false false))) :rule cong :premises (t328 t329 t227 t333 t334 t337 t226 t340 t343))
% 21.61/21.90 (step t345 (cl (= (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false (not (tptp.ssItem (tptp.hd tptp.sk3))) false false) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule all_simplify)
% 21.61/21.90 (step t346 (cl (= (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t344 t345))
% 21.61/21.90 (step t347 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t327 t346))
% 21.61/21.90 (step t348 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3)))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))))) :rule cong :premises (t325 t326 t347))
% 21.61/21.90 (step t349 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule all_simplify)
% 21.61/21.90 (step t350 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3)))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t348 t349))
% 21.61/21.90 (step t351 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t324 t350))
% 21.61/21.90 (step t352 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t323 t351))
% 21.61/21.90 (step t353 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t322 t352))
% 21.61/21.90 (step t354 (cl (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) :rule resolution :premises (t321 t353 a196))
% 21.61/21.90 (step t355 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))) :rule or :premises (t354))
% 21.61/21.90 (step t356 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))) :rule reordering :premises (t355))
% 21.61/21.90 (step t357 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a194))
% 21.61/21.90 (step t358 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t357 t203))
% 21.61/21.90 (step t359 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t123 t358 a7 a188 t134))
% 21.61/21.90 (step t360 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)) :rule or_pos)
% 21.61/21.90 (step t361 (cl (= tptp.nil tptp.sk3) (tptp.neq tptp.nil tptp.sk3) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t360))
% 21.61/21.90 (step t362 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 21.61/21.90 (step t363 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule refl)
% 21.61/21.90 (step t364 (cl (= (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule refl)
% 21.61/21.90 (step t365 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 21.61/21.90 (step t366 (cl (= (tptp.neq tptp.nil tptp.sk3) (tptp.neq tptp.nil tptp.sk3))) :rule refl)
% 21.61/21.90 (step t367 (cl (= (= tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule all_simplify)
% 21.61/21.90 (step t368 (cl (= (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule cong :premises (t364 t365 t366 t367))
% 21.61/21.90 (step t369 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))))) :rule cong :premises (t363 t368))
% 21.61/21.90 (step t370 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 21.61/21.90 (anchor :step t371)
% 21.61/21.90 (assume t371.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 21.61/21.90 (step t371.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.nil)))
% 21.61/21.90 (step t371.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule or :premises (t371.t1))
% 21.61/21.90 (step t371.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule resolution :premises (t371.t2 t371.a0))
% 21.61/21.90 (step t371 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule subproof :discharge (t371.a0))
% 21.61/21.90 (step t372 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule resolution :premises (t370 t371))
% 21.61/21.90 (step t373 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule implies_neg2)
% 21.61/21.90 (step t374 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule resolution :premises (t372 t373))
% 21.61/21.90 (step t375 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule contraction :premises (t374))
% 21.61/21.90 (step t376 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t362 t369 t375))
% 21.61/21.90 (step t377 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) :rule implies :premises (t376))
% 21.61/21.90 (step t378 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) :rule resolution :premises (t377 t133))
% 21.61/21.90 (step t379 (cl (tptp.neq tptp.nil tptp.sk3)) :rule resolution :premises (t361 t203 a7 a187 t378))
% 21.61/21.90 (step t380 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule or_pos)
% 21.61/21.90 (step t381 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule reordering :premises (t380))
% 21.61/21.90 (step t382 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) 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)
% 21.61/21.90 (anchor :step t383)
% 21.61/21.90 (assume t383.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 21.61/21.90 (step t383.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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= V (tptp.tl tptp.sk3))))
% 21.61/21.90 (step t383.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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule or :premises (t383.t1))
% 21.61/21.90 (step t383.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t383.t2 t383.a0))
% 21.61/21.90 (step t383 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule subproof :discharge (t383.a0))
% 21.61/21.90 (step t384 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t382 t383))
% 21.61/21.90 (step t385 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule implies_neg2)
% 21.61/21.90 (step t386 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) 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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule resolution :premises (t384 t385))
% 21.61/21.90 (step t387 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule contraction :premises (t386))
% 21.61/21.90 (step t388 (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.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies :premises (t387))
% 21.61/21.90 (step t389 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t388 a84))
% 21.61/21.90 (step t390 (cl (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t381 t212 t253 t389))
% 21.61/21.90 (step t391 (cl (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t356 t359 t379 t212 t390 t253 t223))
% 21.61/21.90 (step t392 (cl (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) :rule resolution :premises (t320 t201 t391))
% 21.61/21.90 (step t393 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) (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)))) :rule implies_neg1)
% 21.61/21.90 (anchor :step t394)
% 21.61/21.90 (assume t394.a0 (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))))
% 21.61/21.90 (step t394.t1 (cl (or (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)))) :rule forall_inst :args ((:= U (tptp.tl tptp.sk3)) (:= V (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= W tptp.sk5)))
% 21.61/21.90 (step t394.t2 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule or :premises (t394.t1))
% 21.61/21.90 (step t394.t3 (cl (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule resolution :premises (t394.t2 t394.a0))
% 21.61/21.90 (step t394 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule subproof :discharge (t394.a0))
% 21.61/21.90 (step t395 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule resolution :premises (t393 t394))
% 21.61/21.90 (step t396 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) (not (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)))) :rule implies_neg2)
% 21.61/21.90 (step t397 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)))) :rule resolution :premises (t395 t396))
% 21.61/21.90 (step t398 (cl (=> (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))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5)))) :rule contraction :premises (t397))
% 21.61/21.90 (step t399 (cl (not (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)))) (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule implies :premises (t398))
% 21.61/21.90 (step t400 (cl (or (not (tptp.memberP (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk5)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5) (tptp.memberP (tptp.tl tptp.sk3) tptp.sk5))) :rule resolution :premises (t399 a157))
% 21.61/21.90 (step t401 (cl (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) :rule resolution :premises (t255 t212 t253 a191 t305 t392 t400))
% 21.61/21.90 (step t402 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) 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)
% 21.61/21.90 (anchor :step t403)
% 21.61/21.90 (assume t403.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))))
% 21.61/21.90 (step t403.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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= V tptp.sk5) (:= W (tptp.tl tptp.sk3))))
% 21.61/21.90 (step t403.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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule or :premises (t403.t1))
% 21.61/21.90 (step t403.t3 (cl (or (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t403.t2 t403.a0))
% 21.61/21.90 (step t403 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule subproof :discharge (t403.a0))
% 21.61/21.90 (step t404 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (or (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t402 t403))
% 21.61/21.90 (step t405 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) (not (or (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule implies_neg2)
% 21.61/21.90 (step t406 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) 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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule resolution :premises (t404 t405))
% 21.61/21.90 (step t407 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)))) :rule contraction :premises (t406))
% 21.61/21.90 (step t408 (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.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule implies :premises (t407))
% 21.61/21.90 (step t409 (cl (or (not (tptp.memberP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk5)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5))) :rule resolution :premises (t408 a139))
% 21.61/21.90 (step t410 (cl (tptp.memberP (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.sk5)) :rule resolution :premises (t242 t212 t253 a191 t401 t409))
% 21.61/21.90 (step t411 (cl) :rule resolution :premises (t64 t240 t410 t295 t196))
% 21.61/21.90
% 21.61/21.90 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.2AHZU2wDmp/cvc5---1.0.5_23084.smt2
% 21.61/21.90 % cvc5---1.0.5 exiting
% 21.61/21.90 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------