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