TSTP Solution File: SWC343-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC343-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n027.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:37 EDT 2024
% Result : Unsatisfiable 25.63s 25.97s
% Output : Proof 25.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC343-1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n027.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 26 16:33:24 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.37/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.55/10.73 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.56/15.75 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.61/20.77 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.58/25.80 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 25.63/25.97 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.vEkJWBbVQ3/cvc5---1.0.5_29964.smt2
% 25.63/25.97 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.vEkJWBbVQ3/cvc5---1.0.5_29964.smt2
% 25.63/26.03 (assume a0 (tptp.equalelemsP tptp.nil))
% 25.63/26.03 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 25.63/26.03 (assume a2 (tptp.strictorderedP tptp.nil))
% 25.63/26.03 (assume a3 (tptp.totalorderedP tptp.nil))
% 25.63/26.03 (assume a4 (tptp.strictorderP tptp.nil))
% 25.63/26.03 (assume a5 (tptp.totalorderP tptp.nil))
% 25.63/26.03 (assume a6 (tptp.cyclefreeP tptp.nil))
% 25.63/26.03 (assume a7 (tptp.ssList tptp.nil))
% 25.63/26.03 (assume a8 (tptp.ssItem tptp.skac3))
% 25.63/26.03 (assume a9 (tptp.ssItem tptp.skac2))
% 25.63/26.03 (assume a10 (not (tptp.singletonP tptp.nil)))
% 25.63/26.03 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 25.63/26.03 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 25.63/26.03 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 25.63/26.03 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 25.63/26.03 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 25.63/26.03 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 25.63/26.03 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 25.63/26.03 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 25.63/26.03 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 25.63/26.03 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 25.63/26.03 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 25.63/26.03 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 25.63/26.03 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 25.63/26.03 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 25.63/26.03 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 25.63/26.03 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 25.63/26.03 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 25.63/26.03 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 25.63/26.03 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 25.63/26.03 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 25.63/26.03 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 25.63/26.03 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 25.63/26.03 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 25.63/26.03 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 25.63/26.03 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 25.63/26.03 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 25.63/26.03 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 25.63/26.03 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 25.63/26.03 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 25.63/26.03 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 25.63/26.03 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 25.63/26.03 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 25.63/26.03 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 25.63/26.03 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 25.63/26.03 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 25.63/26.03 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 25.63/26.03 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 25.63/26.03 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 25.63/26.03 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 25.63/26.03 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 25.63/26.03 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 25.63/26.03 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 25.63/26.03 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 25.63/26.03 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 25.63/26.03 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 25.63/26.03 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.63/26.03 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 25.63/26.03 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 25.63/26.03 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 25.63/26.03 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 25.63/26.03 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 25.63/26.03 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 25.63/26.03 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 25.63/26.03 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 25.63/26.03 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 25.63/26.03 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 25.63/26.03 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 25.63/26.03 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 25.63/26.03 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 25.63/26.03 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 25.63/26.03 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 25.63/26.03 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 25.63/26.03 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.63/26.03 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 25.63/26.03 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.63/26.03 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 25.63/26.03 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.63/26.03 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 25.63/26.03 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 25.63/26.03 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 25.63/26.03 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 25.63/26.03 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 25.63/26.03 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 25.63/26.03 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 25.63/26.03 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 25.63/26.03 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 25.63/26.03 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 25.63/26.03 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 25.63/26.03 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 25.63/26.03 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 25.63/26.03 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.63/26.03 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.63/26.03 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 25.63/26.03 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 25.63/26.03 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 25.63/26.03 (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.63/26.03 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (assume a185 (tptp.ssList tptp.sk1))
% 25.63/26.03 (assume a186 (tptp.ssList tptp.sk2))
% 25.63/26.03 (assume a187 (tptp.ssList tptp.sk3))
% 25.63/26.03 (assume a188 (tptp.ssList tptp.sk4))
% 25.63/26.03 (assume a189 (= tptp.sk2 tptp.sk4))
% 25.63/26.03 (assume a190 (= tptp.sk1 tptp.sk3))
% 25.63/26.03 (assume a191 (tptp.ssList tptp.sk5))
% 25.63/26.03 (assume a192 (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4))
% 25.63/26.03 (assume a193 (tptp.strictorderedP tptp.sk3))
% 25.63/26.03 (assume a194 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))))
% 25.63/26.03 (assume a195 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 25.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (assume a200 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (assume a201 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (assume a202 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (assume a203 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 25.63/26.03 (assume a204 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (assume a205 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (assume a206 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (assume a207 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (assume a208 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (assume a209 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 25.63/26.03 (step t1 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t2)
% 25.63/26.03 (assume t2.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))
% 25.63/26.03 (step t2.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A (tptp.sk6 tptp.sk5)) (:= B (tptp.sk7 tptp.sk5)) (:= C (tptp.sk8 tptp.sk5)) (:= D (tptp.sk9 tptp.sk5))))
% 25.63/26.03 (step t2.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule or :premises (t2.t1))
% 25.63/26.03 (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2.t2 t2.a0))
% 25.63/26.03 (step t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t2.a0))
% 25.63/26.03 (step t3 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1 t2))
% 25.63/26.03 (step t4 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 25.63/26.03 (step t5 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3 t4))
% 25.63/26.03 (step t6 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t5))
% 25.63/26.03 (step t7 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule implies :premises (t6))
% 25.63/26.03 (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule or_pos)
% 25.63/26.03 (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))) (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t8))
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (step t14 (cl (= (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk5)))) :rule refl)
% 25.63/26.03 (step t15 (cl (= (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5)) true)) :rule all_simplify)
% 25.63/26.03 (step t16 (cl (= (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (not true))) :rule cong :premises (t15))
% 25.63/26.03 (step t17 (cl (= (not true) false)) :rule all_simplify)
% 25.63/26.03 (step t18 (cl (= (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) false)) :rule trans :premises (t16 t17))
% 25.63/26.03 (step t19 (cl (= (tptp.ssItem (tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk6 tptp.sk5)))) :rule refl)
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (anchor :step t25)
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.63/26.03 (anchor :step t33 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t33.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t33.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t33.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (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.63/26.03 (step t33.t5 (cl (= (tptp.ssItem (tptp.sk6 A)) (tptp.ssItem (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t33.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t33.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t33.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk6 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t33.t2 t33.t4 t33.t5 t33.t6 t33.t7))
% 25.63/26.03 (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.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.63/26.03 (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.63/26.03 (step t37 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (a192))
% 25.63/26.03 (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.63/26.03 (step t39 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t40 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t39))
% 25.63/26.03 (step t41 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t40))
% 25.63/26.03 (step t42 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t43 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t42 t39))
% 25.63/26.03 (anchor :step t44 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t44.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t44.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t44.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t44.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t44.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t44.t3 t44.t4))
% 25.63/26.03 (step t44.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t44.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t39 t44.t6))
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (step t44.t10 (cl (= (tptp.ssItem (tptp.sk6 A)) (tptp.ssItem (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (step t45 (cl (= (or (not (tptp.strictorderedP 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.strictorderedP 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.63/26.03 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.63/26.03 (step t47 (cl (or (not (tptp.strictorderedP 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.63/26.03 (step t48 (cl (not (tptp.strictorderedP 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.63/26.03 (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.strictorderedP tptp.sk3))) :rule reordering :premises (t48))
% 25.63/26.03 (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.63/26.03 (step t51 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t52 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t53 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t51 t52))
% 25.63/26.03 (step t54 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 25.63/26.03 (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.63/26.03 (step t56 (cl (or (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t50 t55 a195))
% 25.63/26.03 (step t57 (cl (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)) (not (= tptp.nil tptp.sk3))) :rule or :premises (t56))
% 25.63/26.03 (step t58 (cl (not (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t57))
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (anchor :step t61)
% 25.63/26.03 (assume t61.a0 (= tptp.nil tptp.sk5))
% 25.63/26.03 (assume t61.a1 (= tptp.nil (tptp.app (tptp.cons (tptp.sk6 tptp.nil) tptp.nil) (tptp.sk7 tptp.nil))))
% 25.63/26.03 (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.63/26.03 (anchor :step t61.t2)
% 25.63/26.03 (assume t61.t2.a0 (= tptp.nil (tptp.app (tptp.cons (tptp.sk6 tptp.nil) tptp.nil) (tptp.sk7 tptp.nil))))
% 25.63/26.03 (assume t61.t2.a1 (= tptp.nil tptp.sk5))
% 25.63/26.03 (step t61.t2.t1 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t61.t2.a1))
% 25.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.63/26.03 (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) :rule or_pos)
% 25.63/26.03 (step t74 (cl (not (tptp.ssItem (tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.sk7 tptp.nil))) (not (tptp.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))))) :rule reordering :premises (t73))
% 25.63/26.03 (step t75 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t76)
% 25.63/26.03 (assume t76.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))
% 25.63/26.03 (step t76.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))))) :rule forall_inst :args ((:= A (tptp.sk6 tptp.nil)) (:= B (tptp.sk7 tptp.nil)) (:= C (tptp.sk8 tptp.nil)) (:= D (tptp.sk9 tptp.nil))))
% 25.63/26.03 (step t76.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule or :premises (t76.t1))
% 25.63/26.03 (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule resolution :premises (t76.t2 t76.a0))
% 25.63/26.03 (step t76 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule subproof :discharge (t76.a0))
% 25.63/26.03 (step t77 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule resolution :premises (t75 t76))
% 25.63/26.03 (step t78 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))))) :rule implies_neg2)
% 25.63/26.03 (step t79 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))))) :rule resolution :premises (t77 t78))
% 25.63/26.03 (step t80 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))))) :rule contraction :premises (t79))
% 25.63/26.03 (step t81 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule implies :premises (t80))
% 25.63/26.03 (step t82 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t83 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 25.63/26.03 (step t83.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t83.t2 (cl (= B B)) :rule refl)
% 25.63/26.03 (step t83.t3 (cl (= C C)) :rule refl)
% 25.63/26.03 (step t83.t4 (cl (= D D)) :rule refl)
% 25.63/26.03 (step t83.t5 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 25.63/26.03 (step t83.t6 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 25.63/26.03 (step t83.t7 (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.63/26.03 (step t83.t8 (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.t7))
% 25.63/26.03 (step t83.t9 (cl (= (not (tptp.ssItem C)) (not (tptp.ssItem C)))) :rule refl)
% 25.63/26.03 (step t83.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 25.63/26.03 (step t83.t11 (cl (= (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil))))) :rule all_simplify)
% 25.63/26.03 (step t83.t12 (cl (= (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))))) :rule cong :premises (t83.t11))
% 25.63/26.03 (step t83.t13 (cl (= (not (tptp.lt C A)) (not (tptp.lt C A)))) :rule refl)
% 25.63/26.03 (step t83.t14 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule cong :premises (t83.t5 t83.t6 t83.t8 t83.t9 t83.t10 t83.t12 t83.t13))
% 25.63/26.03 (step t83 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))) :rule bind)
% 25.63/26.03 (step t84 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule resolution :premises (t82 t83 a194))
% 25.63/26.03 (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.ssItem (tptp.sk8 tptp.nil))) (not (tptp.ssList (tptp.sk9 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule resolution :premises (t81 t84))
% 25.63/26.03 (step t86 (cl (not (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))) :rule or_pos)
% 25.63/26.03 (step t87 (cl (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (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.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule reordering :premises (t86))
% 25.63/26.03 (step t88 (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.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))) :rule or_pos)
% 25.63/26.03 (step t89 (cl (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))))) :rule reordering :premises (t88))
% 25.63/26.03 (step t90 (cl (not (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil))) :rule or_pos)
% 25.63/26.03 (step t91 (cl (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 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.sk9 tptp.nil))))) :rule reordering :premises (t90))
% 25.63/26.03 (step t92 (cl (not (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil))) :rule or_pos)
% 25.63/26.03 (step t93 (cl (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (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.ssItem (tptp.sk8 tptp.nil))))) :rule reordering :premises (t92))
% 25.63/26.03 (step t94 (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.63/26.03 (step t95 (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 (t94))
% 25.63/26.03 (step t96 (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.63/26.03 (step t97 (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 (t96))
% 25.63/26.03 (step t98 (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.63/26.03 (step t99 (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 (t98))
% 25.63/26.03 (step t100 (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.lt (tptp.sk8 tptp.nil) (tptp.sk6 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.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 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.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 t97 a7 t99 a7))
% 25.63/26.03 (step t101 (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.lt (tptp.sk8 tptp.nil) (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.sk3 (tptp.app (tptp.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 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.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 (t100))
% 25.63/26.03 (step t102 (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.63/26.03 (step t103 (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.63/26.03 (anchor :step t104)
% 25.63/26.03 (assume t104.a0 (= tptp.nil tptp.sk3))
% 25.63/26.03 (assume t104.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 25.63/26.03 (assume t104.a2 (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))
% 25.63/26.03 (step t104.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.63/26.03 (anchor :step t104.t2)
% 25.63/26.03 (assume t104.t2.a0 (= tptp.nil tptp.sk3))
% 25.63/26.03 (assume t104.t2.a1 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 25.63/26.03 (assume t104.t2.a2 (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))
% 25.63/26.03 (step t104.t2.t1 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.nil)) :rule symm :premises (t104.t2.a2))
% 25.63/26.03 (step t104.t2.t2 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t104.t2.a1))
% 25.63/26.03 (step t104.t2.t3 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t104.t2.t2))
% 25.63/26.03 (step t104.t2.t4 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t104.t2.a0))
% 25.63/26.03 (step t104.t2.t5 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t104.t2.t4))
% 25.63/26.03 (step t104.t2.t6 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t104.t2.t7 (cl (= (tptp.app tptp.nil tptp.nil) (tptp.app tptp.sk3 tptp.nil))) :rule cong :premises (t104.t2.t5 t104.t2.t6))
% 25.63/26.03 (step t104.t2.t8 (cl (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) :rule trans :premises (t104.t2.t1 t104.t2.t3 t104.t2.t7))
% 25.63/26.03 (step t104.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 (t104.t2.a0 t104.t2.a1 t104.t2.a2))
% 25.63/26.03 (step t104.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.63/26.03 (step t104.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.63/26.03 (step t104.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.63/26.03 (step t104.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 (t104.t2 t104.t3 t104.t4 t104.t5))
% 25.63/26.03 (step t104.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 (t104.t6))
% 25.63/26.03 (step t104.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 (t104.t7))
% 25.63/26.03 (step t104.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 (t104.t1 t104.t8))
% 25.63/26.03 (step t104.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.63/26.03 (step t104.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 (t104.t9 t104.t10))
% 25.63/26.03 (step t104.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 (t104.t11))
% 25.63/26.03 (step t104.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 (t104.t12))
% 25.63/26.03 (step t104.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.63/26.03 (step t104.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 (t104.t14 t104.a0 t104.a1 t104.a2))
% 25.63/26.03 (step t104.t16 (cl (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) :rule resolution :premises (t104.t13 t104.t15))
% 25.63/26.03 (step t104 (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 (t104.a0 t104.a1 t104.a2))
% 25.63/26.03 (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)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 25.63/26.03 (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.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 25.63/26.03 (step t107 (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.63/26.03 (step t108 (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 (t104 t105 t106 t107))
% 25.63/26.03 (step t109 (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 (t108))
% 25.63/26.03 (step t110 (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 (t109))
% 25.63/26.03 (step t111 (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 (t103 t110))
% 25.63/26.03 (step t112 (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.63/26.03 (step t113 (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 (t111 t112))
% 25.63/26.03 (step t114 (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 (t113))
% 25.63/26.03 (step t115 (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 (t114))
% 25.63/26.03 (step t116 (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 (t102 t115))
% 25.63/26.03 (step t117 (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.63/26.03 (anchor :step t118 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.63/26.03 (step t118.t1 (cl (= U U)) :rule refl)
% 25.63/26.03 (step t118.t2 (cl (= V V)) :rule refl)
% 25.63/26.03 (step t118.t3 (cl (= (not (= tptp.nil U)) (not (= tptp.nil U)))) :rule refl)
% 25.63/26.03 (step t118.t4 (cl (= (not (= tptp.nil V)) (not (= tptp.nil V)))) :rule refl)
% 25.63/26.03 (step t118.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.63/26.03 (step t118.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.63/26.03 (step t118.t7 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 25.63/26.03 (step t118.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 (t118.t3 t118.t4 t118.t5 t118.t6 t118.t7))
% 25.63/26.03 (step t118 (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.63/26.03 (step t119 (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.63/26.03 (step t120 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 25.63/26.03 (step t121 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t120))
% 25.63/26.03 (step t122 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t121 t17))
% 25.63/26.03 (step t123 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 25.63/26.03 (step t124 (cl (= (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule refl)
% 25.63/26.03 (step t125 (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 (t122 t122 t123 t123 t124))
% 25.63/26.03 (step t126 (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.63/26.03 (step t127 (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 (t125 t126))
% 25.63/26.03 (step t128 (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 (t119 t127))
% 25.63/26.03 (step t129 (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 (t118 t128))
% 25.63/26.03 (step t130 (cl (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t117 t129 a144))
% 25.63/26.03 (step t131 (cl (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule or :premises (t130))
% 25.63/26.03 (step t132 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t131 a7))
% 25.63/26.03 (step t133 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (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.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t134)
% 25.63/26.03 (assume t134.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))))
% 25.63/26.03 (step t134.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.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= A tptp.nil)))
% 25.63/26.03 (step t134.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) :rule or :premises (t134.t1))
% 25.63/26.03 (step t134.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) :rule resolution :premises (t134.t2 t134.a0))
% 25.63/26.03 (step t134 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) :rule subproof :discharge (t134.a0))
% 25.63/26.03 (step t135 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) :rule resolution :premises (t133 t134))
% 25.63/26.03 (step t136 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (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.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 25.63/26.03 (step t137 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule resolution :premises (t135 t136))
% 25.63/26.03 (step t138 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil))))) :rule contraction :premises (t137))
% 25.63/26.03 (step t139 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.lt (tptp.sk8 tptp.nil) (tptp.sk6 tptp.nil)))) :rule implies :premises (t138))
% 25.63/26.03 (step t140 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t141)
% 25.63/26.03 (assume t141.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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))
% 25.63/26.03 (step t141.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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.nil)))
% 25.63/26.03 (step t141.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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil))))) :rule or :premises (t141.t1))
% 25.63/26.03 (step t141.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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil))))) :rule resolution :premises (t141.t2 t141.a0))
% 25.63/26.03 (step t141 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil))))) :rule subproof :discharge (t141.a0))
% 25.63/26.03 (step t142 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil))))) :rule resolution :premises (t140 t141))
% 25.63/26.03 (step t143 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))))) :rule implies_neg2)
% 25.63/26.03 (step t144 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))))) :rule resolution :premises (t142 t143))
% 25.63/26.03 (step t145 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil)))))) :rule contraction :premises (t144))
% 25.63/26.03 (step t146 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.nil) (tptp.cons (tptp.sk8 tptp.nil) tptp.nil))))) :rule implies :premises (t145))
% 25.63/26.03 (step t147 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 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.sk9 A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t148)
% 25.63/26.03 (assume t148.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))))
% 25.63/26.03 (step t148.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.sk9 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil))))) :rule forall_inst :args ((:= A tptp.nil)))
% 25.63/26.03 (step t148.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.sk9 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) :rule or :premises (t148.t1))
% 25.63/26.03 (step t148.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) :rule resolution :premises (t148.t2 t148.a0))
% 25.63/26.03 (step t148 (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.sk9 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) :rule subproof :discharge (t148.a0))
% 25.63/26.03 (step t149 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) :rule resolution :premises (t147 t148))
% 25.63/26.03 (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.sk9 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 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.sk9 tptp.nil))))) :rule implies_neg2)
% 25.63/26.03 (step t151 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 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.sk9 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil))))) :rule resolution :premises (t149 t150))
% 25.63/26.03 (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.sk9 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil))))) :rule contraction :premises (t151))
% 25.63/26.03 (step t153 (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.sk9 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssList (tptp.sk9 tptp.nil)))) :rule implies :premises (t152))
% 25.63/26.03 (step t154 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (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.ssItem (tptp.sk8 A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t155)
% 25.63/26.03 (assume t155.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))))
% 25.63/26.03 (step t155.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.sk8 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil))))) :rule forall_inst :args ((:= A tptp.nil)))
% 25.63/26.03 (step t155.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.sk8 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) :rule or :premises (t155.t1))
% 25.63/26.03 (step t155.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) :rule resolution :premises (t155.t2 t155.a0))
% 25.63/26.03 (step t155 (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.sk8 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) :rule subproof :discharge (t155.a0))
% 25.63/26.03 (step t156 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) :rule resolution :premises (t154 t155))
% 25.63/26.03 (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.sk8 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (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.ssItem (tptp.sk8 tptp.nil))))) :rule implies_neg2)
% 25.63/26.03 (step t158 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil))))) :rule resolution :premises (t156 t157))
% 25.63/26.03 (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.sk8 A)))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil))))) :rule contraction :premises (t158))
% 25.63/26.03 (step t160 (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.sk8 A))))) (or (not (tptp.ssList tptp.nil)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.nil))) (tptp.ssItem (tptp.sk8 tptp.nil)))) :rule implies :premises (t159))
% 25.63/26.03 (step t161 (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.63/26.03 (anchor :step t162)
% 25.63/26.03 (assume t162.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.63/26.03 (step t162.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.63/26.03 (step t162.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 (t162.t1))
% 25.63/26.03 (step t162.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 (t162.t2 t162.a0))
% 25.63/26.03 (step t162 (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 (t162.a0))
% 25.63/26.03 (step t163 (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 (t161 t162))
% 25.63/26.03 (step t164 (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.63/26.03 (step t165 (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 (t163 t164))
% 25.63/26.03 (step t166 (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 (t165))
% 25.63/26.03 (step t167 (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 (t166))
% 25.63/26.03 (step t168 (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.63/26.03 (anchor :step t169)
% 25.63/26.03 (assume t169.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.63/26.03 (step t169.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.63/26.03 (step t169.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 (t169.t1))
% 25.63/26.03 (step t169.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 (t169.t2 t169.a0))
% 25.63/26.03 (step t169 (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 (t169.a0))
% 25.63/26.03 (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)))) (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 (t168 t169))
% 25.63/26.03 (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)))) (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.63/26.03 (step t172 (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 (t170 t171))
% 25.63/26.03 (step t173 (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 (t172))
% 25.63/26.03 (step t174 (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 (t173))
% 25.63/26.03 (step t175 (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.63/26.03 (anchor :step t176)
% 25.63/26.03 (assume t176.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.63/26.03 (step t176.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.63/26.03 (step t176.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 (t176.t1))
% 25.63/26.03 (step t176.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 (t176.t2 t176.a0))
% 25.63/26.03 (step t176 (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 (t176.a0))
% 25.63/26.03 (step t177 (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 (t175 t176))
% 25.63/26.03 (step t178 (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.63/26.03 (step t179 (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 (t177 t178))
% 25.63/26.03 (step t180 (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 (t179))
% 25.63/26.03 (step t181 (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 (t180))
% 25.63/26.03 (step t182 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (= A A)))
% 25.63/26.03 (step t183 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (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.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule equiv2 :premises (t182))
% 25.63/26.03 (step t184 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) (= A A)))
% 25.63/26.03 (step t185 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule equiv2 :premises (t184))
% 25.63/26.03 (step t186 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 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.sk9 A)))) (= A A)))
% 25.63/26.03 (step t187 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 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.sk9 A)))))) :rule equiv2 :premises (t186))
% 25.63/26.03 (step t188 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (= A A)))
% 25.63/26.03 (step t189 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))))) :rule equiv2 :premises (t188))
% 25.63/26.03 (step t190 (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.63/26.03 (step t191 (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 (t190))
% 25.63/26.03 (step t192 (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.63/26.03 (step t193 (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 (t192))
% 25.63/26.03 (step t194 (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.63/26.03 (step t195 (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 (t194))
% 25.63/26.03 (step t196 (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.63/26.03 (step t197 (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 (t196))
% 25.63/26.03 (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 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.63/26.03 (anchor :step t199)
% 25.63/26.03 (assume t199.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.63/26.03 (step t199.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.63/26.03 (step t199.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 (t199.t1))
% 25.63/26.03 (step t199.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 (t199.t2 t199.a0))
% 25.63/26.03 (step t199 (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 (t199.a0))
% 25.63/26.03 (step t200 (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 (t198 t199))
% 25.63/26.03 (step t201 (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.63/26.03 (step t202 (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 (t200 t201))
% 25.63/26.03 (step t203 (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 (t202))
% 25.63/26.03 (step t204 (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 (t203))
% 25.63/26.03 (step t205 (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.63/26.03 (anchor :step t206 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.63/26.03 (step t206.t1 (cl (= U U)) :rule refl)
% 25.63/26.03 (step t206.t2 (cl (= V V)) :rule refl)
% 25.63/26.03 (step t206.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 25.63/26.03 (step t206.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t206.t3))
% 25.63/26.03 (step t206.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.63/26.03 (step t206.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.63/26.03 (step t206.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 25.63/26.03 (step t206.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 (t206.t4 t206.t5 t206.t6 t206.t7))
% 25.63/26.03 (step t206 (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.63/26.03 (step t207 (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 (t205 t206 a118))
% 25.63/26.03 (step t208 (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 (t204 t207))
% 25.63/26.03 (step t209 (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.63/26.03 (step t210 (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 (t209))
% 25.63/26.03 (step t211 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil 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.63/26.03 (anchor :step t212)
% 25.63/26.03 (assume t212.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.63/26.03 (step t212.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.63/26.03 (step t212.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 (t212.t1))
% 25.63/26.03 (step t212.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 (t212.t2 t212.a0))
% 25.63/26.03 (step t212 (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 (t212.a0))
% 25.63/26.03 (step t213 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil 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 (t211 t212))
% 25.63/26.03 (step t214 (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.63/26.03 (step t215 (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 (t213 t214))
% 25.63/26.03 (step t216 (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 (t215))
% 25.63/26.03 (step t217 (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 (t216))
% 25.63/26.03 (step t218 (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.63/26.03 (anchor :step t219 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.63/26.03 (step t219.t1 (cl (= U U)) :rule refl)
% 25.63/26.03 (step t219.t2 (cl (= V V)) :rule refl)
% 25.63/26.03 (step t219.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 25.63/26.03 (step t219.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t219.t3))
% 25.63/26.03 (step t219.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.63/26.03 (step t219.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.63/26.03 (step t219.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 25.63/26.03 (step t219.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 (t219.t4 t219.t5 t219.t6 t219.t7))
% 25.63/26.03 (step t219 (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.63/26.03 (step t220 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t218 t219 a117))
% 25.63/26.03 (step t221 (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 (t217 t220))
% 25.63/26.03 (step t222 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t223 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t223.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t223.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t223.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t223.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t223.t3))
% 25.63/26.03 (step t223.t5 (cl (= (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t223.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t223.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t223.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t223.t2 t223.t4 t223.t5 t223.t6 t223.t7))
% 25.63/26.03 (step t223 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t224 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule all_simplify)
% 25.63/26.03 (step t225 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule trans :premises (t223 t224))
% 25.63/26.03 (step t226 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t227 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t226))
% 25.63/26.03 (step t228 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t227))
% 25.63/26.03 (step t229 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t230 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t231 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t232 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t230 t231))
% 25.63/26.03 (step t233 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t229 t232))
% 25.63/26.03 (step t234 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t233))
% 25.63/26.03 (anchor :step t235 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t235.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t235.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t235.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t235.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t226 t235.t3))
% 25.63/26.03 (step t235.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t232 t235.t4))
% 25.63/26.03 (step t235.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 (t235.t5))
% 25.63/26.03 (step t235.t7 (cl (= (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t235.t8 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule cong :premises (t235.t2 t235.t6 t235.t7))
% 25.63/26.03 (step t235 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule bind)
% 25.63/26.03 (step t236 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule cong :premises (t228 t234 t235))
% 25.63/26.03 (step t237 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule trans :premises (t225 t236))
% 25.63/26.03 (step t238 (cl (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule resolution :premises (t222 t237 a209))
% 25.63/26.03 (step t239 (cl (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule or :premises (t238))
% 25.63/26.03 (step t240 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t241 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t241.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t241.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t241.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t241.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t241.t3))
% 25.63/26.03 (step t241.t5 (cl (= (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) :rule all_simplify)
% 25.63/26.03 (step t241.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t241.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t241.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t241.t2 t241.t4 t241.t5 t241.t6 t241.t7))
% 25.63/26.03 (step t241 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t242 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule all_simplify)
% 25.63/26.03 (step t243 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule trans :premises (t241 t242))
% 25.63/26.03 (step t244 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t245 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t244))
% 25.63/26.03 (step t246 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t245))
% 25.63/26.03 (step t247 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t248 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t249 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t250 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t248 t249))
% 25.63/26.03 (step t251 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t247 t250))
% 25.63/26.03 (step t252 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t251))
% 25.63/26.03 (anchor :step t253 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t253.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t253.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t253.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t253.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t244 t253.t3))
% 25.63/26.03 (step t253.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t250 t253.t4))
% 25.63/26.03 (step t253.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 (t253.t5))
% 25.63/26.03 (step t253.t7 (cl (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))) :rule refl)
% 25.63/26.03 (step t253.t8 (cl (= (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) :rule cong :premises (t244 t253.t7))
% 25.63/26.03 (step t253.t9 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule cong :premises (t253.t2 t253.t6 t253.t8))
% 25.63/26.03 (step t253 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule bind)
% 25.63/26.03 (step t254 (cl (= (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule cong :premises (t246 t252 t253))
% 25.63/26.03 (step t255 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule trans :premises (t243 t254))
% 25.63/26.03 (step t256 (cl (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule resolution :premises (t240 t255 a208))
% 25.63/26.03 (step t257 (cl (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule or :premises (t256))
% 25.63/26.03 (step t258 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.sk9 A)))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t259 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t259.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t259.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t259.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t259.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t259.t3))
% 25.63/26.03 (step t259.t5 (cl (= (tptp.ssList (tptp.sk9 A)) (tptp.ssList (tptp.sk9 A)))) :rule refl)
% 25.63/26.03 (step t259.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t259.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t259.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t259.t2 t259.t4 t259.t5 t259.t6 t259.t7))
% 25.63/26.03 (step t259 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP 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.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t260 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule all_simplify)
% 25.63/26.03 (step t261 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule trans :premises (t259 t260))
% 25.63/26.03 (step t262 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t263 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t262))
% 25.63/26.03 (step t264 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t263))
% 25.63/26.03 (step t265 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t266 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t267 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t268 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t266 t267))
% 25.63/26.03 (step t269 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t265 t268))
% 25.63/26.03 (step t270 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t269))
% 25.63/26.03 (anchor :step t271 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t271.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t271.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t271.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t271.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t262 t271.t3))
% 25.63/26.03 (step t271.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t268 t271.t4))
% 25.63/26.03 (step t271.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 (t271.t5))
% 25.63/26.03 (step t271.t7 (cl (= (tptp.ssList (tptp.sk9 A)) (tptp.ssList (tptp.sk9 A)))) :rule refl)
% 25.63/26.03 (step t271.t8 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A))) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A))))) :rule cong :premises (t271.t2 t271.t6 t271.t7))
% 25.63/26.03 (step t271 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))))) :rule bind)
% 25.63/26.03 (step t272 (cl (= (or (not (tptp.strictorderedP 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.sk9 A))))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule cong :premises (t264 t270 t271))
% 25.63/26.03 (step t273 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule trans :premises (t261 t272))
% 25.63/26.03 (step t274 (cl (or (not (tptp.strictorderedP 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.sk9 A)))))) :rule resolution :premises (t258 t273 a207))
% 25.63/26.03 (step t275 (cl (not (tptp.strictorderedP 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.sk9 A))))) :rule or :premises (t274))
% 25.63/26.03 (step t276 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk8 A))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.sk8 A)))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t277 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t277.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t277.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t277.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t277.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t277.t3))
% 25.63/26.03 (step t277.t5 (cl (= (tptp.ssItem (tptp.sk8 A)) (tptp.ssItem (tptp.sk8 A)))) :rule refl)
% 25.63/26.03 (step t277.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t277.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t277.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t277.t2 t277.t4 t277.t5 t277.t6 t277.t7))
% 25.63/26.03 (step t277 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP 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.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t278 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule all_simplify)
% 25.63/26.03 (step t279 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule trans :premises (t277 t278))
% 25.63/26.03 (step t280 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t281 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t280))
% 25.63/26.03 (step t282 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t281))
% 25.63/26.03 (step t283 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t284 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t285 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t286 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t284 t285))
% 25.63/26.03 (step t287 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t283 t286))
% 25.63/26.03 (step t288 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t287))
% 25.63/26.03 (anchor :step t289 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t289.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t289.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t289.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t289.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t280 t289.t3))
% 25.63/26.03 (step t289.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t286 t289.t4))
% 25.63/26.03 (step t289.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 (t289.t5))
% 25.63/26.03 (step t289.t7 (cl (= (tptp.ssItem (tptp.sk8 A)) (tptp.ssItem (tptp.sk8 A)))) :rule refl)
% 25.63/26.03 (step t289.t8 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A))) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A))))) :rule cong :premises (t289.t2 t289.t6 t289.t7))
% 25.63/26.03 (step t289 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))))) :rule bind)
% 25.63/26.03 (step t290 (cl (= (or (not (tptp.strictorderedP 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.sk8 A))))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule cong :premises (t282 t288 t289))
% 25.63/26.03 (step t291 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule trans :premises (t279 t290))
% 25.63/26.03 (step t292 (cl (or (not (tptp.strictorderedP 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.sk8 A)))))) :rule resolution :premises (t276 t291 a206))
% 25.63/26.03 (step t293 (cl (not (tptp.strictorderedP 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.sk8 A))))) :rule or :premises (t292))
% 25.63/26.03 (step t294 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.63/26.03 (anchor :step t295 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t295.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t295.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t295.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t295.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t295.t3))
% 25.63/26.03 (step t295.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.63/26.03 (step t295.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t295.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t295.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.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t295.t2 t295.t4 t295.t5 t295.t6 t295.t7))
% 25.63/26.03 (step t295 (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.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t296 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.63/26.03 (step t297 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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 (t295 t296))
% 25.63/26.03 (step t298 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t299 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t298))
% 25.63/26.03 (step t300 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t299))
% 25.63/26.03 (step t301 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t302 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t303 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t304 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t302 t303))
% 25.63/26.03 (step t305 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t301 t304))
% 25.63/26.03 (step t306 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t305))
% 25.63/26.03 (anchor :step t307 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t307.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t307.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t307.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t307.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t298 t307.t3))
% 25.63/26.03 (step t307.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t304 t307.t4))
% 25.63/26.03 (step t307.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 (t307.t5))
% 25.63/26.03 (step t307.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.63/26.03 (step t307.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 (t307.t2 t307.t6 t307.t7))
% 25.63/26.03 (step t307 (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.63/26.03 (step t308 (cl (= (or (not (tptp.strictorderedP 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.strictorderedP 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 (t300 t306 t307))
% 25.63/26.03 (step t309 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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 (t297 t308))
% 25.63/26.03 (step t310 (cl (or (not (tptp.strictorderedP 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 (t294 t309 a205))
% 25.63/26.03 (step t311 (cl (not (tptp.strictorderedP 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 (t310))
% 25.63/26.03 (step t312 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.63/26.03 (anchor :step t313 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t313.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t313.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t313.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t313.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t313.t3))
% 25.63/26.03 (step t313.t5 (cl (= (tptp.ssList (tptp.sk7 A)) (tptp.ssList (tptp.sk7 A)))) :rule refl)
% 25.63/26.03 (step t313.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t313.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t313.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t313.t2 t313.t4 t313.t5 t313.t6 t313.t7))
% 25.63/26.03 (step t313 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t314 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.63/26.03 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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 (t313 t314))
% 25.63/26.03 (step t316 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t317 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t316))
% 25.63/26.03 (step t318 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t317))
% 25.63/26.03 (step t319 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t320 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t321 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t322 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t320 t321))
% 25.63/26.03 (step t323 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t319 t322))
% 25.63/26.03 (step t324 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t323))
% 25.63/26.03 (anchor :step t325 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t325.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t325.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t325.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t325.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t316 t325.t3))
% 25.63/26.03 (step t325.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t322 t325.t4))
% 25.63/26.03 (step t325.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 (t325.t5))
% 25.63/26.03 (step t325.t7 (cl (= (tptp.ssList (tptp.sk7 A)) (tptp.ssList (tptp.sk7 A)))) :rule refl)
% 25.63/26.03 (step t325.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 (t325.t2 t325.t6 t325.t7))
% 25.63/26.03 (step t325 (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.63/26.03 (step t326 (cl (= (or (not (tptp.strictorderedP 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.strictorderedP 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 (t318 t324 t325))
% 25.63/26.03 (step t327 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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 (t315 t326))
% 25.63/26.03 (step t328 (cl (or (not (tptp.strictorderedP 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 (t312 t327 a204))
% 25.63/26.03 (step t329 (cl (not (tptp.strictorderedP 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 (t328))
% 25.63/26.03 (step t330 (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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP 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.63/26.03 (anchor :step t331 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t331.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t331.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t331.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t331.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t331.t3))
% 25.63/26.03 (step t331.t5 (cl (= (tptp.ssItem (tptp.sk6 A)) (tptp.ssItem (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t331.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t331.t7 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 25.63/26.03 (step t331.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk6 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t331.t2 t331.t4 t331.t5 t331.t6 t331.t7))
% 25.63/26.03 (step t331 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk6 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 25.63/26.03 (step t332 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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.63/26.03 (step t333 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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 (t331 t332))
% 25.63/26.03 (step t334 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t335 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t334))
% 25.63/26.03 (step t336 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t335))
% 25.63/26.03 (step t337 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t338 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t339 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t340 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t338 t339))
% 25.63/26.03 (step t341 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule cong :premises (t337 t340))
% 25.63/26.03 (step t342 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))))) :rule cong :premises (t341))
% 25.63/26.03 (anchor :step t343 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t343.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t343.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t343.t3 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t343.t4 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t334 t343.t3))
% 25.63/26.03 (step t343.t5 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t340 t343.t4))
% 25.63/26.03 (step t343.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 (t343.t5))
% 25.63/26.03 (step t343.t7 (cl (= (tptp.ssItem (tptp.sk6 A)) (tptp.ssItem (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t343.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 (t343.t2 t343.t6 t343.t7))
% 25.63/26.03 (step t343 (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.63/26.03 (step t344 (cl (= (or (not (tptp.strictorderedP 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.strictorderedP 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 (t336 t342 t343))
% 25.63/26.03 (step t345 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP 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 (t333 t344))
% 25.63/26.03 (step t346 (cl (or (not (tptp.strictorderedP 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 (t330 t345 a197))
% 25.63/26.03 (step t347 (cl (not (tptp.strictorderedP 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 (t346))
% 25.63/26.03 (step t348 (cl (not (tptp.strictorderedP 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 (t347))
% 25.63/26.03 (step t349 (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))) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t101 t116 t132 t139 t146 t153 t160 t167 t174 t181 t183 t185 t187 t189 t191 t193 t195 t197 t208 a191 a187 t210 t221 a191 a187 t239 a193 t257 a193 t275 a193 t293 a193 t311 a193 t329 a193 t348 a193))
% 25.63/26.03 (step t350 (cl (not (= tptp.nil (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t349))
% 25.63/26.03 (step t351 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t58 t350))
% 25.63/26.03 (step t352 (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 t351 a193))
% 25.63/26.03 (step t353 (cl (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk6 tptp.sk5)))) :rule resolution :premises (t31 t352))
% 25.63/26.03 (step t354 (cl (tptp.ssItem (tptp.sk6 tptp.sk5))) :rule resolution :premises (t11 a191 t353))
% 25.63/26.03 (step t355 (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.63/26.03 (step t356 (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 (t355))
% 25.63/26.03 (step t357 (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.63/26.03 (step t358 (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.63/26.03 (step t359 (cl (= (tptp.ssList (tptp.sk7 tptp.sk5)) (tptp.ssList (tptp.sk7 tptp.sk5)))) :rule refl)
% 25.63/26.03 (step t360 (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 t359))
% 25.63/26.03 (step t361 (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.63/26.03 (step t362 (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 (t360 t361))
% 25.63/26.03 (step t363 (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 (t358 t362))
% 25.63/26.03 (step t364 (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.63/26.03 (anchor :step t365)
% 25.63/26.03 (assume t365.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.63/26.03 (step t365.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.63/26.03 (step t365.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 (t365.t1))
% 25.63/26.03 (step t365.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 (t365.t2 t365.a0))
% 25.63/26.03 (step t365 (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 (t365.a0))
% 25.63/26.03 (step t366 (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 (t364 t365))
% 25.63/26.03 (step t367 (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.63/26.03 (step t368 (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 (t366 t367))
% 25.63/26.03 (step t369 (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 (t368))
% 25.63/26.03 (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.sk7 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk7 tptp.sk5))))) :rule resolution :premises (t357 t363 t369))
% 25.63/26.03 (step t371 (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 (t370))
% 25.63/26.03 (step t372 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.63/26.03 (anchor :step t373 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t373.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t373.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t373.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t373.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t373.t3))
% 25.63/26.03 (step t373.t5 (cl (= (tptp.ssList (tptp.sk7 A)) (tptp.ssList (tptp.sk7 A)))) :rule refl)
% 25.63/26.03 (step t373.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t373.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t373.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t373.t2 t373.t4 t373.t5 t373.t6 t373.t7))
% 25.63/26.03 (step t373 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (step t374 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.63/26.03 (step t375 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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 (t373 t374))
% 25.63/26.03 (step t376 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t377 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t376))
% 25.63/26.03 (step t378 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t377))
% 25.63/26.03 (step t379 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t380 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t379 t376))
% 25.63/26.03 (anchor :step t381 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t381.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t381.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t381.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t381.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t381.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t381.t3 t381.t4))
% 25.63/26.03 (step t381.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t381.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t376 t381.t6))
% 25.63/26.03 (step t381.t8 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t381.t5 t381.t7))
% 25.63/26.03 (step t381.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 (t381.t8))
% 25.63/26.03 (step t381.t10 (cl (= (tptp.ssList (tptp.sk7 A)) (tptp.ssList (tptp.sk7 A)))) :rule refl)
% 25.63/26.03 (step t381.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 (t381.t2 t381.t9 t381.t10))
% 25.63/26.03 (step t381 (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.63/26.03 (step t382 (cl (= (or (not (tptp.strictorderedP 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.strictorderedP 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 (t378 t380 t381))
% 25.63/26.03 (step t383 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk7 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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 (t375 t382))
% 25.63/26.03 (step t384 (cl (or (not (tptp.strictorderedP 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 (t372 t383 a198))
% 25.63/26.03 (step t385 (cl (not (tptp.strictorderedP 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 (t384))
% 25.63/26.03 (step t386 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP 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 (t385))
% 25.63/26.03 (step t387 (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 (t386 t351 a193))
% 25.63/26.03 (step t388 (cl (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk7 tptp.sk5)))) :rule resolution :premises (t371 t387))
% 25.63/26.03 (step t389 (cl (tptp.ssList (tptp.sk7 tptp.sk5))) :rule resolution :premises (t356 a191 t388))
% 25.63/26.03 (step t390 (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.63/26.03 (step t391 (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 (t390))
% 25.63/26.03 (step t392 (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.63/26.03 (step t393 (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.63/26.03 (step t394 (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.63/26.03 (step t395 (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 t394))
% 25.63/26.03 (step t396 (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.63/26.03 (step t397 (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 (t395 t396))
% 25.63/26.03 (step t398 (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 (t393 t397))
% 25.63/26.03 (step t399 (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.63/26.03 (anchor :step t400)
% 25.63/26.03 (assume t400.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.63/26.03 (step t400.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.63/26.03 (step t400.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 (t400.t1))
% 25.63/26.03 (step t400.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 (t400.t2 t400.a0))
% 25.63/26.03 (step t400 (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 (t400.a0))
% 25.63/26.03 (step t401 (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 (t399 t400))
% 25.63/26.03 (step t402 (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.63/26.03 (step t403 (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 (t401 t402))
% 25.63/26.03 (step t404 (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 (t403))
% 25.63/26.03 (step t405 (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 (t392 t398 t404))
% 25.63/26.03 (step t406 (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 (t405))
% 25.63/26.03 (step t407 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.63/26.03 (anchor :step t408 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t408.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t408.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t408.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t408.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t408.t3))
% 25.63/26.03 (step t408.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.63/26.03 (step t408.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t408.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t408.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.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t408.t2 t408.t4 t408.t5 t408.t6 t408.t7))
% 25.63/26.03 (step t408 (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.strictorderedP 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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (step t409 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.63/26.03 (step t410 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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 (t408 t409))
% 25.63/26.03 (step t411 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t412 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t411))
% 25.63/26.03 (step t413 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t412))
% 25.63/26.03 (step t414 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t415 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t414 t411))
% 25.63/26.03 (anchor :step t416 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t416.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t416.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t416.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t416.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t416.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t416.t3 t416.t4))
% 25.63/26.03 (step t416.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t416.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t411 t416.t6))
% 25.63/26.03 (step t416.t8 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t416.t5 t416.t7))
% 25.63/26.03 (step t416.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 (t416.t8))
% 25.63/26.03 (step t416.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.63/26.03 (step t416.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 (t416.t2 t416.t9 t416.t10))
% 25.63/26.03 (step t416 (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.63/26.03 (step t417 (cl (= (or (not (tptp.strictorderedP 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.strictorderedP 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 (t413 t415 t416))
% 25.63/26.03 (step t418 (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.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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 (t410 t417))
% 25.63/26.03 (step t419 (cl (or (not (tptp.strictorderedP 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 (t407 t418 a199))
% 25.63/26.03 (step t420 (cl (not (tptp.strictorderedP 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 (t419))
% 25.63/26.03 (step t421 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP 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 (t420))
% 25.63/26.03 (step t422 (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 (t421 t351 a193))
% 25.63/26.03 (step t423 (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 (t406 t422))
% 25.63/26.03 (step t424 (cl (= tptp.sk5 (tptp.app (tptp.cons (tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk7 tptp.sk5)))) :rule resolution :premises (t391 a191 t423))
% 25.63/26.03 (step t425 (cl (not (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5))) :rule or_pos)
% 25.63/26.03 (step t426 (cl (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule reordering :premises (t425))
% 25.63/26.03 (step t427 (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.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule equiv_pos2)
% 25.63/26.03 (step t428 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))))) :rule refl)
% 25.63/26.03 (step t429 (cl (= (tptp.ssItem (tptp.sk8 tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule refl)
% 25.63/26.03 (step t430 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) false (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule cong :premises (t14 t18 t429))
% 25.63/26.03 (step t431 (cl (= (or (not (tptp.ssList tptp.sk5)) false (tptp.ssItem (tptp.sk8 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule all_simplify)
% 25.63/26.03 (step t432 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule trans :premises (t430 t431))
% 25.63/26.03 (step t433 (cl (= (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5)))))) :rule cong :premises (t428 t432))
% 25.63/26.03 (step t434 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (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.ssItem (tptp.sk8 A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t435)
% 25.63/26.03 (assume t435.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))))
% 25.63/26.03 (step t435.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.sk8 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5)))
% 25.63/26.03 (step t435.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.sk8 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule or :premises (t435.t1))
% 25.63/26.03 (step t435.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule resolution :premises (t435.t2 t435.a0))
% 25.63/26.03 (step t435 (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.sk8 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule subproof :discharge (t435.a0))
% 25.63/26.03 (step t436 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule resolution :premises (t434 t435))
% 25.63/26.03 (step t437 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (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.ssItem (tptp.sk8 tptp.sk5))))) :rule implies_neg2)
% 25.63/26.03 (step t438 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (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.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule resolution :premises (t436 t437))
% 25.63/26.03 (step t439 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule contraction :premises (t438))
% 25.63/26.03 (step t440 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5))))) :rule resolution :premises (t427 t433 t439))
% 25.63/26.03 (step t441 (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.sk8 A))))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule implies :premises (t440))
% 25.63/26.03 (step t442 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk8 A))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.sk8 A)))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t443 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t443.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t443.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t443.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t443.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t443.t3))
% 25.63/26.03 (step t443.t5 (cl (= (tptp.ssItem (tptp.sk8 A)) (tptp.ssItem (tptp.sk8 A)))) :rule refl)
% 25.63/26.03 (step t443.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t443.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t443.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t443.t2 t443.t4 t443.t5 t443.t6 t443.t7))
% 25.63/26.03 (step t443 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP 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.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (step t444 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule all_simplify)
% 25.63/26.03 (step t445 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule trans :premises (t443 t444))
% 25.63/26.03 (step t446 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t447 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t446))
% 25.63/26.03 (step t448 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t447))
% 25.63/26.03 (step t449 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t450 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t449 t446))
% 25.63/26.03 (anchor :step t451 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t451.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t451.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t451.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t451.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t451.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t451.t3 t451.t4))
% 25.63/26.03 (step t451.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t451.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t446 t451.t6))
% 25.63/26.03 (step t451.t8 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t451.t5 t451.t7))
% 25.63/26.03 (step t451.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 (t451.t8))
% 25.63/26.03 (step t451.t10 (cl (= (tptp.ssItem (tptp.sk8 A)) (tptp.ssItem (tptp.sk8 A)))) :rule refl)
% 25.63/26.03 (step t451.t11 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A))) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A))))) :rule cong :premises (t451.t2 t451.t9 t451.t10))
% 25.63/26.03 (step t451 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssItem (tptp.sk8 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A)))))) :rule bind)
% 25.63/26.03 (step t452 (cl (= (or (not (tptp.strictorderedP 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.sk8 A))))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule cong :premises (t448 t450 t451))
% 25.63/26.03 (step t453 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssItem (tptp.sk8 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk8 A))))))) :rule trans :premises (t445 t452))
% 25.63/26.03 (step t454 (cl (or (not (tptp.strictorderedP 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.sk8 A)))))) :rule resolution :premises (t442 t453 a200))
% 25.63/26.03 (step t455 (cl (not (tptp.strictorderedP 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.sk8 A))))) :rule or :premises (t454))
% 25.63/26.03 (step t456 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP 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.sk8 A))))) :rule reordering :premises (t455))
% 25.63/26.03 (step t457 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssItem (tptp.sk8 A))))) :rule resolution :premises (t456 t351 a193))
% 25.63/26.03 (step t458 (cl (or (not (tptp.ssList tptp.sk5)) (tptp.ssItem (tptp.sk8 tptp.sk5)))) :rule resolution :premises (t441 t457))
% 25.63/26.03 (step t459 (cl (tptp.ssItem (tptp.sk8 tptp.sk5))) :rule resolution :premises (t426 a191 t458))
% 25.63/26.03 (step t460 (cl (not (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5))) :rule or_pos)
% 25.63/26.03 (step t461 (cl (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule reordering :premises (t460))
% 25.63/26.03 (step t462 (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.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 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.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 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.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 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.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule equiv_pos2)
% 25.63/26.03 (step t463 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))))) :rule refl)
% 25.63/26.03 (step t464 (cl (= (tptp.ssList (tptp.sk9 tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule refl)
% 25.63/26.03 (step t465 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) false (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule cong :premises (t14 t18 t464))
% 25.63/26.03 (step t466 (cl (= (or (not (tptp.ssList tptp.sk5)) false (tptp.ssList (tptp.sk9 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule all_simplify)
% 25.63/26.03 (step t467 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule trans :premises (t465 t466))
% 25.63/26.03 (step t468 (cl (= (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 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.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5)))))) :rule cong :premises (t463 t467))
% 25.63/26.03 (step t469 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 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.sk9 A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t470)
% 25.63/26.03 (assume t470.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))))
% 25.63/26.03 (step t470.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.sk9 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5)))
% 25.63/26.03 (step t470.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.sk9 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule or :premises (t470.t1))
% 25.63/26.03 (step t470.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule resolution :premises (t470.t2 t470.a0))
% 25.63/26.03 (step t470 (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.sk9 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule subproof :discharge (t470.a0))
% 25.63/26.03 (step t471 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule resolution :premises (t469 t470))
% 25.63/26.03 (step t472 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 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.sk9 tptp.sk5))))) :rule implies_neg2)
% 25.63/26.03 (step t473 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 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.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule resolution :premises (t471 t472))
% 25.63/26.03 (step t474 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule contraction :premises (t473))
% 25.63/26.03 (step t475 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5))))) :rule resolution :premises (t462 t468 t474))
% 25.63/26.03 (step t476 (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.sk9 A))))) (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule implies :premises (t475))
% 25.63/26.03 (step t477 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.sk9 A)))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t478 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t478.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t478.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t478.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t478.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t478.t3))
% 25.63/26.03 (step t478.t5 (cl (= (tptp.ssList (tptp.sk9 A)) (tptp.ssList (tptp.sk9 A)))) :rule refl)
% 25.63/26.03 (step t478.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t478.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t478.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t478.t2 t478.t4 t478.t5 t478.t6 t478.t7))
% 25.63/26.03 (step t478 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP 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.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (step t479 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule all_simplify)
% 25.63/26.03 (step t480 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule trans :premises (t478 t479))
% 25.63/26.03 (step t481 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t482 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t481))
% 25.63/26.03 (step t483 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t482))
% 25.63/26.03 (step t484 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t485 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t484 t481))
% 25.63/26.03 (anchor :step t486 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t486.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t486.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t486.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t486.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t486.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t486.t3 t486.t4))
% 25.63/26.03 (step t486.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t486.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t481 t486.t6))
% 25.63/26.03 (step t486.t8 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t486.t5 t486.t7))
% 25.63/26.03 (step t486.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 (t486.t8))
% 25.63/26.03 (step t486.t10 (cl (= (tptp.ssList (tptp.sk9 A)) (tptp.ssList (tptp.sk9 A)))) :rule refl)
% 25.63/26.03 (step t486.t11 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A))) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A))))) :rule cong :premises (t486.t2 t486.t9 t486.t10))
% 25.63/26.03 (step t486 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.ssList (tptp.sk9 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A)))))) :rule bind)
% 25.63/26.03 (step t487 (cl (= (or (not (tptp.strictorderedP 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.sk9 A))))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule cong :premises (t483 t485 t486))
% 25.63/26.03 (step t488 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.ssList (tptp.sk9 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A))))))) :rule trans :premises (t480 t487))
% 25.63/26.03 (step t489 (cl (or (not (tptp.strictorderedP 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.sk9 A)))))) :rule resolution :premises (t477 t488 a201))
% 25.63/26.03 (step t490 (cl (not (tptp.strictorderedP 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.sk9 A))))) :rule or :premises (t489))
% 25.63/26.03 (step t491 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP 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.sk9 A))))) :rule reordering :premises (t490))
% 25.63/26.03 (step t492 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.ssList (tptp.sk9 A))))) :rule resolution :premises (t491 t351 a193))
% 25.63/26.03 (step t493 (cl (or (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.sk9 tptp.sk5)))) :rule resolution :premises (t476 t492))
% 25.63/26.03 (step t494 (cl (tptp.ssList (tptp.sk9 tptp.sk5))) :rule resolution :premises (t461 a191 t493))
% 25.63/26.03 (step t495 (cl (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) :rule or_pos)
% 25.63/26.03 (step t496 (cl (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t495))
% 25.63/26.03 (step t497 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 25.63/26.03 (step t498 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule refl)
% 25.63/26.03 (step t499 (cl (= (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule refl)
% 25.63/26.03 (step t500 (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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) false (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule cong :premises (t14 t18 t499))
% 25.63/26.03 (step t501 (cl (= (or (not (tptp.ssList tptp.sk5)) false (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 25.63/26.03 (step t502 (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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule trans :premises (t500 t501))
% 25.63/26.03 (step t503 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))))) :rule cong :premises (t498 t502))
% 25.63/26.03 (step t504 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t505)
% 25.63/26.03 (assume t505.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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))
% 25.63/26.03 (step t505.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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5)))
% 25.63/26.03 (step t505.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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule or :premises (t505.t1))
% 25.63/26.03 (step t505.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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule resolution :premises (t505.t2 t505.a0))
% 25.63/26.03 (step t505 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t505.a0))
% 25.63/26.03 (step t506 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule resolution :premises (t504 t505))
% 25.63/26.03 (step t507 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 25.63/26.03 (step t508 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t506 t507))
% 25.63/26.03 (step t509 (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.sk9 A) (tptp.cons (tptp.sk8 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.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t508))
% 25.63/26.03 (step t510 (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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t497 t503 t509))
% 25.63/26.03 (step t511 (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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule implies :premises (t510))
% 25.63/26.03 (step t512 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t513 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t513.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t513.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t513.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t513.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t513.t3))
% 25.63/26.03 (step t513.t5 (cl (= (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) :rule all_simplify)
% 25.63/26.03 (step t513.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t513.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t513.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t513.t2 t513.t4 t513.t5 t513.t6 t513.t7))
% 25.63/26.03 (step t513 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (step t514 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule all_simplify)
% 25.63/26.03 (step t515 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule trans :premises (t513 t514))
% 25.63/26.03 (step t516 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t517 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t516))
% 25.63/26.03 (step t518 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t517))
% 25.63/26.03 (step t519 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t520 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t519 t516))
% 25.63/26.03 (anchor :step t521 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t521.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t521.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t521.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t521.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t521.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t521.t3 t521.t4))
% 25.63/26.03 (step t521.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t521.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t516 t521.t6))
% 25.63/26.03 (step t521.t8 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t521.t5 t521.t7))
% 25.63/26.03 (step t521.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 (t521.t8))
% 25.63/26.03 (step t521.t10 (cl (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))) :rule refl)
% 25.63/26.03 (step t521.t11 (cl (= (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))) :rule cong :premises (t516 t521.t10))
% 25.63/26.03 (step t521.t12 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule cong :premises (t521.t2 t521.t9 t521.t11))
% 25.63/26.03 (step t521 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (= tptp.sk1 (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule bind)
% 25.63/26.03 (step t522 (cl (= (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule cong :premises (t518 t520 t521))
% 25.63/26.03 (step t523 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (= (tptp.app (tptp.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))))) :rule trans :premises (t515 t522))
% 25.63/26.03 (step t524 (cl (or (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil))))))) :rule resolution :premises (t512 t523 a202))
% 25.63/26.03 (step t525 (cl (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule or :premises (t524))
% 25.63/26.03 (step t526 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP 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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule reordering :premises (t525))
% 25.63/26.03 (step t527 (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.sk9 A) (tptp.cons (tptp.sk8 A) tptp.nil)))))) :rule resolution :premises (t526 t351 a193))
% 25.63/26.03 (step t528 (cl (or (not (tptp.ssList tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil))))) :rule resolution :premises (t511 t527))
% 25.63/26.03 (step t529 (cl (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) :rule resolution :premises (t496 a191 t528))
% 25.63/26.03 (step t530 (cl (not (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))) :rule or_pos)
% 25.63/26.03 (step t531 (cl (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule reordering :premises (t530))
% 25.63/26.03 (step t532 (cl (not (= (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 25.63/26.03 (step t533 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule refl)
% 25.63/26.03 (step t534 (cl (= (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule refl)
% 25.63/26.03 (step t535 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) false (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule cong :premises (t14 t18 t534))
% 25.63/26.03 (step t536 (cl (= (or (not (tptp.ssList tptp.sk5)) false (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 25.63/26.03 (step t537 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule trans :premises (t535 t536))
% 25.63/26.03 (step t538 (cl (= (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule cong :premises (t533 t537))
% 25.63/26.03 (step t539 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule implies_neg1)
% 25.63/26.03 (anchor :step t540)
% 25.63/26.03 (assume t540.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))))
% 25.63/26.03 (step t540.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.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5)))
% 25.63/26.03 (step t540.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule or :premises (t540.t1))
% 25.63/26.03 (step t540.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule resolution :premises (t540.t2 t540.a0))
% 25.63/26.03 (step t540 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t540.a0))
% 25.63/26.03 (step t541 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule resolution :premises (t539 t540))
% 25.63/26.03 (step t542 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 25.63/26.03 (step t543 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (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.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule resolution :premises (t541 t542))
% 25.63/26.03 (step t544 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 tptp.sk5))) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule contraction :premises (t543))
% 25.63/26.03 (step t545 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))))) :rule resolution :premises (t532 t538 t544))
% 25.63/26.03 (step t546 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule implies :premises (t545))
% 25.63/26.03 (step t547 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))))) (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule equiv_pos2)
% 25.63/26.03 (anchor :step t548 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t548.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t548.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t548.t3 (cl (= (= (tptp.app tptp.sk1 A) tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk1 A)))) :rule all_simplify)
% 25.63/26.03 (step t548.t4 (cl (= (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))))) :rule cong :premises (t548.t3))
% 25.63/26.03 (step t548.t5 (cl (= (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t548.t6 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 25.63/26.03 (step t548.t7 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 25.63/26.03 (step t548.t8 (cl (= (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t548.t2 t548.t4 t548.t5 t548.t6 t548.t7))
% 25.63/26.03 (step t548 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 25.63/26.03 (step t549 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule all_simplify)
% 25.63/26.03 (step t550 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule trans :premises (t548 t549))
% 25.63/26.03 (step t551 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t38))
% 25.63/26.03 (step t552 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t551))
% 25.63/26.03 (step t553 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t552))
% 25.63/26.03 (step t554 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.63/26.03 (step t555 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t554 t551))
% 25.63/26.03 (anchor :step t556 :args ((A $$unsorted) (:= A A)))
% 25.63/26.03 (step t556.t1 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t556.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.63/26.03 (step t556.t3 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t38))
% 25.63/26.03 (step t556.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and :premises (t38))
% 25.63/26.03 (step t556.t5 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t556.t3 t556.t4))
% 25.63/26.03 (step t556.t6 (cl (= A A)) :rule refl)
% 25.63/26.03 (step t556.t7 (cl (= (tptp.app tptp.sk1 A) (tptp.app tptp.sk3 A))) :rule cong :premises (t551 t556.t6))
% 25.63/26.03 (step t556.t8 (cl (= (= tptp.sk2 (tptp.app tptp.sk1 A)) (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A)))) :rule cong :premises (t556.t5 t556.t7))
% 25.63/26.03 (step t556.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 (t556.t8))
% 25.63/26.03 (step t556.t10 (cl (= (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) :rule refl)
% 25.63/26.03 (step t556.t11 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule cong :premises (t556.t2 t556.t9 t556.t10))
% 25.63/26.03 (step t556 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule bind)
% 25.63/26.03 (step t557 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 (tptp.app tptp.sk1 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule cong :premises (t553 t555 t556))
% 25.63/26.03 (step t558 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk1 A) tptp.sk2)) (tptp.lt (tptp.sk8 A) (tptp.sk6 A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))))) :rule trans :premises (t550 t557))
% 25.63/26.03 (step t559 (cl (or (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A)))))) :rule resolution :premises (t547 t558 a203))
% 25.63/26.03 (step t560 (cl (not (tptp.strictorderedP 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.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule or :premises (t559))
% 25.63/26.03 (step t561 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule reordering :premises (t560))
% 25.63/26.03 (step t562 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (= (tptp.app tptp.sk3 tptp.sk5) (tptp.app tptp.sk3 A))) (tptp.lt (tptp.sk8 A) (tptp.sk6 A))))) :rule resolution :premises (t561 t351 a193))
% 25.63/26.03 (step t563 (cl (or (not (tptp.ssList tptp.sk5)) (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))) :rule resolution :premises (t546 t562))
% 25.63/26.03 (step t564 (cl (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5))) :rule resolution :premises (t531 a191 t563))
% 25.63/26.03 (step t565 (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.ssItem (tptp.sk8 tptp.sk5))) (not (tptp.ssList (tptp.sk9 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk9 tptp.sk5) (tptp.cons (tptp.sk8 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk8 tptp.sk5) (tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t9 t354 t389 t424 t459 t494 t529 t564))
% 25.63/26.03 (step t566 (cl) :rule resolution :premises (t7 t565 t84))
% 25.63/26.03
% 25.63/26.03 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.vEkJWBbVQ3/cvc5---1.0.5_29964.smt2
% 25.63/26.04 % cvc5---1.0.5 exiting
% 25.63/26.04 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------