TSTP Solution File: SWC377-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC377-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n023.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:01:48 EDT 2024
% Result : Unsatisfiable 20.63s 21.36s
% Output : Proof 21.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SWC377-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.15 % Command : do_cvc5 %s %d
% 0.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 26 15:33:09 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.38/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.38/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.57/10.74 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.59/15.76 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.58/20.78 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 20.63/21.36 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.ww9bemol6o/cvc5---1.0.5_22719.smt2
% 20.63/21.36 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.ww9bemol6o/cvc5---1.0.5_22719.smt2
% 21.24/21.42 (assume a0 (tptp.equalelemsP tptp.nil))
% 21.24/21.42 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 21.24/21.42 (assume a2 (tptp.strictorderedP tptp.nil))
% 21.24/21.42 (assume a3 (tptp.totalorderedP tptp.nil))
% 21.24/21.42 (assume a4 (tptp.strictorderP tptp.nil))
% 21.24/21.42 (assume a5 (tptp.totalorderP tptp.nil))
% 21.24/21.42 (assume a6 (tptp.cyclefreeP tptp.nil))
% 21.24/21.42 (assume a7 (tptp.ssList tptp.nil))
% 21.24/21.42 (assume a8 (tptp.ssItem tptp.skac3))
% 21.24/21.42 (assume a9 (tptp.ssItem tptp.skac2))
% 21.24/21.42 (assume a10 (not (tptp.singletonP tptp.nil)))
% 21.24/21.42 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 21.24/21.42 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 21.24/21.42 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 21.24/21.42 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 21.24/21.42 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 21.24/21.42 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 21.24/21.42 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 21.24/21.42 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 21.24/21.42 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 21.24/21.42 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 21.24/21.42 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 21.24/21.42 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 21.24/21.42 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 21.24/21.42 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 21.24/21.42 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 21.24/21.42 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 21.24/21.42 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 21.24/21.42 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 21.24/21.42 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 21.24/21.42 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 21.24/21.42 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 21.24/21.42 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 21.24/21.42 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 21.24/21.42 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 21.24/21.42 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 21.24/21.42 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 21.24/21.42 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 21.24/21.42 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 21.24/21.42 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 21.24/21.42 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 21.24/21.42 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 21.24/21.42 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 21.24/21.42 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 21.24/21.42 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 21.24/21.42 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 21.24/21.42 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 21.24/21.42 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 21.24/21.42 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 21.24/21.42 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 21.24/21.42 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 21.24/21.42 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 21.24/21.42 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 21.24/21.42 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 21.24/21.42 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 21.24/21.42 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 21.24/21.42 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 21.24/21.42 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 21.24/21.42 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 21.24/21.42 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 21.24/21.42 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 21.24/21.42 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 21.24/21.42 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 21.24/21.42 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 21.24/21.42 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 21.24/21.42 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 21.24/21.42 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 21.24/21.42 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 21.24/21.42 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 21.24/21.42 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 21.24/21.42 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 21.24/21.42 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 21.24/21.42 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 21.24/21.42 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.24/21.42 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 21.24/21.42 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.24/21.42 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 21.24/21.42 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.24/21.42 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 21.24/21.42 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 21.24/21.42 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 21.24/21.42 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 21.24/21.42 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 21.24/21.42 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 21.24/21.42 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 21.24/21.42 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 21.24/21.42 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 21.24/21.42 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 21.24/21.42 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 21.24/21.42 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 21.24/21.42 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 21.24/21.42 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 21.24/21.42 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 21.24/21.42 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 21.24/21.42 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 21.24/21.42 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 21.24/21.42 (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.24/21.42 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 21.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 21.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (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.24/21.42 (assume a185 (tptp.ssList tptp.sk1))
% 21.24/21.42 (assume a186 (tptp.ssList tptp.sk2))
% 21.24/21.42 (assume a187 (tptp.ssList tptp.sk3))
% 21.24/21.42 (assume a188 (tptp.ssList tptp.sk4))
% 21.24/21.42 (assume a189 (= tptp.sk2 tptp.sk4))
% 21.24/21.42 (assume a190 (= tptp.sk1 tptp.sk3))
% 21.24/21.42 (assume a191 (tptp.ssItem tptp.sk5))
% 21.24/21.42 (assume a192 (or (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5)))
% 21.24/21.42 (assume a193 (or (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5))))
% 21.24/21.42 (assume a194 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 21.24/21.42 (assume a195 (or (tptp.ssItem tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 21.24/21.42 (assume a196 (or (tptp.ssList tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil))))
% 21.24/21.42 (assume a197 (or (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 21.24/21.42 (assume a198 (or (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 21.24/21.42 (step t1 (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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t2)
% 21.24/21.42 (assume t2.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.24/21.42 (step t2.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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk5) (:= W (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.42 (step t2.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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule or :premises (t2.t1))
% 21.24/21.42 (step t2.t3 (cl (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t2.t2 t2.a0))
% 21.24/21.42 (step 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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule subproof :discharge (t2.a0))
% 21.24/21.42 (step t3 (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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t1 t2))
% 21.24/21.42 (step t4 (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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t5 (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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t3 t4))
% 21.24/21.42 (step t6 (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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule contraction :premises (t5))
% 21.24/21.42 (step t7 (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.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule implies :premises (t6))
% 21.24/21.42 (step t8 (cl (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) :rule or_pos)
% 21.24/21.42 (step t9 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk7 tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5) (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule reordering :premises (t8))
% 21.24/21.42 (step t10 (cl (tptp.ssList tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a196))
% 21.24/21.42 (step t11 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk7)) :rule reordering :premises (t10))
% 21.24/21.42 (step t12 (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.24/21.42 (step t13 (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 (t12))
% 21.24/21.42 (step t14 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a194))
% 21.24/21.42 (step t15 (cl (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_neg)
% 21.24/21.42 (step t16 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t17)
% 21.24/21.42 (assume t17.a0 (= tptp.nil tptp.sk3))
% 21.24/21.42 (assume t17.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (step t17.t1 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t17.t2)
% 21.24/21.42 (assume t17.t2.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t17.t2.a1 (= tptp.nil tptp.sk3))
% 21.24/21.42 (step t17.t2.t1 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t17.t2.a1))
% 21.24/21.42 (step t17.t2.t2 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t17.t2.t1))
% 21.24/21.42 (step t17.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t17.t2.a0))
% 21.24/21.42 (step t17.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule symm :premises (t17.t2.t3))
% 21.24/21.42 (step t17.t2.t5 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule trans :premises (t17.t2.t2 t17.t2.t4))
% 21.24/21.42 (step t17.t2 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule subproof :discharge (t17.t2.a0 t17.t2.a1))
% 21.24/21.42 (step t17.t3 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t17.t4 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t17.t5 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t17.t2 t17.t3 t17.t4))
% 21.24/21.42 (step t17.t6 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule reordering :premises (t17.t5))
% 21.24/21.42 (step t17.t7 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule contraction :premises (t17.t6))
% 21.24/21.42 (step t17.t8 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule resolution :premises (t17.t1 t17.t7))
% 21.24/21.42 (step t17.t9 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule implies_neg2)
% 21.24/21.42 (step t17.t10 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule resolution :premises (t17.t8 t17.t9))
% 21.24/21.42 (step t17.t11 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule contraction :premises (t17.t10))
% 21.24/21.42 (step t17.t12 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule implies :premises (t17.t11))
% 21.24/21.42 (step t17.t13 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 21.24/21.42 (step t17.t14 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t17.t13 t17.a1 t17.a0))
% 21.24/21.42 (step t17.t15 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule resolution :premises (t17.t12 t17.t14))
% 21.24/21.42 (step t17 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule subproof :discharge (t17.a0 t17.a1))
% 21.24/21.42 (step t18 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t19 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t20 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule resolution :premises (t17 t18 t19))
% 21.24/21.42 (step t21 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule reordering :premises (t20))
% 21.24/21.42 (step t22 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule contraction :premises (t21))
% 21.24/21.42 (step t23 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule resolution :premises (t16 t22))
% 21.24/21.42 (step t24 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule implies_neg2)
% 21.24/21.42 (step t25 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule resolution :premises (t23 t24))
% 21.24/21.42 (step t26 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule contraction :premises (t25))
% 21.24/21.42 (step t27 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule implies :premises (t26))
% 21.24/21.42 (step t28 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule resolution :premises (t15 t27))
% 21.24/21.42 (step t29 (cl (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule or_pos)
% 21.24/21.42 (step t30 (cl (not (tptp.ssList tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule reordering :premises (t29))
% 21.24/21.42 (step t31 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t32)
% 21.24/21.42 (assume t32.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 21.24/21.42 (step t32.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk6 tptp.nil)) (:= V tptp.sk7)))
% 21.24/21.42 (step t32.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t32.t1))
% 21.24/21.42 (step t32.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t32.t2 t32.a0))
% 21.24/21.42 (step t32 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t32.a0))
% 21.24/21.42 (step t33 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t31 t32))
% 21.24/21.42 (step t34 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 21.24/21.42 (step t35 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t33 t34))
% 21.24/21.42 (step t36 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t35))
% 21.24/21.42 (step t37 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t36))
% 21.24/21.42 (step t38 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 21.24/21.42 (anchor :step t39 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 21.24/21.42 (step t39.t1 (cl (= U U)) :rule refl)
% 21.24/21.42 (step t39.t2 (cl (= V V)) :rule refl)
% 21.24/21.42 (step t39.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 21.24/21.42 (step t39.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t39.t3))
% 21.24/21.42 (step t39.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 21.24/21.42 (step t39.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.24/21.42 (step t39.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 21.24/21.42 (step t39.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t39.t4 t39.t5 t39.t6 t39.t7))
% 21.24/21.42 (step t39 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 21.24/21.42 (step t40 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t38 t39 a117))
% 21.24/21.42 (step t41 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t37 t40))
% 21.24/21.42 (step t42 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule or_pos)
% 21.24/21.42 (step t43 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t42))
% 21.24/21.42 (step t44 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))))) :rule reordering :premises (t43))
% 21.24/21.42 (step t45 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t46)
% 21.24/21.42 (assume t46.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))
% 21.24/21.42 (step t46.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk6) (:= W tptp.nil) (:= X tptp.nil)))
% 21.24/21.42 (step t46.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule or :premises (t46.t1))
% 21.24/21.42 (step t46.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t46.t2 t46.a0))
% 21.24/21.42 (step t46 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule subproof :discharge (t46.a0))
% 21.24/21.42 (step t47 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t45 t46))
% 21.24/21.42 (step t48 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))))) :rule implies_neg2)
% 21.24/21.42 (step t49 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))))) :rule resolution :premises (t47 t48))
% 21.24/21.42 (step t50 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))))) :rule contraction :premises (t49))
% 21.24/21.42 (step t51 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule implies :premises (t50))
% 21.24/21.42 (step t52 (cl (not (= (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) (not (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))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule equiv_pos2)
% 21.24/21.42 (anchor :step t53 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.24/21.42 (step t53.t1 (cl (= U U)) :rule refl)
% 21.24/21.42 (step t53.t2 (cl (= V V)) :rule refl)
% 21.24/21.42 (step t53.t3 (cl (= W W)) :rule refl)
% 21.24/21.42 (step t53.t4 (cl (= X X)) :rule refl)
% 21.24/21.42 (step t53.t5 (cl (= Y Y)) :rule refl)
% 21.24/21.42 (step t53.t6 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y) (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) :rule all_simplify)
% 21.24/21.42 (step t53.t7 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) :rule cong :premises (t53.t6))
% 21.24/21.42 (step t53.t8 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 21.24/21.42 (step t53.t9 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 21.24/21.42 (step t53.t10 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.24/21.42 (step t53.t11 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 21.24/21.42 (step t53.t12 (cl (= (not (tptp.duplicatefreeP Y)) (not (tptp.duplicatefreeP Y)))) :rule refl)
% 21.24/21.42 (step t53.t13 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 21.24/21.42 (step t53.t14 (cl (= (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))) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y))))) :rule cong :premises (t53.t7 t53.t8 t53.t9 t53.t10 t53.t11 t53.t12 t53.t13))
% 21.24/21.42 (step t53 (cl (= (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))) :rule bind)
% 21.24/21.42 (step t54 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule all_simplify)
% 21.24/21.42 (anchor :step t55 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 21.24/21.42 (step t55.t1 (cl (= U U)) :rule refl)
% 21.24/21.42 (step t55.t2 (cl (= V V)) :rule refl)
% 21.24/21.42 (step t55.t3 (cl (= W W)) :rule refl)
% 21.24/21.42 (step t55.t4 (cl (= X X)) :rule refl)
% 21.24/21.42 (step t55.t5 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))) true)) :rule all_simplify)
% 21.24/21.42 (step t55.t6 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not true))) :rule cong :premises (t55.t5))
% 21.24/21.42 (step t55.t7 (cl (= (not true) false)) :rule all_simplify)
% 21.24/21.42 (step t55.t8 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) false)) :rule trans :premises (t55.t6 t55.t7))
% 21.24/21.42 (step t55.t9 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 21.24/21.42 (step t55.t10 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 21.24/21.42 (step t55.t11 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.24/21.42 (step t55.t12 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 21.24/21.42 (step t55.t13 (cl (= (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) :rule refl)
% 21.24/21.42 (step t55.t14 (cl (= (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) :rule refl)
% 21.24/21.42 (step t55.t15 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) (or false (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule cong :premises (t55.t8 t55.t9 t55.t10 t55.t11 t55.t12 t55.t13 t55.t14))
% 21.24/21.42 (step t55.t16 (cl (= (or false (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule all_simplify)
% 21.24/21.42 (step t55.t17 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule trans :premises (t55.t15 t55.t16))
% 21.24/21.42 (step t55 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule bind)
% 21.24/21.42 (step t56 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule trans :premises (t54 t55))
% 21.24/21.42 (step t57 (cl (= (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule trans :premises (t53 t56))
% 21.24/21.42 (step t58 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule resolution :premises (t52 t57 a178))
% 21.24/21.42 (step t59 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t51 t58))
% 21.24/21.42 (step t60 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule and_neg)
% 21.24/21.42 (step t61 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t62)
% 21.24/21.42 (assume t62.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.42 (assume t62.a1 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (assume t62.a2 (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (step t62.t1 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t62.t2)
% 21.24/21.42 (assume t62.t2.a0 (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (assume t62.t2.a1 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (assume t62.t2.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.42 (step t62.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) true) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule equiv_simplify)
% 21.24/21.42 (step t62.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) true)) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule equiv1 :premises (t62.t2.t1))
% 21.24/21.42 (step t62.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 21.24/21.42 (step t62.t2.t4 (cl (= (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) :rule symm :premises (t62.t2.a1))
% 21.24/21.42 (step t62.t2.t5 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.nil))) :rule cong :premises (t62.t2.t3 t62.t2.t4))
% 21.24/21.42 (step t62.t2.t6 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t62.t2.a2))
% 21.24/21.42 (step t62.t2.t7 (cl (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule symm :premises (t62.t2.t4))
% 21.24/21.42 (step t62.t2.t8 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) :rule trans :premises (t62.t2.t5 t62.t2.t6 t62.t2.t7))
% 21.24/21.42 (step t62.t2.t9 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) tptp.nil)) :rule trans :premises (t62.t2.t8 t62.t2.t4))
% 21.24/21.42 (step t62.t2.t10 (cl (= (tptp.cons tptp.sk6 tptp.nil) (tptp.cons tptp.sk6 tptp.nil))) :rule refl)
% 21.24/21.42 (step t62.t2.t11 (cl (= (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule cong :premises (t62.t2.t9 t62.t2.t10))
% 21.24/21.42 (step t62.t2.t12 (cl (= (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) :rule trans :premises (t62.t2.t11 t62.t2.t5 t62.t2.t6 t62.t2.t7))
% 21.24/21.42 (step t62.t2.t13 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule cong :premises (t62.t2.t12))
% 21.24/21.42 (step t62.t2.t14 (cl (= (= (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) true) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule equiv_simplify)
% 21.24/21.42 (step t62.t2.t15 (cl (= (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) true) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule equiv2 :premises (t62.t2.t14))
% 21.24/21.42 (step t62.t2.t16 (cl (= (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) true)) :rule resolution :premises (t62.t2.t15 t62.t2.a0))
% 21.24/21.42 (step t62.t2.t17 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) true)) :rule trans :premises (t62.t2.t13 t62.t2.t16))
% 21.24/21.42 (step t62.t2.t18 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t62.t2.t2 t62.t2.t17))
% 21.24/21.42 (step t62.t2 (cl (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t62.t2.a0 t62.t2.a1 t62.t2.a2))
% 21.24/21.42 (step t62.t3 (cl (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t62.t4 (cl (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t62.t5 (cl (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t62.t6 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t62.t2 t62.t3 t62.t4 t62.t5))
% 21.24/21.42 (step t62.t7 (cl (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule reordering :premises (t62.t6))
% 21.24/21.42 (step t62.t8 (cl (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t62.t7))
% 21.24/21.42 (step t62.t9 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t62.t1 t62.t8))
% 21.24/21.42 (step t62.t10 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 21.24/21.42 (step t62.t11 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (=> (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t62.t9 t62.t10))
% 21.24/21.42 (step t62.t12 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t62.t11))
% 21.24/21.42 (step t62.t13 (cl (not (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t62.t12))
% 21.24/21.42 (step t62.t14 (cl (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule and_neg)
% 21.24/21.42 (step t62.t15 (cl (and (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t62.t14 t62.a2 t62.a1 t62.a0))
% 21.24/21.42 (step t62.t16 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t62.t13 t62.t15))
% 21.24/21.42 (step t62 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t62.a0 t62.a1 t62.a2))
% 21.24/21.42 (step t63 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t64 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t65 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t66 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t62 t63 t64 t65))
% 21.24/21.42 (step t67 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule reordering :premises (t66))
% 21.24/21.42 (step t68 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t67))
% 21.24/21.42 (step t69 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t61 t68))
% 21.24/21.42 (step t70 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 21.24/21.42 (step t71 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t69 t70))
% 21.24/21.42 (step t72 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t71))
% 21.24/21.42 (step t73 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t72))
% 21.24/21.42 (step t74 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t60 t73))
% 21.24/21.42 (step t75 (cl (not (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) (not (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)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule equiv_pos2)
% 21.24/21.42 (anchor :step t76 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 21.24/21.42 (step t76.t1 (cl (= U U)) :rule refl)
% 21.24/21.42 (step t76.t2 (cl (= V V)) :rule refl)
% 21.24/21.42 (step t76.t3 (cl (= (not (= tptp.nil U)) (not (= tptp.nil U)))) :rule refl)
% 21.24/21.42 (step t76.t4 (cl (= (not (= tptp.nil V)) (not (= tptp.nil V)))) :rule refl)
% 21.24/21.42 (step t76.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 21.24/21.42 (step t76.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.24/21.42 (step t76.t7 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 21.24/21.42 (step t76.t8 (cl (= (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V))))) :rule cong :premises (t76.t3 t76.t4 t76.t5 t76.t6 t76.t7))
% 21.24/21.42 (step t76 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))))) :rule bind)
% 21.24/21.42 (step t77 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 21.24/21.42 (step t78 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 21.24/21.42 (step t79 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t78))
% 21.24/21.42 (step t80 (cl (= (not true) false)) :rule all_simplify)
% 21.24/21.42 (step t81 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t79 t80))
% 21.24/21.42 (step t82 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 21.24/21.42 (step t83 (cl (= (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule refl)
% 21.24/21.42 (step t84 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule cong :premises (t81 t81 t82 t82 t83))
% 21.24/21.42 (step t85 (cl (= (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 21.24/21.42 (step t86 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t84 t85))
% 21.24/21.42 (step t87 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t77 t86))
% 21.24/21.42 (step t88 (cl (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t76 t87))
% 21.24/21.42 (step t89 (cl (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t75 t88 a144))
% 21.24/21.42 (step t90 (cl (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule or :premises (t89))
% 21.24/21.42 (step t91 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t90 a7))
% 21.24/21.42 (step t92 (cl (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.duplicatefreeP tptp.nil)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule and_neg)
% 21.24/21.42 (step t93 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t94)
% 21.24/21.42 (assume t94.a0 (tptp.duplicatefreeP tptp.nil))
% 21.24/21.42 (assume t94.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.42 (assume t94.a2 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (step t94.t1 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t94.t2)
% 21.24/21.42 (assume t94.t2.a0 (tptp.duplicatefreeP tptp.nil))
% 21.24/21.42 (assume t94.t2.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.42 (assume t94.t2.a2 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (step t94.t2.t1 (cl (= (= (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) true) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule equiv_simplify)
% 21.24/21.42 (step t94.t2.t2 (cl (not (= (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) true)) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule equiv1 :premises (t94.t2.t1))
% 21.24/21.42 (step t94.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 21.24/21.42 (step t94.t2.t4 (cl (= (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) :rule symm :premises (t94.t2.a2))
% 21.24/21.42 (step t94.t2.t5 (cl (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule symm :premises (t94.t2.t4))
% 21.24/21.42 (step t94.t2.t6 (cl (= (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) :rule symm :premises (t94.t2.t5))
% 21.24/21.42 (step t94.t2.t7 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.nil))) :rule cong :premises (t94.t2.t3 t94.t2.t6))
% 21.24/21.42 (step t94.t2.t8 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t94.t2.a1))
% 21.24/21.42 (step t94.t2.t9 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) :rule trans :premises (t94.t2.t7 t94.t2.t8 t94.t2.t5))
% 21.24/21.42 (step t94.t2.t10 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) tptp.nil)) :rule trans :premises (t94.t2.t9 t94.t2.t6))
% 21.24/21.42 (step t94.t2.t11 (cl (= (tptp.cons tptp.sk6 tptp.nil) (tptp.cons tptp.sk6 tptp.nil))) :rule refl)
% 21.24/21.42 (step t94.t2.t12 (cl (= (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule cong :premises (t94.t2.t10 t94.t2.t11))
% 21.24/21.42 (step t94.t2.t13 (cl (= (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)) tptp.nil)) :rule trans :premises (t94.t2.t12 t94.t2.t7 t94.t2.t8))
% 21.24/21.42 (step t94.t2.t14 (cl (= (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP tptp.nil))) :rule cong :premises (t94.t2.t13))
% 21.24/21.42 (step t94.t2.t15 (cl (= (= (tptp.duplicatefreeP tptp.nil) true) (tptp.duplicatefreeP tptp.nil))) :rule equiv_simplify)
% 21.24/21.42 (step t94.t2.t16 (cl (= (tptp.duplicatefreeP tptp.nil) true) (not (tptp.duplicatefreeP tptp.nil))) :rule equiv2 :premises (t94.t2.t15))
% 21.24/21.42 (step t94.t2.t17 (cl (= (tptp.duplicatefreeP tptp.nil) true)) :rule resolution :premises (t94.t2.t16 t94.t2.a0))
% 21.24/21.42 (step t94.t2.t18 (cl (= (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) true)) :rule trans :premises (t94.t2.t14 t94.t2.t17))
% 21.24/21.42 (step t94.t2.t19 (cl (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t94.t2.t2 t94.t2.t18))
% 21.24/21.42 (step t94.t2 (cl (not (tptp.duplicatefreeP tptp.nil)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t94.t2.a0 t94.t2.a1 t94.t2.a2))
% 21.24/21.42 (step t94.t3 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP tptp.nil)) :rule and_pos)
% 21.24/21.42 (step t94.t4 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t94.t5 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t94.t6 (cl (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t94.t2 t94.t3 t94.t4 t94.t5))
% 21.24/21.42 (step t94.t7 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule reordering :premises (t94.t6))
% 21.24/21.42 (step t94.t8 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t94.t7))
% 21.24/21.42 (step t94.t9 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t94.t1 t94.t8))
% 21.24/21.42 (step t94.t10 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 21.24/21.42 (step t94.t11 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t94.t9 t94.t10))
% 21.24/21.42 (step t94.t12 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t94.t11))
% 21.24/21.42 (step t94.t13 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t94.t12))
% 21.24/21.42 (step t94.t14 (cl (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.duplicatefreeP tptp.nil)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule and_neg)
% 21.24/21.42 (step t94.t15 (cl (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t94.t14 t94.a0 t94.a1 t94.a2))
% 21.24/21.42 (step t94.t16 (cl (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t94.t13 t94.t15))
% 21.24/21.42 (step t94 (cl (not (tptp.duplicatefreeP tptp.nil)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t94.a0 t94.a1 t94.a2))
% 21.24/21.42 (step t95 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP tptp.nil)) :rule and_pos)
% 21.24/21.42 (step t96 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t97 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t98 (cl (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t94 t95 t96 t97))
% 21.24/21.42 (step t99 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule reordering :premises (t98))
% 21.24/21.42 (step t100 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t99))
% 21.24/21.42 (step t101 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t93 t100))
% 21.24/21.42 (step t102 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 21.24/21.42 (step t103 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t101 t102))
% 21.24/21.42 (step t104 (cl (=> (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t103))
% 21.24/21.42 (step t105 (cl (not (and (tptp.duplicatefreeP tptp.nil) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t104))
% 21.24/21.42 (step t106 (cl (not (tptp.duplicatefreeP tptp.nil)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t92 t105))
% 21.24/21.42 (step t107 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (tptp.duplicatefreeP tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (tptp.duplicatefreeP (tptp.app (tptp.app tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (tptp.cons tptp.sk6 tptp.nil)))) :rule reordering :premises (t106))
% 21.24/21.42 (step t108 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule or_pos)
% 21.24/21.42 (step t109 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule reordering :premises (t108))
% 21.24/21.42 (step t110 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t111)
% 21.24/21.42 (assume t111.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 21.24/21.42 (step t111.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil)))
% 21.24/21.42 (step t111.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t111.t1))
% 21.24/21.42 (step t111.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t111.t2 t111.a0))
% 21.24/21.42 (step t111 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t111.a0))
% 21.24/21.42 (step t112 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t110 t111))
% 21.24/21.42 (step t113 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 21.24/21.42 (step t114 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t112 t113))
% 21.24/21.42 (step t115 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t114))
% 21.24/21.42 (step t116 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t115))
% 21.24/21.42 (step t117 (cl (not (tptp.ssItem tptp.sk6)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk6))) :rule resolution :premises (t44 t59 a7 t74 t91 t107 t91 a1 t109 a7 t116 a85))
% 21.24/21.42 (step t118 (cl (not (tptp.ssItem tptp.sk6)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t117))
% 21.24/21.42 (step t119 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t116 a85))
% 21.24/21.42 (step t120 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 21.24/21.42 (step t121 (cl (= (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule all_simplify)
% 21.24/21.42 (step t122 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 21.24/21.42 (step t123 (cl (= (or (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t121 t122))
% 21.24/21.42 (step t124 (cl (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t120 t123 a197))
% 21.24/21.42 (step t125 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t124))
% 21.24/21.42 (step t126 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule reordering :premises (t125))
% 21.24/21.42 (step t127 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t28 t30 t41 t118 t109 t119 a7 t126 t11))
% 21.24/21.42 (step t128 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.ssItem tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t127))
% 21.24/21.42 (step t129 (cl (tptp.ssItem tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a195))
% 21.24/21.42 (step t130 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t128 t129))
% 21.24/21.42 (step t131 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t130))
% 21.24/21.42 (step t132 (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.24/21.42 (anchor :step t133)
% 21.24/21.42 (assume t133.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 21.24/21.42 (step t133.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.24/21.42 (step t133.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 (t133.t1))
% 21.24/21.42 (step t133.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 (t133.t2 t133.a0))
% 21.24/21.42 (step t133 (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 (t133.a0))
% 21.24/21.42 (step t134 (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 (t132 t133))
% 21.24/21.42 (step t135 (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.24/21.42 (step t136 (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 (t134 t135))
% 21.24/21.42 (step t137 (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 (t136))
% 21.24/21.42 (step t138 (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 (t137))
% 21.24/21.42 (step t139 (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.24/21.42 (anchor :step t140 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 21.24/21.42 (step t140.t1 (cl (= U U)) :rule refl)
% 21.24/21.42 (step t140.t2 (cl (= V V)) :rule refl)
% 21.24/21.42 (step t140.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.24/21.42 (step t140.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 21.24/21.42 (step t140.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 21.24/21.42 (step t140.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 21.24/21.42 (step t140.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 (t140.t3 t140.t4 t140.t5 t140.t6))
% 21.24/21.42 (step t140 (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.24/21.42 (step t141 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t139 t140 a99))
% 21.24/21.42 (step t142 (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 (t138 t141))
% 21.24/21.42 (step t143 (cl (not (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)))) (not (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv_pos2)
% 21.24/21.42 (step t144 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 21.24/21.42 (step t145 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 21.24/21.42 (step t146 (cl (= (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule refl)
% 21.24/21.42 (step t147 (cl (= (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) true) (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.42 (step t148 (cl (not (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) true)) (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv1 :premises (t147))
% 21.24/21.42 (step t149 (cl (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) (= (tptp.memberP tptp.sk4 tptp.sk5) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))))) :rule all_simplify)
% 21.24/21.42 (step t150 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule refl)
% 21.24/21.42 (step t151 (cl (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule all_simplify)
% 21.24/21.42 (step t152 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule cong :premises (t150 t151))
% 21.24/21.42 (step t153 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)) true)) :rule all_simplify)
% 21.24/21.42 (step t154 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) true)) :rule trans :premises (t152 t153))
% 21.24/21.42 (step t155 (cl (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) true)) :rule trans :premises (t149 t154))
% 21.24/21.42 (step t156 (cl (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t148 t155))
% 21.24/21.42 (step t157 (cl (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule cong :premises (t144 t145 t146 t156))
% 21.24/21.42 (step t158 (cl (not (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))))) (not (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule equiv_pos2)
% 21.24/21.42 (step t159 (cl (= (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule refl)
% 21.24/21.42 (step t160 (cl (= (= (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))))) :rule equiv_simplify)
% 21.24/21.42 (step t161 (cl (= (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (not (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))))) :rule equiv2 :premises (t160))
% 21.24/21.42 (step t162 (cl (not (not (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule not_not)
% 21.24/21.42 (step t163 (cl (= (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t161 t162))
% 21.24/21.42 (step t164 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t165)
% 21.24/21.42 (assume t165.a0 (not (tptp.memberP tptp.sk4 tptp.sk5)))
% 21.24/21.42 (assume t165.a1 (= tptp.nil tptp.sk4))
% 21.24/21.42 (assume t165.a2 (= tptp.nil tptp.sk3))
% 21.24/21.42 (assume t165.a3 (tptp.memberP tptp.sk3 tptp.sk5))
% 21.24/21.42 (step t165.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 21.24/21.42 (step t165.t2 (cl (= (= true false) false)) :rule all_simplify)
% 21.24/21.42 (step t165.t3 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) true) (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv_simplify)
% 21.24/21.42 (step t165.t4 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) true) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv2 :premises (t165.t3))
% 21.24/21.42 (step t165.t5 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) true)) :rule resolution :premises (t165.t4 t165.a3))
% 21.24/21.42 (step t165.t6 (cl (= true (tptp.memberP tptp.sk3 tptp.sk5))) :rule symm :premises (t165.t5))
% 21.24/21.42 (step t165.t7 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t165.a2))
% 21.24/21.42 (step t165.t8 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t165.a1))
% 21.24/21.42 (step t165.t9 (cl (= tptp.nil tptp.sk4)) :rule symm :premises (t165.t8))
% 21.24/21.42 (step t165.t10 (cl (= tptp.sk3 tptp.sk4)) :rule trans :premises (t165.t7 t165.t9))
% 21.24/21.42 (step t165.t11 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.42 (step t165.t12 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t165.t10 t165.t11))
% 21.24/21.42 (step t165.t13 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) false) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.42 (step t165.t14 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv2 :premises (t165.t13))
% 21.24/21.42 (step t165.t15 (cl (not (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule not_not)
% 21.24/21.42 (step t165.t16 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false) (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t165.t14 t165.t15))
% 21.24/21.42 (step t165.t17 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false)) :rule resolution :premises (t165.t16 t165.a0))
% 21.24/21.42 (step t165.t18 (cl (= true false)) :rule trans :premises (t165.t6 t165.t12 t165.t17))
% 21.24/21.42 (step t165.t19 (cl false) :rule resolution :premises (t165.t1 t165.t2 t165.t18))
% 21.24/21.42 (step t165 (cl (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5)) false) :rule subproof :discharge (t165.a0 t165.a1 t165.a2 t165.a3))
% 21.24/21.42 (step t166 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_pos)
% 21.24/21.42 (step t167 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 21.24/21.42 (step t168 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t169 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule and_pos)
% 21.24/21.42 (step t170 (cl false (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t165 t166 t167 t168 t169))
% 21.24/21.42 (step t171 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) false) :rule reordering :premises (t170))
% 21.24/21.42 (step t172 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) false) :rule contraction :premises (t171))
% 21.24/21.42 (step t173 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) false) :rule resolution :premises (t164 t172))
% 21.24/21.42 (step t174 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (not false)) :rule implies_neg2)
% 21.24/21.42 (step t175 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false)) :rule resolution :premises (t173 t174))
% 21.24/21.42 (step t176 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false)) :rule contraction :premises (t175))
% 21.24/21.42 (step t177 (cl (= (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))))) :rule implies_simplify)
% 21.24/21.42 (step t178 (cl (not (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false)) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv1 :premises (t177))
% 21.24/21.42 (step t179 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t176 t178))
% 21.24/21.42 (step t180 (cl (= (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) false)) :rule resolution :premises (t163 t179))
% 21.24/21.42 (step t181 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) false))) :rule cong :premises (t159 t180))
% 21.24/21.42 (step t182 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) false) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))))) :rule all_simplify)
% 21.24/21.42 (step t183 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))))) :rule trans :premises (t181 t182))
% 21.24/21.42 (step t184 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t185)
% 21.24/21.42 (assume t185.a0 (= tptp.nil tptp.sk3))
% 21.24/21.42 (assume t185.a1 (= tptp.nil tptp.sk4))
% 21.24/21.42 (assume t185.a2 (tptp.memberP tptp.sk3 tptp.sk5))
% 21.24/21.42 (assume t185.a3 (not (tptp.memberP tptp.sk4 tptp.sk5)))
% 21.24/21.42 (step t185.t1 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_neg)
% 21.24/21.42 (step t185.t2 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t185.t1 t185.a3 t185.a1 t185.a0 t185.a2))
% 21.24/21.42 (step t185 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule subproof :discharge (t185.a0 t185.a1 t185.a2 t185.a3))
% 21.24/21.42 (step t186 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t187 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 21.24/21.42 (step t188 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule and_pos)
% 21.24/21.42 (step t189 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_pos)
% 21.24/21.42 (step t190 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule resolution :premises (t185 t186 t187 t188 t189))
% 21.24/21.42 (step t191 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule reordering :premises (t190))
% 21.24/21.42 (step t192 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule contraction :premises (t191))
% 21.24/21.42 (step t193 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t184 t192))
% 21.24/21.42 (step t194 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t195 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t193 t194))
% 21.24/21.42 (step t196 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule contraction :premises (t195))
% 21.24/21.42 (step t197 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk4) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule resolution :premises (t158 t183 t196))
% 21.24/21.42 (step t198 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule not_and :premises (t197))
% 21.24/21.42 (step t199 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 21.24/21.42 (step t200 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 21.24/21.42 (step t201 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule or_neg)
% 21.24/21.42 (step t202 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (not (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule or_neg)
% 21.24/21.42 (step t203 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule resolution :premises (t198 t199 t200 t201 t202))
% 21.24/21.42 (step t204 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule contraction :premises (t203))
% 21.24/21.42 (step t205 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t143 t157 t204))
% 21.24/21.42 (step t206 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule or :premises (t205))
% 21.24/21.42 (step t207 (cl (not (= tptp.nil tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t206))
% 21.24/21.42 (step t208 (cl (not (= (or (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5)) (or (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5)))) (not (or (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5))) (or (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv_pos2)
% 21.24/21.42 (step t209 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 21.24/21.42 (step t210 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t209 a190 a189))
% 21.24/21.42 (step t211 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t210))
% 21.24/21.42 (step t212 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.42 (step t213 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t211 t212))
% 21.24/21.42 (step t214 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t210))
% 21.24/21.42 (step t215 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t214 t212))
% 21.24/21.42 (step t216 (cl (= (or (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5)) (or (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule cong :premises (t213 t215))
% 21.24/21.42 (step t217 (cl (or (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t208 t216 a192))
% 21.24/21.42 (step t218 (cl (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5)) :rule or :premises (t217))
% 21.24/21.42 (step t219 (cl (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)) :rule reordering :premises (t218))
% 21.24/21.42 (step t220 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule and_neg)
% 21.24/21.42 (step t221 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t222)
% 21.24/21.42 (assume t222.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t222.a1 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.42 (assume t222.a2 (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))
% 21.24/21.42 (assume t222.a3 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))
% 21.24/21.42 (step t222.t1 (cl (=> (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t222.t2)
% 21.24/21.42 (assume t222.t2.a0 (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))
% 21.24/21.42 (assume t222.t2.a1 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.42 (assume t222.t2.a2 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))
% 21.24/21.42 (assume t222.t2.a3 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (step t222.t2.t1 (cl (= (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) true) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule equiv_simplify)
% 21.24/21.42 (step t222.t2.t2 (cl (not (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) true)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule equiv1 :premises (t222.t2.t1))
% 21.24/21.42 (step t222.t2.t3 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 21.24/21.42 (step t222.t2.t4 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t222.t2.a3))
% 21.24/21.42 (step t222.t2.t5 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule symm :premises (t222.t2.t4))
% 21.24/21.42 (step t222.t2.t6 (cl (= (tptp.app tptp.sk7 tptp.sk3) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule cong :premises (t222.t2.t3 t222.t2.t5))
% 21.24/21.42 (step t222.t2.t7 (cl (= (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule symm :premises (t222.t2.a2))
% 21.24/21.42 (step t222.t2.t8 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4)) :rule symm :premises (t222.t2.a1))
% 21.24/21.42 (step t222.t2.t9 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk4 tptp.sk7))) :rule cong :premises (t222.t2.t8 t222.t2.t3))
% 21.24/21.42 (step t222.t2.t10 (cl (= (tptp.app tptp.sk7 tptp.sk3) (tptp.app tptp.sk4 tptp.sk7))) :rule trans :premises (t222.t2.t6 t222.t2.t7 t222.t2.t9))
% 21.24/21.42 (step t222.t2.t11 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.42 (step t222.t2.t12 (cl (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule cong :premises (t222.t2.t10 t222.t2.t11))
% 21.24/21.42 (step t222.t2.t13 (cl (= (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) true) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule equiv_simplify)
% 21.24/21.42 (step t222.t2.t14 (cl (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) true) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule equiv2 :premises (t222.t2.t13))
% 21.24/21.42 (step t222.t2.t15 (cl (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) true)) :rule resolution :premises (t222.t2.t14 t222.t2.a0))
% 21.24/21.42 (step t222.t2.t16 (cl (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) true)) :rule trans :premises (t222.t2.t12 t222.t2.t15))
% 21.24/21.42 (step t222.t2.t17 (cl (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule resolution :premises (t222.t2.t2 t222.t2.t16))
% 21.24/21.42 (step t222.t2 (cl (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule subproof :discharge (t222.t2.a0 t222.t2.a1 t222.t2.a2 t222.t2.a3))
% 21.24/21.42 (step t222.t3 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule and_pos)
% 21.24/21.42 (step t222.t4 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.42 (step t222.t5 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_pos)
% 21.24/21.42 (step t222.t6 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t222.t7 (cl (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule resolution :premises (t222.t2 t222.t3 t222.t4 t222.t5 t222.t6))
% 21.24/21.42 (step t222.t8 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule reordering :premises (t222.t7))
% 21.24/21.42 (step t222.t9 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule contraction :premises (t222.t8))
% 21.24/21.42 (step t222.t10 (cl (=> (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule resolution :premises (t222.t1 t222.t9))
% 21.24/21.42 (step t222.t11 (cl (=> (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule implies_neg2)
% 21.24/21.42 (step t222.t12 (cl (=> (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (=> (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule resolution :premises (t222.t10 t222.t11))
% 21.24/21.42 (step t222.t13 (cl (=> (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule contraction :premises (t222.t12))
% 21.24/21.42 (step t222.t14 (cl (not (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule implies :premises (t222.t13))
% 21.24/21.42 (step t222.t15 (cl (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_neg)
% 21.24/21.42 (step t222.t16 (cl (and (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule resolution :premises (t222.t15 t222.a2 t222.a1 t222.a3 t222.a0))
% 21.24/21.42 (step t222.t17 (cl (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule resolution :premises (t222.t14 t222.t16))
% 21.24/21.42 (step t222 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule subproof :discharge (t222.a0 t222.a1 t222.a2 t222.a3))
% 21.24/21.42 (step t223 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t224 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.42 (step t225 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule and_pos)
% 21.24/21.42 (step t226 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_pos)
% 21.24/21.42 (step t227 (cl (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))))) :rule resolution :premises (t222 t223 t224 t225 t226))
% 21.24/21.42 (step t228 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule reordering :premises (t227))
% 21.24/21.42 (step t229 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule contraction :premises (t228))
% 21.24/21.42 (step t230 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule resolution :premises (t221 t229))
% 21.24/21.42 (step t231 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule implies_neg2)
% 21.24/21.42 (step t232 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule resolution :premises (t230 t231))
% 21.24/21.42 (step t233 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule contraction :premises (t232))
% 21.24/21.42 (step t234 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule implies :premises (t233))
% 21.24/21.42 (step t235 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule resolution :premises (t220 t234))
% 21.24/21.42 (step t236 (cl (not (or (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)) :rule or_pos)
% 21.24/21.42 (step t237 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.ssList tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (tptp.memberP tptp.sk7 tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (or (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)))) :rule reordering :premises (t236))
% 21.24/21.42 (step t238 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 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.24/21.42 (anchor :step t239)
% 21.24/21.42 (assume t239.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.24/21.42 (step t239.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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk3) (:= W tptp.sk5)))
% 21.24/21.42 (step t239.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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) :rule or :premises (t239.t1))
% 21.24/21.42 (step t239.t3 (cl (or (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) :rule resolution :premises (t239.t2 t239.a0))
% 21.24/21.42 (step t239 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) :rule subproof :discharge (t239.a0))
% 21.24/21.42 (step t240 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) (or (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) :rule resolution :premises (t238 t239))
% 21.24/21.42 (step t241 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) (not (or (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t242 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)))) :rule resolution :premises (t240 t241))
% 21.24/21.42 (step t243 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)))) :rule contraction :premises (t242))
% 21.24/21.42 (step t244 (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.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) :rule implies :premises (t243))
% 21.24/21.42 (step t245 (cl (or (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5))) :rule resolution :premises (t244 a157))
% 21.24/21.42 (step t246 (cl (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)) :rule or_pos)
% 21.24/21.42 (step t247 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk7 tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5) (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule reordering :premises (t246))
% 21.24/21.42 (step t248 (cl (=> (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))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (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)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t249)
% 21.24/21.42 (assume t249.a0 (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.24/21.42 (step t249.t1 (cl (or (not (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)))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk5) (:= W (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.42 (step t249.t2 (cl (not (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)))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule or :premises (t249.t1))
% 21.24/21.42 (step t249.t3 (cl (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t249.t2 t249.a0))
% 21.24/21.42 (step t249 (cl (not (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)))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule subproof :discharge (t249.a0))
% 21.24/21.42 (step t250 (cl (=> (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))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t248 t249))
% 21.24/21.42 (step t251 (cl (=> (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))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t252 (cl (=> (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))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (=> (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))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule resolution :premises (t250 t251))
% 21.24/21.42 (step t253 (cl (=> (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))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule contraction :premises (t252))
% 21.24/21.42 (step t254 (cl (not (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)))) (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule implies :premises (t253))
% 21.24/21.42 (step t255 (cl (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t254 a140))
% 21.24/21.42 (step t256 (cl (not (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule or_pos)
% 21.24/21.42 (step t257 (cl (not (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule contraction :premises (t256))
% 21.24/21.42 (step t258 (cl (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))))) :rule reordering :premises (t257))
% 21.24/21.42 (step t259 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (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)))))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t260)
% 21.24/21.42 (assume t260.a0 (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.24/21.42 (step t260.t1 (cl (or (not (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)))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V (tptp.cons tptp.sk6 tptp.nil)) (:= W tptp.sk7)))
% 21.24/21.42 (step t260.t2 (cl (not (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)))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule or :premises (t260.t1))
% 21.24/21.42 (step t260.t3 (cl (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule resolution :premises (t260.t2 t260.a0))
% 21.24/21.42 (step t260 (cl (not (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)))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule subproof :discharge (t260.a0))
% 21.24/21.42 (step t261 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule resolution :premises (t259 t260))
% 21.24/21.42 (step t262 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (not (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))))) :rule implies_neg2)
% 21.24/21.42 (step t263 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) (=> (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))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))))) :rule resolution :premises (t261 t262))
% 21.24/21.42 (step t264 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))))) :rule contraction :premises (t263))
% 21.24/21.42 (step t265 (cl (not (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)))))) (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule implies :premises (t264))
% 21.24/21.42 (step t266 (cl (or (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule resolution :premises (t265 a148))
% 21.24/21.42 (step t267 (cl (not (= (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))))) (not (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule equiv_pos2)
% 21.24/21.42 (step t268 (cl (= (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule refl)
% 21.24/21.42 (step t269 (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.24/21.42 (step t270 (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 (t269))
% 21.24/21.42 (step t271 (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.24/21.42 (step t272 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule refl)
% 21.24/21.42 (step t273 (cl (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5))) :rule all_simplify)
% 21.24/21.42 (step t274 (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 (t272 t273))
% 21.24/21.42 (step t275 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5)) true)) :rule all_simplify)
% 21.24/21.42 (step t276 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) true)) :rule trans :premises (t274 t275))
% 21.24/21.42 (step t277 (cl (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) true)) :rule trans :premises (t271 t276))
% 21.24/21.42 (step t278 (cl (= (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t270 t277))
% 21.24/21.42 (step t279 (cl (= (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule refl)
% 21.24/21.42 (step t280 (cl (= (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))))) :rule cong :premises (t268 t278 t279))
% 21.24/21.42 (step t281 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule and_neg)
% 21.24/21.42 (step t282 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t283)
% 21.24/21.42 (assume t283.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t283.a1 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.24/21.42 (step t283.t1 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t283.t2)
% 21.24/21.42 (assume t283.t2.a0 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.24/21.42 (assume t283.t2.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (step t283.t2.t1 (cl (= (= (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5) false) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.42 (step t283.t2.t2 (cl (not (= (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5) false)) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule equiv1 :premises (t283.t2.t1))
% 21.24/21.42 (step t283.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t283.t2.a1))
% 21.24/21.42 (step t283.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule symm :premises (t283.t2.t3))
% 21.24/21.42 (step t283.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t283.t2.t4))
% 21.24/21.42 (step t283.t2.t6 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.42 (step t283.t2.t7 (cl (= (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t283.t2.t5 t283.t2.t6))
% 21.24/21.42 (step t283.t2.t8 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.42 (step t283.t2.t9 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv2 :premises (t283.t2.t8))
% 21.24/21.42 (step t283.t2.t10 (cl (not (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule not_not)
% 21.24/21.42 (step t283.t2.t11 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t283.t2.t9 t283.t2.t10))
% 21.24/21.42 (step t283.t2.t12 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false)) :rule resolution :premises (t283.t2.t11 t283.t2.a0))
% 21.24/21.42 (step t283.t2.t13 (cl (= (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5) false)) :rule trans :premises (t283.t2.t7 t283.t2.t12))
% 21.24/21.42 (step t283.t2.t14 (cl (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t283.t2.t2 t283.t2.t13))
% 21.24/21.42 (step t283.t2 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule subproof :discharge (t283.t2.a0 t283.t2.a1))
% 21.24/21.42 (step t283.t3 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.24/21.42 (step t283.t4 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t283.t5 (cl (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule resolution :premises (t283.t2 t283.t3 t283.t4))
% 21.24/21.42 (step t283.t6 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule reordering :premises (t283.t5))
% 21.24/21.42 (step t283.t7 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule contraction :premises (t283.t6))
% 21.24/21.42 (step t283.t8 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t283.t1 t283.t7))
% 21.24/21.42 (step t283.t9 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t283.t10 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule resolution :premises (t283.t8 t283.t9))
% 21.24/21.42 (step t283.t11 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule contraction :premises (t283.t10))
% 21.24/21.42 (step t283.t12 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule implies :premises (t283.t11))
% 21.24/21.42 (step t283.t13 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_neg)
% 21.24/21.42 (step t283.t14 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule resolution :premises (t283.t13 t283.a1 t283.a0))
% 21.24/21.42 (step t283.t15 (cl (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t283.t12 t283.t14))
% 21.24/21.42 (step t283 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule subproof :discharge (t283.a0 t283.a1))
% 21.24/21.42 (step t284 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t285 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_pos)
% 21.24/21.42 (step t286 (cl (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t283 t284 t285))
% 21.24/21.42 (step t287 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule reordering :premises (t286))
% 21.24/21.42 (step t288 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule contraction :premises (t287))
% 21.24/21.42 (step t289 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t282 t288))
% 21.24/21.42 (step t290 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t291 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule resolution :premises (t289 t290))
% 21.24/21.42 (step t292 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule contraction :premises (t291))
% 21.24/21.42 (step t293 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule implies :premises (t292))
% 21.24/21.42 (step t294 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule resolution :premises (t281 t293))
% 21.24/21.42 (step t295 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))) :rule or_neg)
% 21.24/21.42 (step t296 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (not (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule or_neg)
% 21.24/21.42 (step t297 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (not (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule or_neg)
% 21.24/21.42 (step t298 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule resolution :premises (t294 t295 t296 t297))
% 21.24/21.42 (step t299 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (not (tptp.memberP tptp.sk3 tptp.sk5))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule contraction :premises (t298))
% 21.24/21.42 (step t300 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5)))) :rule resolution :premises (t267 t280 t299))
% 21.24/21.42 (step t301 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule or :premises (t300))
% 21.24/21.42 (step t302 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk5))) :rule reordering :premises (t301))
% 21.24/21.42 (step t303 (cl (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule or_pos)
% 21.24/21.42 (step t304 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)))) :rule reordering :premises (t303))
% 21.24/21.42 (step t305 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) 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.24/21.42 (anchor :step t306)
% 21.24/21.42 (assume t306.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.24/21.42 (step t306.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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk5) (:= W tptp.sk7)))
% 21.24/21.42 (step t306.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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule or :premises (t306.t1))
% 21.24/21.42 (step t306.t3 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule resolution :premises (t306.t2 t306.a0))
% 21.24/21.42 (step t306 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule subproof :discharge (t306.a0))
% 21.24/21.42 (step t307 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule resolution :premises (t305 t306))
% 21.24/21.42 (step t308 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.42 (step t309 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) 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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)))) :rule resolution :premises (t307 t308))
% 21.24/21.42 (step t310 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)))) :rule contraction :premises (t309))
% 21.24/21.42 (step t311 (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.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule implies :premises (t310))
% 21.24/21.42 (step t312 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule resolution :premises (t311 a139))
% 21.24/21.42 (step t313 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.memberP tptp.sk3 tptp.sk5) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk7))) :rule resolution :premises (t235 t237 t245 a191 a187 t247 t255 a191 t258 t266 t302 t304 t312 a191 a188))
% 21.24/21.42 (step t314 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule contraction :premises (t313))
% 21.24/21.42 (step t315 (cl (not (= (or (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 21.24/21.42 (step t316 (cl (= (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule all_simplify)
% 21.24/21.42 (step t317 (cl (= (or (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t316 t122))
% 21.24/21.42 (step t318 (cl (or (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t315 t317 a198))
% 21.24/21.42 (step t319 (cl (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t318))
% 21.24/21.42 (step t320 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule reordering :premises (t319))
% 21.24/21.42 (step t321 (cl (tptp.ssItem tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a195))
% 21.24/21.42 (step t322 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t314 t109 t119 a7 t320 t11 t126 t321))
% 21.24/21.42 (step t323 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t322))
% 21.24/21.42 (step t324 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a194))
% 21.24/21.42 (step t325 (cl (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule and_neg)
% 21.24/21.42 (step t326 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7)) (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t327)
% 21.24/21.42 (assume t327.a0 (= tptp.nil tptp.sk3))
% 21.24/21.42 (assume t327.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t327.a2 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (assume t327.a3 (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))
% 21.24/21.42 (step t327.t1 (cl (=> (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7)) (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t327.t2)
% 21.24/21.42 (assume t327.t2.a0 (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))
% 21.24/21.42 (assume t327.t2.a1 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.42 (assume t327.t2.a2 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t327.t2.a3 (= tptp.nil tptp.sk3))
% 21.24/21.42 (step t327.t2.t1 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t327.t2.a3))
% 21.24/21.42 (step t327.t2.t2 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t327.t2.t1))
% 21.24/21.42 (step t327.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t327.t2.a2))
% 21.24/21.42 (step t327.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule symm :premises (t327.t2.t3))
% 21.24/21.42 (step t327.t2.t5 (cl (= (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) :rule symm :premises (t327.t2.a1))
% 21.24/21.42 (step t327.t2.t6 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 21.24/21.42 (step t327.t2.t7 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) (tptp.app tptp.nil tptp.sk7))) :rule cong :premises (t327.t2.t5 t327.t2.t6))
% 21.24/21.42 (step t327.t2.t8 (cl (= (tptp.app tptp.nil tptp.sk7) tptp.sk7)) :rule symm :premises (t327.t2.a0))
% 21.24/21.42 (step t327.t2.t9 (cl (= tptp.nil tptp.sk7)) :rule trans :premises (t327.t2.t2 t327.t2.t4 t327.t2.t7 t327.t2.t8))
% 21.24/21.42 (step t327.t2 (cl (not (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7)) :rule subproof :discharge (t327.t2.a0 t327.t2.a1 t327.t2.a2 t327.t2.a3))
% 21.24/21.42 (step t327.t3 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t327.t4 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t327.t5 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t327.t6 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t327.t7 (cl (= tptp.nil tptp.sk7) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t327.t2 t327.t3 t327.t4 t327.t5 t327.t6))
% 21.24/21.42 (step t327.t8 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk7)) :rule reordering :premises (t327.t7))
% 21.24/21.42 (step t327.t9 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk7)) :rule contraction :premises (t327.t8))
% 21.24/21.42 (step t327.t10 (cl (=> (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk7)) :rule resolution :premises (t327.t1 t327.t9))
% 21.24/21.42 (step t327.t11 (cl (=> (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7)) (not (= tptp.nil tptp.sk7))) :rule implies_neg2)
% 21.24/21.42 (step t327.t12 (cl (=> (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7)) (=> (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7))) :rule resolution :premises (t327.t10 t327.t11))
% 21.24/21.42 (step t327.t13 (cl (=> (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7))) :rule contraction :premises (t327.t12))
% 21.24/21.42 (step t327.t14 (cl (not (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk7)) :rule implies :premises (t327.t13))
% 21.24/21.42 (step t327.t15 (cl (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (not (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 21.24/21.42 (step t327.t16 (cl (and (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t327.t15 t327.a3 t327.a2 t327.a1 t327.a0))
% 21.24/21.42 (step t327.t17 (cl (= tptp.nil tptp.sk7)) :rule resolution :premises (t327.t14 t327.t16))
% 21.24/21.42 (step t327 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7)) :rule subproof :discharge (t327.a0 t327.a1 t327.a2 t327.a3))
% 21.24/21.42 (step t328 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t329 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t330 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t331 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t332 (cl (= tptp.nil tptp.sk7) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))))) :rule resolution :premises (t327 t328 t329 t330 t331))
% 21.24/21.42 (step t333 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.nil tptp.sk7)) :rule reordering :premises (t332))
% 21.24/21.42 (step t334 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.nil tptp.sk7)) :rule contraction :premises (t333))
% 21.24/21.42 (step t335 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk7)) :rule resolution :premises (t326 t334))
% 21.24/21.42 (step t336 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7)) (not (= tptp.nil tptp.sk7))) :rule implies_neg2)
% 21.24/21.42 (step t337 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7)) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7))) :rule resolution :premises (t335 t336))
% 21.24/21.42 (step t338 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7))) :rule contraction :premises (t337))
% 21.24/21.42 (step t339 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (= tptp.nil tptp.sk7)) :rule implies :premises (t338))
% 21.24/21.42 (step t340 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) (= tptp.nil tptp.sk7)) :rule resolution :premises (t325 t339))
% 21.24/21.42 (step t341 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil tptp.sk7) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule reordering :premises (t340))
% 21.24/21.42 (step t342 (cl (not (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))) :rule or_pos)
% 21.24/21.42 (step t343 (cl (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)) (not (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))))) :rule reordering :premises (t342))
% 21.24/21.42 (step t344 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t345)
% 21.24/21.42 (assume t345.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 21.24/21.42 (step t345.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))))) :rule forall_inst :args ((:= U tptp.sk7)))
% 21.24/21.42 (step t345.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule or :premises (t345.t1))
% 21.24/21.42 (step t345.t3 (cl (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule resolution :premises (t345.t2 t345.a0))
% 21.24/21.42 (step t345 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule subproof :discharge (t345.a0))
% 21.24/21.42 (step t346 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule resolution :premises (t344 t345))
% 21.24/21.42 (step t347 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (not (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))))) :rule implies_neg2)
% 21.24/21.42 (step t348 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))))) :rule resolution :premises (t346 t347))
% 21.24/21.42 (step t349 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7))))) :rule contraction :premises (t348))
% 21.24/21.42 (step t350 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule implies :premises (t349))
% 21.24/21.42 (step t351 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 21.24/21.42 (anchor :step t352 :args ((U $$unsorted) (:= U U)))
% 21.24/21.42 (step t352.t1 (cl (= U U)) :rule refl)
% 21.24/21.42 (step t352.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 21.24/21.42 (step t352.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 21.24/21.42 (step t352.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t352.t2 t352.t3))
% 21.24/21.42 (step t352 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 21.24/21.42 (step t353 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t351 t352 a73))
% 21.24/21.42 (step t354 (cl (or (not (tptp.ssList tptp.sk7)) (= tptp.sk7 (tptp.app tptp.nil tptp.sk7)))) :rule resolution :premises (t350 t353))
% 21.24/21.42 (step t355 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.nil tptp.sk7) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6))) :rule resolution :premises (t28 t30 t41 t341 t343 t354 t109 t119 a7))
% 21.24/21.42 (step t356 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (= tptp.nil tptp.sk7) (not (tptp.ssItem tptp.sk6))) :rule contraction :premises (t355))
% 21.24/21.42 (step t357 (cl (tptp.ssItem tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a195))
% 21.24/21.42 (step t358 (cl (not (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t356 t11 t126 t357))
% 21.24/21.42 (step t359 (cl (not (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t358))
% 21.24/21.42 (step t360 (cl (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk7)) (not (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule and_neg)
% 21.24/21.42 (step t361 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t362)
% 21.24/21.42 (assume t362.a0 (= tptp.nil tptp.sk3))
% 21.24/21.42 (assume t362.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.42 (assume t362.a2 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t362.a3 (= tptp.nil tptp.sk7))
% 21.24/21.42 (assume t362.a4 (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))
% 21.24/21.42 (step t362.t1 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 21.24/21.42 (anchor :step t362.t2)
% 21.24/21.42 (assume t362.t2.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.42 (assume t362.t2.a1 (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))
% 21.24/21.42 (assume t362.t2.a2 (= tptp.nil tptp.sk7))
% 21.24/21.42 (assume t362.t2.a3 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.42 (assume t362.t2.a4 (= tptp.nil tptp.sk3))
% 21.24/21.42 (step t362.t2.t1 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t362.t2.a4))
% 21.24/21.42 (step t362.t2.t2 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t362.t2.t1))
% 21.24/21.42 (step t362.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t362.t2.a3))
% 21.24/21.42 (step t362.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule symm :premises (t362.t2.t3))
% 21.24/21.42 (step t362.t2.t5 (cl (= (tptp.cons tptp.sk6 tptp.nil) (tptp.cons tptp.sk6 tptp.nil))) :rule refl)
% 21.24/21.42 (step t362.t2.t6 (cl (= tptp.sk7 tptp.nil)) :rule symm :premises (t362.t2.a2))
% 21.24/21.42 (step t362.t2.t7 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule cong :premises (t362.t2.t5 t362.t2.t6))
% 21.24/21.42 (step t362.t2.t8 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil) (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)))) :rule symm :premises (t362.t2.a1))
% 21.24/21.42 (step t362.t2.t9 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 21.24/21.42 (step t362.t2.t10 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t362.t2.a0))
% 21.24/21.42 (step t362.t2.t11 (cl (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.cons tptp.sk6 tptp.nil))) :rule cong :premises (t362.t2.t9 t362.t2.t10))
% 21.24/21.42 (step t362.t2.t12 (cl (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule trans :premises (t362.t2.t2 t362.t2.t4 t362.t2.t7 t362.t2.t8 t362.t2.t11))
% 21.24/21.42 (step t362.t2 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (= tptp.nil tptp.sk7)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule subproof :discharge (t362.t2.a0 t362.t2.a1 t362.t2.a2 t362.t2.a3 t362.t2.a4))
% 21.24/21.42 (step t362.t3 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t362.t4 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule and_pos)
% 21.24/21.42 (step t362.t5 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk7)) :rule and_pos)
% 21.24/21.42 (step t362.t6 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.42 (step t362.t7 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.42 (step t362.t8 (cl (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t362.t2 t362.t3 t362.t4 t362.t5 t362.t6 t362.t7))
% 21.24/21.42 (step t362.t9 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule reordering :premises (t362.t8))
% 21.24/21.42 (step t362.t10 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule contraction :premises (t362.t9))
% 21.24/21.42 (step t362.t11 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t362.t1 t362.t10))
% 21.24/21.42 (step t362.t12 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies_neg2)
% 21.24/21.42 (step t362.t13 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t362.t11 t362.t12))
% 21.24/21.43 (step t362.t14 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t362.t13))
% 21.24/21.43 (step t362.t15 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule implies :premises (t362.t14))
% 21.24/21.43 (step t362.t16 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (not (= tptp.nil tptp.sk7)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 21.24/21.43 (step t362.t17 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t362.t16 t362.a1 t362.a4 t362.a3 t362.a2 t362.a0))
% 21.24/21.43 (step t362.t18 (cl (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t362.t15 t362.t17))
% 21.24/21.43 (step t362 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk7)) (not (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule subproof :discharge (t362.a0 t362.a1 t362.a2 t362.a3 t362.a4))
% 21.24/21.43 (step t363 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 21.24/21.43 (step t364 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t365 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.43 (step t366 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.nil tptp.sk7)) :rule and_pos)
% 21.24/21.43 (step t367 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t368 (cl (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule resolution :premises (t362 t363 t364 t365 t366 t367))
% 21.24/21.43 (step t369 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule reordering :premises (t368))
% 21.24/21.43 (step t370 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule contraction :premises (t369))
% 21.24/21.43 (step t371 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t361 t370))
% 21.24/21.43 (step t372 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies_neg2)
% 21.24/21.43 (step t373 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (=> (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t371 t372))
% 21.24/21.43 (step t374 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule contraction :premises (t373))
% 21.24/21.43 (step t375 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.nil tptp.sk7) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule implies :premises (t374))
% 21.24/21.43 (step t376 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk7)) (not (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t360 t375))
% 21.24/21.43 (step t377 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.nil tptp.sk7)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (not (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule reordering :premises (t376))
% 21.24/21.43 (step t378 (cl (not (= (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (= tptp.nil tptp.sk4) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))))) (not (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) (or (= tptp.nil tptp.sk4) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule equiv_pos2)
% 21.24/21.43 (step t379 (cl (= (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) true) (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 21.24/21.43 (step t380 (cl (not (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) true)) (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4))) :rule equiv1 :premises (t379))
% 21.24/21.43 (step t381 (cl (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) (= (= tptp.nil tptp.sk4) (not (not (= tptp.nil tptp.sk4)))))) :rule all_simplify)
% 21.24/21.43 (step t382 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))) :rule refl)
% 21.24/21.43 (step t383 (cl (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4))) :rule all_simplify)
% 21.24/21.43 (step t384 (cl (= (= (= tptp.nil tptp.sk4) (not (not (= tptp.nil tptp.sk4)))) (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)))) :rule cong :premises (t382 t383))
% 21.24/21.43 (step t385 (cl (= (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)) true)) :rule all_simplify)
% 21.24/21.43 (step t386 (cl (= (= (= tptp.nil tptp.sk4) (not (not (= tptp.nil tptp.sk4)))) true)) :rule trans :premises (t384 t385))
% 21.24/21.43 (step t387 (cl (= (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) true)) :rule trans :premises (t381 t386))
% 21.24/21.43 (step t388 (cl (= (not (not (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4))) :rule resolution :premises (t380 t387))
% 21.24/21.43 (step t389 (cl (= (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule refl)
% 21.24/21.43 (step t390 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))))) :rule refl)
% 21.24/21.43 (step t391 (cl (= (not (= tptp.nil tptp.sk7)) (not (= tptp.nil tptp.sk7)))) :rule refl)
% 21.24/21.43 (step t392 (cl (= (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule refl)
% 21.24/21.43 (step t393 (cl (= (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (= tptp.nil tptp.sk4) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))))) :rule cong :premises (t388 t389 t390 t391 t392))
% 21.24/21.43 (step t394 (cl (not (= (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))))) (not (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule equiv_pos2)
% 21.24/21.43 (step t395 (cl (= (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule refl)
% 21.24/21.43 (step t396 (cl (= (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))))) :rule equiv_simplify)
% 21.24/21.43 (step t397 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (not (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))))) :rule equiv2 :premises (t396))
% 21.24/21.43 (step t398 (cl (not (not (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule not_not)
% 21.24/21.43 (step t399 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t397 t398))
% 21.24/21.43 (step t400 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t401)
% 21.24/21.43 (assume t401.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.43 (assume t401.a1 (= tptp.nil tptp.sk7))
% 21.24/21.43 (assume t401.a2 (= tptp.sk4 tptp.sk7))
% 21.24/21.43 (assume t401.a3 (not (= tptp.nil tptp.sk4)))
% 21.24/21.43 (step t401.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 21.24/21.43 (step t401.t2 (cl (= (= false true) false)) :rule all_simplify)
% 21.24/21.43 (step t401.t3 (cl (= (= (= tptp.nil tptp.sk4) false) (not (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 21.24/21.43 (step t401.t4 (cl (= (= tptp.nil tptp.sk4) false) (not (not (= tptp.nil tptp.sk4)))) :rule equiv2 :premises (t401.t3))
% 21.24/21.43 (step t401.t5 (cl (not (not (not (= tptp.nil tptp.sk4)))) (= tptp.nil tptp.sk4)) :rule not_not)
% 21.24/21.43 (step t401.t6 (cl (= (= tptp.nil tptp.sk4) false) (= tptp.nil tptp.sk4)) :rule resolution :premises (t401.t4 t401.t5))
% 21.24/21.43 (step t401.t7 (cl (= (= tptp.nil tptp.sk4) false)) :rule resolution :premises (t401.t6 t401.a3))
% 21.24/21.43 (step t401.t8 (cl (= false (= tptp.nil tptp.sk4))) :rule symm :premises (t401.t7))
% 21.24/21.43 (step t401.t9 (cl (= (= (= tptp.nil tptp.sk4) true) (= tptp.nil tptp.sk4))) :rule equiv_simplify)
% 21.24/21.43 (step t401.t10 (cl (= (= tptp.nil tptp.sk4) true) (not (= tptp.nil tptp.sk4))) :rule equiv2 :premises (t401.t9))
% 21.24/21.43 (step t401.t11 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t401.a0))
% 21.24/21.43 (step t401.t12 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t401.t11))
% 21.24/21.43 (step t401.t13 (cl (= tptp.sk7 tptp.sk4)) :rule symm :premises (t401.a2))
% 21.24/21.43 (step t401.t14 (cl (= tptp.sk4 tptp.sk7)) :rule symm :premises (t401.t13))
% 21.24/21.43 (step t401.t15 (cl (= tptp.sk7 tptp.nil)) :rule symm :premises (t401.a1))
% 21.24/21.43 (step t401.t16 (cl (= tptp.sk4 (tptp.app tptp.nil tptp.nil))) :rule trans :premises (t401.t14 t401.t15 t401.t12))
% 21.24/21.43 (step t401.t17 (cl (= (tptp.app tptp.nil tptp.nil) tptp.sk4)) :rule symm :premises (t401.t16))
% 21.24/21.43 (step t401.t18 (cl (= tptp.nil tptp.sk4)) :rule trans :premises (t401.t12 t401.t17))
% 21.24/21.43 (step t401.t19 (cl (= (= tptp.nil tptp.sk4) true)) :rule resolution :premises (t401.t10 t401.t18))
% 21.24/21.43 (step t401.t20 (cl (= false true)) :rule trans :premises (t401.t8 t401.t19))
% 21.24/21.43 (step t401.t21 (cl false) :rule resolution :premises (t401.t1 t401.t2 t401.t20))
% 21.24/21.43 (step t401 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk7)) (not (= tptp.sk4 tptp.sk7)) (not (not (= tptp.nil tptp.sk4))) false) :rule subproof :discharge (t401.a0 t401.a1 t401.a2 t401.a3))
% 21.24/21.43 (step t402 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t403 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (= tptp.nil tptp.sk7)) :rule and_pos)
% 21.24/21.43 (step t404 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (= tptp.sk4 tptp.sk7)) :rule and_pos)
% 21.24/21.43 (step t405 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (= tptp.nil tptp.sk4))) :rule and_pos)
% 21.24/21.43 (step t406 (cl false (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) :rule resolution :premises (t401 t402 t403 t404 t405))
% 21.24/21.43 (step t407 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) false) :rule reordering :premises (t406))
% 21.24/21.43 (step t408 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) false) :rule contraction :premises (t407))
% 21.24/21.43 (step t409 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) false) :rule resolution :premises (t400 t408))
% 21.24/21.43 (step t410 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (not false)) :rule implies_neg2)
% 21.24/21.43 (step t411 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false)) :rule resolution :premises (t409 t410))
% 21.24/21.43 (step t412 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false)) :rule contraction :premises (t411))
% 21.24/21.43 (step t413 (cl (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))))) :rule implies_simplify)
% 21.24/21.43 (step t414 (cl (not (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false)) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) :rule equiv1 :premises (t413))
% 21.24/21.43 (step t415 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) :rule resolution :premises (t412 t414))
% 21.24/21.43 (step t416 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) false)) :rule resolution :premises (t399 t415))
% 21.24/21.43 (step t417 (cl (= (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) false))) :rule cong :premises (t395 t416))
% 21.24/21.43 (step t418 (cl (= (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) false) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))))) :rule all_simplify)
% 21.24/21.43 (step t419 (cl (= (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))))) :rule trans :premises (t417 t418))
% 21.24/21.43 (step t420 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t421)
% 21.24/21.43 (assume t421.a0 (not (= tptp.nil tptp.sk4)))
% 21.24/21.43 (assume t421.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.43 (assume t421.a2 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.43 (assume t421.a3 (= tptp.nil tptp.sk7))
% 21.24/21.43 (assume t421.a4 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.43 (step t421.t1 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk7)) (not (= tptp.sk4 tptp.sk7)) (not (not (= tptp.nil tptp.sk4)))) :rule and_neg)
% 21.24/21.43 (step t421.t2 (cl (=> (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7)) (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t421.t3)
% 21.24/21.43 (assume t421.t3.a0 (= tptp.nil tptp.sk7))
% 21.24/21.43 (assume t421.t3.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 21.24/21.43 (assume t421.t3.a2 (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))
% 21.24/21.43 (assume t421.t3.a3 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.43 (step t421.t3.t1 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4)) :rule symm :premises (t421.t3.a3))
% 21.24/21.43 (step t421.t3.t2 (cl (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule symm :premises (t421.t3.t1))
% 21.24/21.43 (step t421.t3.t3 (cl (= tptp.sk7 tptp.nil)) :rule symm :premises (t421.t3.a0))
% 21.24/21.43 (step t421.t3.t4 (cl (= (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) :rule symm :premises (t421.t3.a2))
% 21.24/21.43 (step t421.t3.t5 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.nil))) :rule cong :premises (t421.t3.t3 t421.t3.t4))
% 21.24/21.43 (step t421.t3.t6 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t421.t3.a1))
% 21.24/21.43 (step t421.t3.t7 (cl (= tptp.nil tptp.sk7)) :rule symm :premises (t421.t3.t3))
% 21.24/21.43 (step t421.t3.t8 (cl (= tptp.sk4 tptp.sk7)) :rule trans :premises (t421.t3.t2 t421.t3.t5 t421.t3.t6 t421.t3.t7))
% 21.24/21.43 (step t421.t3 (cl (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7)) :rule subproof :discharge (t421.t3.a0 t421.t3.a1 t421.t3.a2 t421.t3.a3))
% 21.24/21.43 (step t421.t4 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.nil tptp.sk7)) :rule and_pos)
% 21.24/21.43 (step t421.t5 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t421.t6 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t421.t7 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.43 (step t421.t8 (cl (= tptp.sk4 tptp.sk7) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t421.t3 t421.t4 t421.t5 t421.t6 t421.t7))
% 21.24/21.43 (step t421.t9 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk4 tptp.sk7)) :rule reordering :premises (t421.t8))
% 21.24/21.43 (step t421.t10 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk4 tptp.sk7)) :rule contraction :premises (t421.t9))
% 21.24/21.43 (step t421.t11 (cl (=> (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7)) (= tptp.sk4 tptp.sk7)) :rule resolution :premises (t421.t2 t421.t10))
% 21.24/21.43 (step t421.t12 (cl (=> (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7)) (not (= tptp.sk4 tptp.sk7))) :rule implies_neg2)
% 21.24/21.43 (step t421.t13 (cl (=> (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7)) (=> (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7))) :rule resolution :premises (t421.t11 t421.t12))
% 21.24/21.43 (step t421.t14 (cl (=> (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 tptp.sk7))) :rule contraction :premises (t421.t13))
% 21.24/21.43 (step t421.t15 (cl (not (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk4 tptp.sk7)) :rule implies :premises (t421.t14))
% 21.24/21.43 (step t421.t16 (cl (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule and_neg)
% 21.24/21.43 (step t421.t17 (cl (and (= tptp.nil tptp.sk7) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t421.t16 t421.a3 t421.a1 t421.a4 t421.a2))
% 21.24/21.43 (step t421.t18 (cl (= tptp.sk4 tptp.sk7)) :rule resolution :premises (t421.t15 t421.t17))
% 21.24/21.43 (step t421.t19 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t421.t1 t421.a1 t421.a3 t421.t18 t421.a0))
% 21.24/21.43 (step t421 (cl (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule subproof :discharge (t421.a0 t421.a1 t421.a2 t421.a3 t421.a4))
% 21.24/21.43 (step t422 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk4))) :rule and_pos)
% 21.24/21.43 (step t423 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t424 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.43 (step t425 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil tptp.sk7)) :rule and_pos)
% 21.24/21.43 (step t426 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) :rule and_pos)
% 21.24/21.43 (step t427 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t421 t422 t423 t424 t425 t426))
% 21.24/21.43 (step t428 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule reordering :premises (t427))
% 21.24/21.43 (step t429 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t428))
% 21.24/21.43 (step t430 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t420 t429))
% 21.24/21.43 (step t431 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) :rule implies_neg2)
% 21.24/21.43 (step t432 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4)))) (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) :rule resolution :premises (t430 t431))
% 21.24/21.43 (step t433 (cl (=> (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk7) (= tptp.sk4 tptp.sk7) (not (= tptp.nil tptp.sk4))))) :rule contraction :premises (t432))
% 21.24/21.43 (step t434 (cl (not (and (not (= tptp.nil tptp.sk4)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= tptp.nil tptp.sk7) (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t394 t419 t433))
% 21.24/21.43 (step t435 (cl (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule not_and :premises (t434))
% 21.24/21.43 (step t436 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (not (not (= tptp.nil tptp.sk4))))) :rule or_neg)
% 21.24/21.43 (step t437 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule or_neg)
% 21.24/21.43 (step t438 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))))) :rule or_neg)
% 21.24/21.43 (step t439 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (not (= tptp.nil tptp.sk7)))) :rule or_neg)
% 21.24/21.43 (step t440 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (not (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule or_neg)
% 21.24/21.43 (step t441 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t435 t436 t437 t438 t439 t440))
% 21.24/21.43 (step t442 (cl (or (not (not (= tptp.nil tptp.sk4))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t441))
% 21.24/21.43 (step t443 (cl (or (= tptp.nil tptp.sk4) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t378 t393 t442))
% 21.24/21.43 (step t444 (cl (= tptp.nil tptp.sk4) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= tptp.nil tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t443))
% 21.24/21.43 (step t445 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule or_pos)
% 21.24/21.43 (step t446 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))) :rule contraction :premises (t445))
% 21.24/21.43 (step t447 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule reordering :premises (t446))
% 21.24/21.43 (step t448 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (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))))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t449)
% 21.24/21.43 (assume t449.a0 (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.24/21.43 (step t449.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil) (:= W tptp.nil)))
% 21.24/21.43 (step t449.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule or :premises (t449.t1))
% 21.24/21.43 (step t449.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule resolution :premises (t449.t2 t449.a0))
% 21.24/21.43 (step t449 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule subproof :discharge (t449.a0))
% 21.24/21.43 (step t450 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule resolution :premises (t448 t449))
% 21.24/21.43 (step t451 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule implies_neg2)
% 21.24/21.43 (step t452 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule resolution :premises (t450 t451))
% 21.24/21.43 (step t453 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil))))) :rule contraction :premises (t452))
% 21.24/21.43 (step t454 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk6 (tptp.app tptp.nil tptp.nil)) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.nil)))) :rule implies :premises (t453))
% 21.24/21.43 (step t455 (cl (tptp.ssItem tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a195))
% 21.24/21.43 (step t456 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t377 t91 t444 t91 t320 t126 t447 t454 a156 t455))
% 21.24/21.43 (step t457 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.nil))) :rule contraction :premises (t456))
% 21.24/21.43 (step t458 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk4) (not (tptp.ssList tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.ssList tptp.nil))) :rule resolution :premises (t457 t13 a188 t138 t141))
% 21.24/21.43 (step t459 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk4) (not (tptp.ssList tptp.nil))) :rule contraction :premises (t458))
% 21.24/21.43 (step t460 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk7)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t459 a7))
% 21.24/21.43 (step t461 (cl (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk7))) :rule reordering :premises (t460))
% 21.24/21.43 (step t462 (cl (not (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t359 t13 t142 a188 a7 t461))
% 21.24/21.43 (step t463 (cl (not (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4)) :rule contraction :premises (t462))
% 21.24/21.43 (step t464 (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.24/21.43 (step t465 (cl (= (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule refl)
% 21.24/21.43 (step t466 (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 (t144 t145 t465 t278))
% 21.24/21.43 (step t467 (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.24/21.43 (step t468 (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.24/21.43 (step t469 (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.24/21.43 (step t470 (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 (t469))
% 21.24/21.43 (step t471 (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.24/21.43 (step t472 (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 (t470 t471))
% 21.24/21.43 (step t473 (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.24/21.43 (anchor :step t474)
% 21.24/21.43 (assume t474.a0 (tptp.memberP tptp.sk4 tptp.sk5))
% 21.24/21.43 (assume t474.a1 (= tptp.nil tptp.sk4))
% 21.24/21.43 (assume t474.a2 (= tptp.nil tptp.sk3))
% 21.24/21.43 (assume t474.a3 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.24/21.43 (step t474.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 21.24/21.43 (step t474.t2 (cl (= (= false true) false)) :rule all_simplify)
% 21.24/21.43 (step t474.t3 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.43 (step t474.t4 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv2 :premises (t474.t3))
% 21.24/21.43 (step t474.t5 (cl (not (not (not (tptp.memberP tptp.sk3 tptp.sk5)))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule not_not)
% 21.24/21.43 (step t474.t6 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t474.t4 t474.t5))
% 21.24/21.43 (step t474.t7 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) false)) :rule resolution :premises (t474.t6 t474.a3))
% 21.24/21.43 (step t474.t8 (cl (= false (tptp.memberP tptp.sk3 tptp.sk5))) :rule symm :premises (t474.t7))
% 21.24/21.43 (step t474.t9 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t474.a2))
% 21.24/21.43 (step t474.t10 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t474.a1))
% 21.24/21.43 (step t474.t11 (cl (= tptp.nil tptp.sk4)) :rule symm :premises (t474.t10))
% 21.24/21.43 (step t474.t12 (cl (= tptp.sk3 tptp.sk4)) :rule trans :premises (t474.t9 t474.t11))
% 21.24/21.43 (step t474.t13 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.43 (step t474.t14 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t474.t12 t474.t13))
% 21.24/21.43 (step t474.t15 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) true) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv_simplify)
% 21.24/21.43 (step t474.t16 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv2 :premises (t474.t15))
% 21.24/21.43 (step t474.t17 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true)) :rule resolution :premises (t474.t16 t474.a0))
% 21.24/21.43 (step t474.t18 (cl (= false true)) :rule trans :premises (t474.t8 t474.t14 t474.t17))
% 21.24/21.43 (step t474.t19 (cl false) :rule resolution :premises (t474.t1 t474.t2 t474.t18))
% 21.24/21.43 (step t474 (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 (t474.a0 t474.a1 t474.a2 t474.a3))
% 21.24/21.43 (step t475 (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.24/21.43 (step t476 (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.24/21.43 (step t477 (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.24/21.43 (step t478 (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.24/21.43 (step t479 (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 (t474 t475 t476 t477 t478))
% 21.24/21.43 (step t480 (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 (t479))
% 21.24/21.43 (step t481 (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 (t480))
% 21.24/21.43 (step t482 (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 (t473 t481))
% 21.24/21.43 (step t483 (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.24/21.43 (step t484 (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 (t482 t483))
% 21.24/21.43 (step t485 (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 (t484))
% 21.24/21.43 (step t486 (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.24/21.43 (step t487 (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 (t486))
% 21.24/21.43 (step t488 (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 (t485 t487))
% 21.24/21.43 (step t489 (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 (t472 t488))
% 21.24/21.43 (step t490 (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 (t468 t489))
% 21.24/21.43 (step t491 (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.24/21.43 (step t492 (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 (t490 t491))
% 21.24/21.43 (step t493 (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.24/21.43 (anchor :step t494)
% 21.24/21.43 (assume t494.a0 (= tptp.nil tptp.sk3))
% 21.24/21.43 (assume t494.a1 (= tptp.nil tptp.sk4))
% 21.24/21.43 (assume t494.a2 (tptp.memberP tptp.sk4 tptp.sk5))
% 21.24/21.43 (assume t494.a3 (not (tptp.memberP tptp.sk3 tptp.sk5)))
% 21.24/21.43 (step t494.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.24/21.43 (step t494.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 (t494.t1 t494.a2 t494.a1 t494.a0 t494.a3))
% 21.24/21.43 (step t494 (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 (t494.a0 t494.a1 t494.a2 t494.a3))
% 21.24/21.43 (step t495 (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.24/21.43 (step t496 (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.24/21.43 (step t497 (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.24/21.43 (step t498 (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.24/21.43 (step t499 (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 (t494 t495 t496 t497 t498))
% 21.24/21.43 (step t500 (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 (t499))
% 21.24/21.43 (step t501 (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 (t500))
% 21.24/21.43 (step t502 (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 (t493 t501))
% 21.24/21.43 (step t503 (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.24/21.43 (step t504 (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 (t502 t503))
% 21.24/21.43 (step t505 (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 (t504))
% 21.24/21.43 (step t506 (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 (t467 t492 t505))
% 21.24/21.43 (step t507 (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 (t506))
% 21.24/21.43 (step t508 (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.24/21.43 (step t509 (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.24/21.43 (step t510 (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.24/21.43 (step t511 (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.24/21.43 (step t512 (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 (t507 t508 t509 t510 t511))
% 21.24/21.43 (step t513 (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 (t512))
% 21.24/21.43 (step t514 (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 (t464 t466 t513))
% 21.24/21.43 (step t515 (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 (t514))
% 21.24/21.43 (step t516 (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 (t515))
% 21.24/21.43 (step t517 (cl (not (= (or (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5))))) (not (or (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5)))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule equiv_pos2)
% 21.24/21.43 (step t518 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t210))
% 21.24/21.43 (step t519 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.43 (step t520 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t518 t519))
% 21.24/21.43 (step t521 (cl (= (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule cong :premises (t520))
% 21.24/21.43 (step t522 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t210))
% 21.24/21.43 (step t523 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t522 t519))
% 21.24/21.43 (step t524 (cl (= (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule cong :premises (t523))
% 21.24/21.43 (step t525 (cl (= (or (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule cong :premises (t521 t524))
% 21.24/21.43 (step t526 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t517 t525 a193))
% 21.24/21.43 (step t527 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule or :premises (t526))
% 21.24/21.43 (step t528 (cl (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule reordering :premises (t527))
% 21.24/21.43 (step t529 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.nil tptp.sk3)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t463 t516 t528))
% 21.24/21.43 (step t530 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule contraction :premises (t529))
% 21.24/21.43 (step t531 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t530))
% 21.24/21.43 (step t532 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t323 t13 t142 a188 a7 t324 t531 t528))
% 21.24/21.43 (step t533 (cl (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule contraction :premises (t532))
% 21.24/21.43 (step t534 (cl (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t219 t533))
% 21.24/21.43 (step t535 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t131 t13 t142 a188 a7 t207 t534 t533))
% 21.24/21.43 (step t536 (cl (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t535))
% 21.24/21.43 (step t537 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t14 t536))
% 21.24/21.43 (step t538 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t13 t537 a7 a188 t142))
% 21.24/21.43 (step t539 (cl (tptp.ssList tptp.sk7)) :rule resolution :premises (t11 t538))
% 21.24/21.43 (step t540 (cl (tptp.ssItem tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a195))
% 21.24/21.43 (step t541 (cl (tptp.ssItem tptp.sk6)) :rule resolution :premises (t540 t538))
% 21.24/21.43 (step t542 (cl (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t109 a7 t541 t119))
% 21.24/21.43 (step t543 (cl (not (or (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)) :rule or_pos)
% 21.24/21.43 (step t544 (cl (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (not (or (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule reordering :premises (t543))
% 21.24/21.43 (step t545 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule and_neg)
% 21.24/21.43 (step t546 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t547)
% 21.24/21.43 (assume t547.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.43 (assume t547.a1 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.43 (assume t547.a2 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))
% 21.24/21.43 (assume t547.a3 (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))
% 21.24/21.43 (step t547.t1 (cl (=> (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t547.t2)
% 21.24/21.43 (assume t547.t2.a0 (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))
% 21.24/21.43 (assume t547.t2.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))
% 21.24/21.43 (assume t547.t2.a2 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))))
% 21.24/21.43 (assume t547.t2.a3 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.43 (step t547.t2.t1 (cl (= (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) true) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule equiv_simplify)
% 21.24/21.43 (step t547.t2.t2 (cl (not (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) true)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule equiv1 :premises (t547.t2.t1))
% 21.24/21.43 (step t547.t2.t3 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4)) :rule symm :premises (t547.t2.a3))
% 21.24/21.43 (step t547.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule symm :premises (t547.t2.t3))
% 21.24/21.43 (step t547.t2.t5 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 21.24/21.43 (step t547.t2.t6 (cl (= (tptp.app tptp.sk4 tptp.sk7) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule cong :premises (t547.t2.t4 t547.t2.t5))
% 21.24/21.43 (step t547.t2.t7 (cl (= (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule symm :premises (t547.t2.a2))
% 21.24/21.43 (step t547.t2.t8 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule symm :premises (t547.t2.t7))
% 21.24/21.43 (step t547.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7) tptp.sk3)) :rule symm :premises (t547.t2.a1))
% 21.24/21.43 (step t547.t2.t10 (cl (= (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (tptp.app tptp.sk7 tptp.sk3))) :rule cong :premises (t547.t2.t5 t547.t2.t9))
% 21.24/21.43 (step t547.t2.t11 (cl (= (tptp.app tptp.sk4 tptp.sk7) (tptp.app tptp.sk7 tptp.sk3))) :rule trans :premises (t547.t2.t6 t547.t2.t8 t547.t2.t10))
% 21.24/21.43 (step t547.t2.t12 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.43 (step t547.t2.t13 (cl (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule cong :premises (t547.t2.t11 t547.t2.t12))
% 21.24/21.43 (step t547.t2.t14 (cl (= (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) true) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule equiv_simplify)
% 21.24/21.43 (step t547.t2.t15 (cl (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) true) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule equiv2 :premises (t547.t2.t14))
% 21.24/21.43 (step t547.t2.t16 (cl (= (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) true)) :rule resolution :premises (t547.t2.t15 t547.t2.a0))
% 21.24/21.43 (step t547.t2.t17 (cl (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) true)) :rule trans :premises (t547.t2.t13 t547.t2.t16))
% 21.24/21.43 (step t547.t2.t18 (cl (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule resolution :premises (t547.t2.t2 t547.t2.t17))
% 21.24/21.43 (step t547.t2 (cl (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule subproof :discharge (t547.t2.a0 t547.t2.a1 t547.t2.a2 t547.t2.a3))
% 21.24/21.43 (step t547.t3 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule and_pos)
% 21.24/21.43 (step t547.t4 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.43 (step t547.t5 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_pos)
% 21.24/21.43 (step t547.t6 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.43 (step t547.t7 (cl (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t547.t2 t547.t3 t547.t4 t547.t5 t547.t6))
% 21.24/21.43 (step t547.t8 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule reordering :premises (t547.t7))
% 21.24/21.43 (step t547.t9 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule contraction :premises (t547.t8))
% 21.24/21.43 (step t547.t10 (cl (=> (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule resolution :premises (t547.t1 t547.t9))
% 21.24/21.43 (step t547.t11 (cl (=> (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule implies_neg2)
% 21.24/21.43 (step t547.t12 (cl (=> (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (=> (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule resolution :premises (t547.t10 t547.t11))
% 21.24/21.43 (step t547.t13 (cl (=> (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule contraction :premises (t547.t12))
% 21.24/21.43 (step t547.t14 (cl (not (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule implies :premises (t547.t13))
% 21.24/21.43 (step t547.t15 (cl (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule and_neg)
% 21.24/21.43 (step t547.t16 (cl (and (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t547.t15 t547.a3 t547.a0 t547.a2 t547.a1))
% 21.24/21.43 (step t547.t17 (cl (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule resolution :premises (t547.t14 t547.t16))
% 21.24/21.43 (step t547 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule subproof :discharge (t547.a0 t547.a1 t547.a2 t547.a3))
% 21.24/21.43 (step t548 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule and_pos)
% 21.24/21.43 (step t549 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.43 (step t550 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule and_pos)
% 21.24/21.43 (step t551 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule and_pos)
% 21.24/21.43 (step t552 (cl (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)))) :rule resolution :premises (t547 t548 t549 t550 t551))
% 21.24/21.43 (step t553 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule reordering :premises (t552))
% 21.24/21.43 (step t554 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule contraction :premises (t553))
% 21.24/21.43 (step t555 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule resolution :premises (t546 t554))
% 21.24/21.43 (step t556 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule implies_neg2)
% 21.24/21.43 (step t557 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule resolution :premises (t555 t556))
% 21.24/21.43 (step t558 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5))) :rule contraction :premises (t557))
% 21.24/21.43 (step t559 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule implies :premises (t558))
% 21.24/21.43 (step t560 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule resolution :premises (t545 t559))
% 21.24/21.43 (step t561 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) (not (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule reordering :premises (t560))
% 21.24/21.43 (step t562 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7))) :rule resolution :premises (t126 t538))
% 21.24/21.43 (step t563 (cl (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t320 t538))
% 21.24/21.43 (step t564 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk7)))) :rule resolution :premises (t258 t539 t542 t266))
% 21.24/21.43 (step t565 (cl (not (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule or_pos)
% 21.24/21.43 (step t566 (cl (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk7)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5) (not (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)))) :rule reordering :premises (t565))
% 21.24/21.43 (step t567 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (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)))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t568)
% 21.24/21.43 (assume t568.a0 (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.24/21.43 (step t568.t1 (cl (or (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk5) (:= W tptp.sk7)))
% 21.24/21.43 (step t568.t2 (cl (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule or :premises (t568.t1))
% 21.24/21.43 (step t568.t3 (cl (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule resolution :premises (t568.t2 t568.a0))
% 21.24/21.43 (step t568 (cl (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule subproof :discharge (t568.a0))
% 21.24/21.43 (step t569 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule resolution :premises (t567 t568))
% 21.24/21.43 (step t570 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (not (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.43 (step t571 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)))) :rule resolution :premises (t569 t570))
% 21.24/21.43 (step t572 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)))) :rule contraction :premises (t571))
% 21.24/21.43 (step t573 (cl (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule implies :premises (t572))
% 21.24/21.43 (step t574 (cl (or (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5))) :rule resolution :premises (t573 a140))
% 21.24/21.43 (step t575 (cl (tptp.memberP (tptp.app tptp.sk7 tptp.sk3) tptp.sk5)) :rule resolution :premises (t566 t534 a187 a191 t539 t574))
% 21.24/21.43 (step t576 (cl (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) :rule resolution :premises (t561 t562 t563 t564 t575))
% 21.24/21.43 (step t577 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 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.24/21.43 (anchor :step t578)
% 21.24/21.43 (assume t578.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.24/21.43 (step t578.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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk7) (:= W tptp.sk5)))
% 21.24/21.43 (step t578.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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule or :premises (t578.t1))
% 21.24/21.43 (step t578.t3 (cl (or (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t578.t2 t578.a0))
% 21.24/21.43 (step t578 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule subproof :discharge (t578.a0))
% 21.24/21.43 (step t579 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) (or (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t577 t578))
% 21.24/21.43 (step t580 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) (not (or (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule implies_neg2)
% 21.24/21.43 (step t581 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule resolution :premises (t579 t580))
% 21.24/21.43 (step t582 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule contraction :premises (t581))
% 21.24/21.43 (step t583 (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.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule implies :premises (t582))
% 21.24/21.43 (step t584 (cl (or (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk7) tptp.sk5)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk7 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t583 a157))
% 21.24/21.43 (step t585 (cl (tptp.memberP tptp.sk7 tptp.sk5)) :rule resolution :premises (t544 t533 a188 a191 t539 t576 t584))
% 21.24/21.43 (step t586 (cl (not (= (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))))) (not (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule equiv_pos2)
% 21.24/21.43 (step t587 (cl (= (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule refl)
% 21.24/21.43 (step t588 (cl (= (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))))) :rule cong :premises (t390 t156 t587))
% 21.24/21.43 (step t589 (cl (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule and_neg)
% 21.24/21.43 (step t590 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t591)
% 21.24/21.43 (assume t591.a0 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.43 (assume t591.a1 (not (tptp.memberP tptp.sk4 tptp.sk5)))
% 21.24/21.43 (step t591.t1 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg1)
% 21.24/21.43 (anchor :step t591.t2)
% 21.24/21.43 (assume t591.t2.a0 (not (tptp.memberP tptp.sk4 tptp.sk5)))
% 21.24/21.43 (assume t591.t2.a1 (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))
% 21.24/21.43 (step t591.t2.t1 (cl (= (= (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5) false) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.43 (step t591.t2.t2 (cl (not (= (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5) false)) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule equiv1 :premises (t591.t2.t1))
% 21.24/21.43 (step t591.t2.t3 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4)) :rule symm :premises (t591.t2.a1))
% 21.24/21.43 (step t591.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule symm :premises (t591.t2.t3))
% 21.24/21.43 (step t591.t2.t5 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk4)) :rule symm :premises (t591.t2.t4))
% 21.24/21.43 (step t591.t2.t6 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 21.24/21.43 (step t591.t2.t7 (cl (= (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t591.t2.t5 t591.t2.t6))
% 21.24/21.43 (step t591.t2.t8 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) false) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv_simplify)
% 21.24/21.43 (step t591.t2.t9 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv2 :premises (t591.t2.t8))
% 21.24/21.43 (step t591.t2.t10 (cl (not (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule not_not)
% 21.24/21.43 (step t591.t2.t11 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false) (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t591.t2.t9 t591.t2.t10))
% 21.24/21.43 (step t591.t2.t12 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false)) :rule resolution :premises (t591.t2.t11 t591.t2.a0))
% 21.24/21.43 (step t591.t2.t13 (cl (= (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5) false)) :rule trans :premises (t591.t2.t7 t591.t2.t12))
% 21.24/21.43 (step t591.t2.t14 (cl (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t591.t2.t2 t591.t2.t13))
% 21.24/21.43 (step t591.t2 (cl (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule subproof :discharge (t591.t2.a0 t591.t2.a1))
% 21.24/21.43 (step t591.t3 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_pos)
% 21.24/21.43 (step t591.t4 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.43 (step t591.t5 (cl (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t591.t2 t591.t3 t591.t4))
% 21.24/21.43 (step t591.t6 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule reordering :premises (t591.t5))
% 21.24/21.43 (step t591.t7 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule contraction :premises (t591.t6))
% 21.24/21.43 (step t591.t8 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t591.t1 t591.t7))
% 21.24/21.43 (step t591.t9 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.43 (step t591.t10 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t591.t8 t591.t9))
% 21.24/21.43 (step t591.t11 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule contraction :premises (t591.t10))
% 21.24/21.43 (step t591.t12 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule implies :premises (t591.t11))
% 21.24/21.43 (step t591.t13 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule and_neg)
% 21.24/21.43 (step t591.t14 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t591.t13 t591.a1 t591.a0))
% 21.24/21.43 (step t591.t15 (cl (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t591.t12 t591.t14))
% 21.24/21.43 (step t591 (cl (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule subproof :discharge (t591.a0 t591.a1))
% 21.24/21.43 (step t592 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) :rule and_pos)
% 21.24/21.43 (step t593 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_pos)
% 21.24/21.43 (step t594 (cl (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)) (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule resolution :premises (t591 t592 t593))
% 21.24/21.43 (step t595 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule reordering :premises (t594))
% 21.24/21.43 (step t596 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule contraction :premises (t595))
% 21.24/21.43 (step t597 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t590 t596))
% 21.24/21.43 (step t598 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule implies_neg2)
% 21.24/21.43 (step t599 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (=> (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t597 t598))
% 21.24/21.43 (step t600 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule contraction :premises (t599))
% 21.24/21.43 (step t601 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule implies :premises (t600))
% 21.24/21.43 (step t602 (cl (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t589 t601))
% 21.24/21.43 (step t603 (cl (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))))) :rule or_neg)
% 21.24/21.43 (step t604 (cl (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (not (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule or_neg)
% 21.24/21.43 (step t605 (cl (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (not (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule or_neg)
% 21.24/21.43 (step t606 (cl (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t602 t603 t604 t605))
% 21.24/21.43 (step t607 (cl (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule contraction :premises (t606))
% 21.24/21.43 (step t608 (cl (or (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t586 t588 t607))
% 21.24/21.43 (step t609 (cl (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule or :premises (t608))
% 21.24/21.43 (step t610 (cl (tptp.memberP tptp.sk4 tptp.sk5) (not (= tptp.sk4 (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule reordering :premises (t609))
% 21.24/21.43 (step t611 (cl (not (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5))) :rule resolution :premises (t610 t533 t563))
% 21.24/21.43 (step t612 (cl (not (or (not (tptp.memberP tptp.sk7 tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk7 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk5)))) :rule resolution :premises (t9 a191 t539 t542 t585 t611))
% 21.24/21.43 (step t613 (cl) :rule resolution :premises (t7 t612 a139))
% 21.24/21.43
% 21.24/21.43 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.ww9bemol6o/cvc5---1.0.5_22719.smt2
% 21.24/21.43 % cvc5---1.0.5 exiting
% 21.24/21.43 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------