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