TSTP Solution File: SWC153-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC153-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:00:41 EDT 2024
% Result : Unsatisfiable 10.61s 10.83s
% Output : Proof 10.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC153-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n025.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 17:03:54 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.59/10.78 --- Run --no-e-matching --full-saturate-quant at 5...
% 10.61/10.83 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.WgGNsOYHd9/cvc5---1.0.5_410.smt2
% 10.61/10.83 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.WgGNsOYHd9/cvc5---1.0.5_410.smt2
% 10.61/10.84 (assume a0 (tptp.equalelemsP tptp.nil))
% 10.61/10.84 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 10.61/10.84 (assume a2 (tptp.strictorderedP tptp.nil))
% 10.61/10.84 (assume a3 (tptp.totalorderedP tptp.nil))
% 10.61/10.84 (assume a4 (tptp.strictorderP tptp.nil))
% 10.61/10.84 (assume a5 (tptp.totalorderP tptp.nil))
% 10.61/10.84 (assume a6 (tptp.cyclefreeP tptp.nil))
% 10.61/10.84 (assume a7 (tptp.ssList tptp.nil))
% 10.61/10.84 (assume a8 (tptp.ssItem tptp.skac3))
% 10.61/10.84 (assume a9 (tptp.ssItem tptp.skac2))
% 10.61/10.84 (assume a10 (not (tptp.singletonP tptp.nil)))
% 10.61/10.84 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 10.61/10.84 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 10.61/10.84 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 10.61/10.84 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 10.61/10.84 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 10.61/10.84 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 10.61/10.84 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 10.61/10.84 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 10.61/10.84 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 10.61/10.84 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 10.61/10.84 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 10.61/10.84 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 10.61/10.84 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 10.61/10.84 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 10.61/10.84 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 10.61/10.84 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 10.61/10.84 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 10.61/10.84 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 10.61/10.84 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 10.61/10.84 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 10.61/10.84 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 10.61/10.84 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 10.61/10.84 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 10.61/10.84 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 10.61/10.84 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 10.61/10.84 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 10.61/10.84 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 10.61/10.84 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 10.61/10.84 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 10.61/10.84 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 10.61/10.84 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 10.61/10.84 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 10.61/10.84 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 10.61/10.84 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 10.61/10.84 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 10.61/10.84 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 10.61/10.84 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 10.61/10.84 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 10.61/10.84 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 10.61/10.84 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 10.61/10.84 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 10.61/10.84 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 10.61/10.84 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 10.61/10.84 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 10.61/10.84 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 10.61/10.84 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 10.61/10.84 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 10.61/10.84 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 10.61/10.84 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 10.61/10.84 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 10.61/10.84 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 10.61/10.84 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 10.61/10.84 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 10.61/10.84 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 10.61/10.84 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 10.61/10.84 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 10.61/10.84 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 10.61/10.84 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 10.61/10.84 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 10.61/10.84 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 10.61/10.84 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 10.61/10.84 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 10.61/10.84 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 10.61/10.84 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 10.61/10.84 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 10.61/10.84 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 10.61/10.84 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 10.61/10.84 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 10.61/10.84 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 10.61/10.84 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 10.61/10.84 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 10.61/10.84 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 10.61/10.84 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 10.61/10.84 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 10.61/10.84 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 10.61/10.84 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 10.61/10.84 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 10.61/10.84 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 10.61/10.84 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 10.61/10.84 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 10.61/10.84 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 10.61/10.84 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 10.61/10.84 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 10.61/10.84 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 10.61/10.84 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 10.61/10.84 (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))))
% 10.61/10.84 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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))))
% 10.61/10.84 (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)))))
% 10.61/10.84 (assume a185 (tptp.ssList tptp.sk1))
% 10.61/10.84 (assume a186 (tptp.ssList tptp.sk2))
% 10.61/10.84 (assume a187 (tptp.ssList tptp.sk3))
% 10.61/10.84 (assume a188 (tptp.ssList tptp.sk4))
% 10.61/10.84 (assume a189 (= tptp.sk4 tptp.sk2))
% 10.61/10.84 (assume a190 (= tptp.sk3 tptp.sk1))
% 10.61/10.84 (assume a191 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (tptp.leq A B))))
% 10.61/10.84 (assume a192 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))
% 10.61/10.84 (assume a193 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))
% 10.61/10.84 (assume a194 (tptp.ssItem tptp.sk5))
% 10.61/10.84 (assume a195 (tptp.ssItem tptp.sk6))
% 10.61/10.84 (assume a196 (tptp.ssList tptp.sk7))
% 10.61/10.84 (assume a197 (tptp.ssList tptp.sk8))
% 10.61/10.84 (assume a198 (tptp.ssList tptp.sk9))
% 10.61/10.84 (assume a199 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) tptp.sk1))
% 10.61/10.84 (assume a200 (tptp.leq tptp.sk6 tptp.sk5))
% 10.61/10.84 (assume a201 (or (tptp.ssItem tptp.sk10) (not (tptp.leq tptp.sk5 tptp.sk6))))
% 10.61/10.84 (assume a202 (or (tptp.memberP tptp.sk8 tptp.sk10) (not (tptp.leq tptp.sk5 tptp.sk6))))
% 10.61/10.84 (assume a203 (or (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk5 tptp.sk6))))
% 10.61/10.84 (step t1 (cl (not (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)) :rule or_pos)
% 10.61/10.84 (step t2 (cl (tptp.leq tptp.sk5 tptp.sk6) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule reordering :premises (t1))
% 10.61/10.84 (step t3 (cl (=> (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))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (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)))) :rule implies_neg1)
% 10.61/10.84 (anchor :step t4)
% 10.61/10.84 (assume t4.a0 (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))))
% 10.61/10.84 (step t4.t1 (cl (or (not (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)))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk10) (:= W tptp.sk6)))
% 10.61/10.84 (step t4.t2 (cl (not (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)))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule or :premises (t4.t1))
% 10.61/10.84 (step t4.t3 (cl (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t4.t2 t4.a0))
% 10.61/10.84 (step t4 (cl (not (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)))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule subproof :discharge (t4.a0))
% 10.61/10.84 (step t5 (cl (=> (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))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t3 t4))
% 10.61/10.84 (step t6 (cl (=> (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))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (not (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule implies_neg2)
% 10.61/10.84 (step t7 (cl (=> (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))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (=> (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))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule resolution :premises (t5 t6))
% 10.61/10.84 (step t8 (cl (=> (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))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule contraction :premises (t7))
% 10.61/10.84 (step t9 (cl (not (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)))) (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule implies :premises (t8))
% 10.61/10.84 (step t10 (cl (or (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t9 a155))
% 10.61/10.84 (step t11 (cl (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.leq tptp.sk5 tptp.sk6))) :rule or :premises (a203))
% 10.61/10.84 (step t12 (cl (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10))) :rule reordering :premises (t11))
% 10.61/10.84 (step t13 (cl (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.ssItem tptp.sk10)) (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10))) :rule resolution :premises (t2 t10 a195 a194 t12))
% 10.61/10.84 (step t14 (cl (not (tptp.leq tptp.sk10 tptp.sk6)) (not (tptp.leq tptp.sk5 tptp.sk10)) (not (tptp.ssItem tptp.sk10))) :rule contraction :premises (t13))
% 10.61/10.84 (step t15 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)) :rule or_pos)
% 10.61/10.84 (step t16 (cl (tptp.leq tptp.sk5 tptp.sk10) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule reordering :premises (t15))
% 10.61/10.84 (step t17 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))))) (not (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule equiv_pos2)
% 10.61/10.84 (step t18 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) :rule refl)
% 10.61/10.84 (step t19 (cl (= (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule refl)
% 10.61/10.84 (step t20 (cl (= (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule refl)
% 10.61/10.84 (step t21 (cl (= (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk7)))) :rule refl)
% 10.61/10.84 (step t22 (cl (= (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk8)))) :rule refl)
% 10.61/10.84 (step t23 (cl (= (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk9)))) :rule refl)
% 10.61/10.84 (step t24 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true)) :rule all_simplify)
% 10.61/10.84 (step t25 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not true))) :rule cong :premises (t24))
% 10.61/10.84 (step t26 (cl (= (not true) false)) :rule all_simplify)
% 10.61/10.84 (step t27 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) false)) :rule trans :premises (t25 t26))
% 10.61/10.84 (step t28 (cl (= (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.leq tptp.sk6 tptp.sk5)))) :rule refl)
% 10.61/10.84 (step t29 (cl (= (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk10)))) :rule refl)
% 10.61/10.84 (step t30 (cl (= (not (tptp.memberP tptp.sk8 tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)))) :rule refl)
% 10.61/10.84 (step t31 (cl (= (tptp.leq tptp.sk5 tptp.sk10) (tptp.leq tptp.sk5 tptp.sk10))) :rule refl)
% 10.61/10.84 (step t32 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) false (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule cong :premises (t19 t20 t21 t22 t23 t27 t28 t29 t30 t31))
% 10.61/10.84 (step t33 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) false (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule all_simplify)
% 10.61/10.84 (step t34 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule trans :premises (t32 t33))
% 10.61/10.84 (step t35 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))))) :rule cong :premises (t18 t34))
% 10.61/10.84 (step t36 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) :rule implies_neg1)
% 10.61/10.84 (anchor :step t37)
% 10.61/10.84 (assume t37.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))
% 10.61/10.84 (step t37.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6) (:= C tptp.sk7) (:= D tptp.sk8) (:= E tptp.sk9) (:= F tptp.sk10)))
% 10.61/10.84 (step t37.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) :rule or :premises (t37.t1))
% 10.61/10.84 (step t37.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) :rule resolution :premises (t37.t2 t37.a0))
% 10.61/10.84 (step t37 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) :rule subproof :discharge (t37.a0))
% 10.61/10.84 (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) :rule resolution :premises (t36 t37))
% 10.61/10.84 (step t39 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule implies_neg2)
% 10.61/10.84 (step t40 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule resolution :premises (t38 t39))
% 10.61/10.84 (step t41 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule contraction :premises (t40))
% 10.61/10.84 (step t42 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10)))) :rule resolution :premises (t17 t35 t41))
% 10.61/10.84 (step t43 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) :rule implies :premises (t42))
% 10.61/10.84 (step t44 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) :rule equiv_pos2)
% 10.61/10.84 (anchor :step t45 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 10.61/10.84 (step t45.t1 (cl (= A A)) :rule refl)
% 10.61/10.84 (step t45.t2 (cl (= B B)) :rule refl)
% 10.61/10.84 (step t45.t3 (cl (= C C)) :rule refl)
% 10.61/10.84 (step t45.t4 (cl (= D D)) :rule refl)
% 10.61/10.84 (step t45.t5 (cl (= E E)) :rule refl)
% 10.61/10.84 (step t45.t6 (cl (= F F)) :rule refl)
% 10.61/10.84 (step t45.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.84 (step t45.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.84 (step t45.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.84 (step t45.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.84 (step t45.t11 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.84 (step t45.t12 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)))) :rule all_simplify)
% 10.61/10.84 (step t45.t13 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))))) :rule cong :premises (t45.t12))
% 10.61/10.84 (step t45.t14 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.84 (step t45.t15 (cl (= (not (tptp.ssItem F)) (not (tptp.ssItem F)))) :rule refl)
% 10.61/10.84 (step t45.t16 (cl (= (not (tptp.memberP D F)) (not (tptp.memberP D F)))) :rule refl)
% 10.61/10.84 (step t45.t17 (cl (= (tptp.leq A F) (tptp.leq A F))) :rule refl)
% 10.61/10.84 (step t45.t18 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) :rule cong :premises (t45.t7 t45.t8 t45.t9 t45.t10 t45.t11 t45.t13 t45.t14 t45.t15 t45.t16 t45.t17))
% 10.61/10.84 (step t45 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) :rule bind)
% 10.61/10.84 (anchor :step t46 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 10.61/10.84 (step t46.t1 (cl (= A A)) :rule refl)
% 10.61/10.84 (step t46.t2 (cl (= B B)) :rule refl)
% 10.61/10.84 (step t46.t3 (cl (= C C)) :rule refl)
% 10.61/10.84 (step t46.t4 (cl (= D D)) :rule refl)
% 10.61/10.84 (step t46.t5 (cl (= E E)) :rule refl)
% 10.61/10.84 (step t46.t6 (cl (= F F)) :rule refl)
% 10.61/10.84 (step t46.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.84 (step t46.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.84 (step t46.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.84 (step t46.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.84 (step t46.t11 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.84 (step t46.t12 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 10.61/10.84 (step t46.t13 (cl (not (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule equiv_pos2)
% 10.61/10.84 (step t46.t14 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 10.61/10.84 (step t46.t15 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (a190))
% 10.61/10.84 (step t46.t16 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (a189))
% 10.61/10.84 (step t46.t17 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t46.t14 t46.t15 t46.t16))
% 10.61/10.84 (step t46.t18 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t46.t17))
% 10.61/10.84 (step t46.t19 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule refl)
% 10.61/10.84 (step t46.t20 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t46.t18 t46.t19))
% 10.61/10.84 (step t46.t21 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (a199))
% 10.61/10.84 (step t46.t22 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t46.t13 t46.t20 t46.t21))
% 10.61/10.84 (step t46.t23 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t46.t12 t46.t22 t46.t15 t46.t16))
% 10.61/10.84 (step t46.t24 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and :premises (t46.t23))
% 10.61/10.84 (step t46.t25 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) :rule refl)
% 10.61/10.84 (step t46.t26 (cl (= (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)))) :rule cong :premises (t46.t24 t46.t25))
% 10.61/10.85 (step t46.t27 (cl (= (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))))) :rule cong :premises (t46.t26))
% 10.61/10.85 (step t46.t28 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t46.t29 (cl (= (not (tptp.ssItem F)) (not (tptp.ssItem F)))) :rule refl)
% 10.61/10.85 (step t46.t30 (cl (= (not (tptp.memberP D F)) (not (tptp.memberP D F)))) :rule refl)
% 10.61/10.85 (step t46.t31 (cl (= (tptp.leq A F) (tptp.leq A F))) :rule refl)
% 10.61/10.85 (step t46.t32 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) :rule cong :premises (t46.t7 t46.t8 t46.t9 t46.t10 t46.t11 t46.t27 t46.t28 t46.t29 t46.t30 t46.t31))
% 10.61/10.85 (step t46 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) :rule bind)
% 10.61/10.85 (anchor :step t47 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 10.61/10.85 (step t47.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t47.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t47.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t47.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t47.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t47.t6 (cl (= F F)) :rule refl)
% 10.61/10.85 (step t47.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t47.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t47.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t47.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t47.t11 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t47.t12 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)) (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule all_simplify)
% 10.61/10.85 (step t47.t13 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule cong :premises (t47.t12))
% 10.61/10.85 (step t47.t14 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t47.t15 (cl (= (not (tptp.ssItem F)) (not (tptp.ssItem F)))) :rule refl)
% 10.61/10.85 (step t47.t16 (cl (= (not (tptp.memberP D F)) (not (tptp.memberP D F)))) :rule refl)
% 10.61/10.85 (step t47.t17 (cl (= (tptp.leq A F) (tptp.leq A F))) :rule refl)
% 10.61/10.85 (step t47.t18 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) :rule cong :premises (t47.t7 t47.t8 t47.t9 t47.t10 t47.t11 t47.t13 t47.t14 t47.t15 t47.t16 t47.t17))
% 10.61/10.85 (step t47 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) :rule bind)
% 10.61/10.85 (step t48 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) :rule trans :premises (t46 t47))
% 10.61/10.85 (step t49 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F))))) :rule trans :premises (t45 t48))
% 10.61/10.85 (step t50 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq A F)))) :rule resolution :premises (t44 t49 a192))
% 10.61/10.85 (step t51 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk5 tptp.sk10))) :rule resolution :premises (t43 t50))
% 10.61/10.85 (step t52 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)) :rule or_pos)
% 10.61/10.85 (step t53 (cl (tptp.leq tptp.sk10 tptp.sk6) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule reordering :premises (t52))
% 10.61/10.85 (step t54 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))))) (not (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule equiv_pos2)
% 10.61/10.85 (step t55 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) :rule refl)
% 10.61/10.85 (step t56 (cl (= (tptp.leq tptp.sk10 tptp.sk6) (tptp.leq tptp.sk10 tptp.sk6))) :rule refl)
% 10.61/10.85 (step t57 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) false (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule cong :premises (t19 t20 t21 t22 t23 t27 t28 t29 t30 t56))
% 10.61/10.85 (step t58 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) false (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule all_simplify)
% 10.61/10.85 (step t59 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule trans :premises (t57 t58))
% 10.61/10.85 (step t60 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))))) :rule cong :premises (t55 t59))
% 10.61/10.85 (step t61 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) :rule implies_neg1)
% 10.61/10.85 (anchor :step t62)
% 10.61/10.85 (assume t62.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))
% 10.61/10.85 (step t62.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6) (:= C tptp.sk7) (:= D tptp.sk8) (:= E tptp.sk9) (:= F tptp.sk10)))
% 10.61/10.85 (step t62.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) :rule or :premises (t62.t1))
% 10.61/10.85 (step t62.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) :rule resolution :premises (t62.t2 t62.a0))
% 10.61/10.85 (step t62 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) :rule subproof :discharge (t62.a0))
% 10.61/10.85 (step t63 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) :rule resolution :premises (t61 t62))
% 10.61/10.85 (step t64 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule implies_neg2)
% 10.61/10.85 (step t65 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule resolution :premises (t63 t64))
% 10.61/10.85 (step t66 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule contraction :premises (t65))
% 10.61/10.85 (step t67 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6)))) :rule resolution :premises (t54 t60 t66))
% 10.61/10.85 (step t68 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) :rule implies :premises (t67))
% 10.61/10.85 (step t69 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) :rule equiv_pos2)
% 10.61/10.85 (anchor :step t70 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 10.61/10.85 (step t70.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t70.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t70.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t70.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t70.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t70.t6 (cl (= F F)) :rule refl)
% 10.61/10.85 (step t70.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t70.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t70.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t70.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t70.t11 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t70.t12 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)))) :rule all_simplify)
% 10.61/10.85 (step t70.t13 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))))) :rule cong :premises (t70.t12))
% 10.61/10.85 (step t70.t14 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t70.t15 (cl (= (not (tptp.ssItem F)) (not (tptp.ssItem F)))) :rule refl)
% 10.61/10.85 (step t70.t16 (cl (= (not (tptp.memberP D F)) (not (tptp.memberP D F)))) :rule refl)
% 10.61/10.85 (step t70.t17 (cl (= (tptp.leq F B) (tptp.leq F B))) :rule refl)
% 10.61/10.85 (step t70.t18 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) :rule cong :premises (t70.t7 t70.t8 t70.t9 t70.t10 t70.t11 t70.t13 t70.t14 t70.t15 t70.t16 t70.t17))
% 10.61/10.85 (step t70 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) :rule bind)
% 10.61/10.85 (anchor :step t71 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 10.61/10.85 (step t71.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t71.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t71.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t71.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t71.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t71.t6 (cl (= F F)) :rule refl)
% 10.61/10.85 (step t71.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t71.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t71.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t71.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t71.t11 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t71.t12 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 10.61/10.85 (step t71.t13 (cl (not (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule equiv_pos2)
% 10.61/10.85 (step t71.t14 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 10.61/10.85 (step t71.t15 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (a190))
% 10.61/10.85 (step t71.t16 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (a189))
% 10.61/10.85 (step t71.t17 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t71.t14 t71.t15 t71.t16))
% 10.61/10.85 (step t71.t18 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t71.t17))
% 10.61/10.85 (step t71.t19 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule refl)
% 10.61/10.85 (step t71.t20 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t71.t18 t71.t19))
% 10.61/10.85 (step t71.t21 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (a199))
% 10.61/10.85 (step t71.t22 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t71.t13 t71.t20 t71.t21))
% 10.61/10.85 (step t71.t23 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t71.t12 t71.t22 t71.t15 t71.t16))
% 10.61/10.85 (step t71.t24 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and :premises (t71.t23))
% 10.61/10.85 (step t71.t25 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) :rule refl)
% 10.61/10.85 (step t71.t26 (cl (= (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)))) :rule cong :premises (t71.t24 t71.t25))
% 10.61/10.85 (step t71.t27 (cl (= (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))))) :rule cong :premises (t71.t26))
% 10.61/10.85 (step t71.t28 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t71.t29 (cl (= (not (tptp.ssItem F)) (not (tptp.ssItem F)))) :rule refl)
% 10.61/10.85 (step t71.t30 (cl (= (not (tptp.memberP D F)) (not (tptp.memberP D F)))) :rule refl)
% 10.61/10.85 (step t71.t31 (cl (= (tptp.leq F B) (tptp.leq F B))) :rule refl)
% 10.61/10.85 (step t71.t32 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) :rule cong :premises (t71.t7 t71.t8 t71.t9 t71.t10 t71.t11 t71.t27 t71.t28 t71.t29 t71.t30 t71.t31))
% 10.61/10.85 (step t71 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) :rule bind)
% 10.61/10.85 (anchor :step t72 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 10.61/10.85 (step t72.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t72.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t72.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t72.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t72.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t72.t6 (cl (= F F)) :rule refl)
% 10.61/10.85 (step t72.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t72.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t72.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t72.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t72.t11 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t72.t12 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)) (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule all_simplify)
% 10.61/10.85 (step t72.t13 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule cong :premises (t72.t12))
% 10.61/10.85 (step t72.t14 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t72.t15 (cl (= (not (tptp.ssItem F)) (not (tptp.ssItem F)))) :rule refl)
% 10.61/10.85 (step t72.t16 (cl (= (not (tptp.memberP D F)) (not (tptp.memberP D F)))) :rule refl)
% 10.61/10.85 (step t72.t17 (cl (= (tptp.leq F B) (tptp.leq F B))) :rule refl)
% 10.61/10.85 (step t72.t18 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) :rule cong :premises (t72.t7 t72.t8 t72.t9 t72.t10 t72.t11 t72.t13 t72.t14 t72.t15 t72.t16 t72.t17))
% 10.61/10.85 (step t72 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) :rule bind)
% 10.61/10.85 (step t73 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) :rule trans :premises (t71 t72))
% 10.61/10.85 (step t74 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B))))) :rule trans :premises (t70 t73))
% 10.61/10.85 (step t75 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (not (tptp.ssItem F)) (not (tptp.memberP D F)) (tptp.leq F B)))) :rule resolution :premises (t69 t74 a193))
% 10.61/10.85 (step t76 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (tptp.leq tptp.sk10 tptp.sk6))) :rule resolution :premises (t68 t75))
% 10.61/10.85 (step t77 (cl (not (tptp.ssItem tptp.sk10)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10)) (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10))) :rule resolution :premises (t14 t16 t51 a200 a198 a197 a196 a195 a194 t53 t76 a200 a198 a197 a196 a195 a194))
% 10.61/10.85 (step t78 (cl (not (tptp.ssItem tptp.sk10)) (not (tptp.memberP tptp.sk8 tptp.sk10))) :rule contraction :premises (t77))
% 10.61/10.85 (step t79 (cl (tptp.memberP tptp.sk8 tptp.sk10) (not (tptp.leq tptp.sk5 tptp.sk6))) :rule or :premises (a202))
% 10.61/10.85 (step t80 (cl (not (tptp.leq tptp.sk5 tptp.sk6)) (tptp.memberP tptp.sk8 tptp.sk10)) :rule reordering :premises (t79))
% 10.61/10.85 (step t81 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)) :rule or_pos)
% 10.61/10.85 (step t82 (cl (tptp.leq tptp.sk5 tptp.sk6) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule reordering :premises (t81))
% 10.61/10.85 (step t83 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))))) (not (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule equiv_pos2)
% 10.61/10.85 (step t84 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))))) :rule refl)
% 10.61/10.85 (step t85 (cl (= (tptp.leq tptp.sk5 tptp.sk6) (tptp.leq tptp.sk5 tptp.sk6))) :rule refl)
% 10.61/10.85 (step t86 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) false (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule cong :premises (t19 t20 t21 t22 t23 t27 t28 t85))
% 10.61/10.85 (step t87 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) false (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule all_simplify)
% 10.61/10.85 (step t88 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule trans :premises (t86 t87))
% 10.61/10.85 (step t89 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))))) :rule cong :premises (t84 t88))
% 10.61/10.85 (step t90 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) :rule implies_neg1)
% 10.61/10.85 (anchor :step t91)
% 10.61/10.85 (assume t91.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))))
% 10.61/10.85 (step t91.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6) (:= C tptp.sk7) (:= D tptp.sk8) (:= E tptp.sk9)))
% 10.61/10.85 (step t91.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule or :premises (t91.t1))
% 10.61/10.85 (step t91.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t91.t2 t91.a0))
% 10.61/10.85 (step t91 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule subproof :discharge (t91.a0))
% 10.61/10.85 (step t92 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t90 t91))
% 10.61/10.85 (step t93 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule implies_neg2)
% 10.61/10.85 (step t94 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule resolution :premises (t92 t93))
% 10.61/10.85 (step t95 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule contraction :premises (t94))
% 10.61/10.85 (step t96 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6)))) :rule resolution :premises (t83 t89 t95))
% 10.61/10.85 (step t97 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule implies :premises (t96))
% 10.61/10.85 (step t98 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (tptp.leq A B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) :rule equiv_pos2)
% 10.61/10.85 (anchor :step t99 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E)))
% 10.61/10.85 (step t99.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t99.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t99.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t99.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t99.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t99.t6 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t99.t7 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t99.t8 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t99.t9 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t99.t10 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t99.t11 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)))) :rule all_simplify)
% 10.61/10.85 (step t99.t12 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))))) :rule cong :premises (t99.t11))
% 10.61/10.85 (step t99.t13 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t99.t14 (cl (= (tptp.leq A B) (tptp.leq A B))) :rule refl)
% 10.61/10.85 (step t99.t15 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (tptp.leq A B)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B)))) :rule cong :premises (t99.t6 t99.t7 t99.t8 t99.t9 t99.t10 t99.t12 t99.t13 t99.t14))
% 10.61/10.85 (step t99 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B))))) :rule bind)
% 10.61/10.85 (anchor :step t100 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E)))
% 10.61/10.85 (step t100.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t100.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t100.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t100.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t100.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t100.t6 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t100.t7 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t100.t8 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t100.t9 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t100.t10 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t100.t11 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 10.61/10.85 (step t100.t12 (cl (not (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule equiv_pos2)
% 10.61/10.85 (step t100.t13 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 10.61/10.85 (step t100.t14 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (a190))
% 10.61/10.85 (step t100.t15 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (a189))
% 10.61/10.85 (step t100.t16 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t100.t13 t100.t14 t100.t15))
% 10.61/10.85 (step t100.t17 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t100.t16))
% 10.61/10.85 (step t100.t18 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule refl)
% 10.61/10.85 (step t100.t19 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t100.t17 t100.t18))
% 10.61/10.85 (step t100.t20 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (a199))
% 10.61/10.85 (step t100.t21 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t100.t12 t100.t19 t100.t20))
% 10.61/10.85 (step t100.t22 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t100.t11 t100.t21 t100.t14 t100.t15))
% 10.61/10.85 (step t100.t23 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and :premises (t100.t22))
% 10.61/10.85 (step t100.t24 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) :rule refl)
% 10.61/10.85 (step t100.t25 (cl (= (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)))) :rule cong :premises (t100.t23 t100.t24))
% 10.61/10.85 (step t100.t26 (cl (= (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))))) :rule cong :premises (t100.t25))
% 10.61/10.85 (step t100.t27 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t100.t28 (cl (= (tptp.leq A B) (tptp.leq A B))) :rule refl)
% 10.61/10.85 (step t100.t29 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B)))) :rule cong :premises (t100.t6 t100.t7 t100.t8 t100.t9 t100.t10 t100.t26 t100.t27 t100.t28))
% 10.61/10.85 (step t100 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B))))) :rule bind)
% 10.61/10.85 (anchor :step t101 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E)))
% 10.61/10.85 (step t101.t1 (cl (= A A)) :rule refl)
% 10.61/10.85 (step t101.t2 (cl (= B B)) :rule refl)
% 10.61/10.85 (step t101.t3 (cl (= C C)) :rule refl)
% 10.61/10.85 (step t101.t4 (cl (= D D)) :rule refl)
% 10.61/10.85 (step t101.t5 (cl (= E E)) :rule refl)
% 10.61/10.85 (step t101.t6 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 10.61/10.85 (step t101.t7 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 10.61/10.85 (step t101.t8 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 10.61/10.85 (step t101.t9 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 10.61/10.85 (step t101.t10 (cl (= (not (tptp.ssList E)) (not (tptp.ssList E)))) :rule refl)
% 10.61/10.85 (step t101.t11 (cl (= (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E)) (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule all_simplify)
% 10.61/10.85 (step t101.t12 (cl (= (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule cong :premises (t101.t11))
% 10.61/10.85 (step t101.t13 (cl (= (not (tptp.leq B A)) (not (tptp.leq B A)))) :rule refl)
% 10.61/10.85 (step t101.t14 (cl (= (tptp.leq A B) (tptp.leq A B))) :rule refl)
% 10.61/10.85 (step t101.t15 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) :rule cong :premises (t101.t6 t101.t7 t101.t8 t101.t9 t101.t10 t101.t12 t101.t13 t101.t14))
% 10.61/10.85 (step t101 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))))) :rule bind)
% 10.61/10.85 (step t102 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E))) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))))) :rule trans :premises (t100 t101))
% 10.61/10.85 (step t103 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) tptp.sk3)) (not (tptp.leq B A)) (tptp.leq A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B))))) :rule trans :premises (t99 t102))
% 10.61/10.85 (step t104 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (tptp.ssList D)) (not (tptp.ssList E)) (not (= (tptp.app (tptp.app (tptp.app (tptp.app C (tptp.cons A tptp.nil)) D) (tptp.cons B tptp.nil)) E) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (tptp.leq B A)) (tptp.leq A B)))) :rule resolution :premises (t98 t103 a191))
% 10.61/10.85 (step t105 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.leq tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t97 t104))
% 10.61/10.85 (step t106 (cl (tptp.leq tptp.sk5 tptp.sk6)) :rule resolution :premises (t82 a194 a195 a196 a197 a198 a200 t105))
% 10.61/10.85 (step t107 (cl (tptp.memberP tptp.sk8 tptp.sk10)) :rule resolution :premises (t80 t106))
% 10.61/10.85 (step t108 (cl (tptp.ssItem tptp.sk10) (not (tptp.leq tptp.sk5 tptp.sk6))) :rule or :premises (a201))
% 10.61/10.85 (step t109 (cl (tptp.ssItem tptp.sk10)) :rule resolution :premises (t108 t106))
% 10.61/10.85 (step t110 (cl) :rule resolution :premises (t78 t107 t109))
% 10.61/10.85
% 10.61/10.85 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.WgGNsOYHd9/cvc5---1.0.5_410.smt2
% 10.61/10.85 % cvc5---1.0.5 exiting
% 10.61/10.85 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------