TSTP Solution File: SWC160-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC160-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n019.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:42 EDT 2024
% Result : Unsatisfiable 26.26s 26.58s
% Output : Proof 26.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.15 % Problem : SWC160-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.16 % Command : do_cvc5 %s %d
% 0.16/0.37 % Computer : n019.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 26 15:03:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.41/0.57 %----Proving TF0_NAR, FOF, or CNF
% 0.41/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.68/10.90 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.69/15.94 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.75/20.99 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.77/26.09 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 26.26/26.58 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.MiQmtsK3Pc/cvc5---1.0.5_32326.smt2
% 26.26/26.58 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.MiQmtsK3Pc/cvc5---1.0.5_32326.smt2
% 26.37/26.64 (assume a0 (tptp.equalelemsP tptp.nil))
% 26.37/26.64 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 26.37/26.64 (assume a2 (tptp.strictorderedP tptp.nil))
% 26.37/26.64 (assume a3 (tptp.totalorderedP tptp.nil))
% 26.37/26.64 (assume a4 (tptp.strictorderP tptp.nil))
% 26.37/26.64 (assume a5 (tptp.totalorderP tptp.nil))
% 26.37/26.64 (assume a6 (tptp.cyclefreeP tptp.nil))
% 26.37/26.64 (assume a7 (tptp.ssList tptp.nil))
% 26.37/26.64 (assume a8 (tptp.ssItem tptp.skac3))
% 26.37/26.64 (assume a9 (tptp.ssItem tptp.skac2))
% 26.37/26.64 (assume a10 (not (tptp.singletonP tptp.nil)))
% 26.37/26.64 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 26.37/26.64 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 26.37/26.64 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 26.37/26.64 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 26.37/26.64 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 26.37/26.64 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 26.37/26.64 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 26.37/26.64 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 26.37/26.64 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 26.37/26.64 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 26.37/26.64 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 26.37/26.64 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 26.37/26.64 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 26.37/26.64 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 26.37/26.64 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 26.37/26.64 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 26.37/26.64 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 26.37/26.64 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 26.37/26.64 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 26.37/26.64 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 26.37/26.64 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 26.37/26.64 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 26.37/26.64 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 26.37/26.64 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 26.37/26.64 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 26.37/26.64 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 26.37/26.64 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 26.37/26.64 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 26.37/26.64 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 26.37/26.64 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 26.37/26.64 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 26.37/26.64 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 26.37/26.64 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 26.37/26.64 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 26.37/26.64 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 26.37/26.64 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 26.37/26.64 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 26.37/26.64 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 26.37/26.64 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 26.37/26.64 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 26.37/26.64 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 26.37/26.64 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 26.37/26.64 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 26.37/26.64 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 26.37/26.64 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 26.37/26.64 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.37/26.64 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 26.37/26.64 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 26.37/26.64 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 26.37/26.64 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 26.37/26.64 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 26.37/26.64 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.37/26.64 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 26.37/26.64 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.37/26.64 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 26.37/26.64 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 26.37/26.64 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 26.37/26.64 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.37/26.64 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.37/26.64 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.37/26.64 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.37/26.64 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 26.37/26.64 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.37/26.64 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 26.37/26.64 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.37/26.64 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 26.37/26.64 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.37/26.64 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.37/26.64 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.37/26.64 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 26.37/26.64 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 26.37/26.64 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 26.37/26.64 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 26.37/26.64 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 26.37/26.64 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.37/26.64 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.37/26.64 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.37/26.64 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.37/26.64 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 26.37/26.64 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 26.37/26.64 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.37/26.64 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.37/26.64 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 26.37/26.64 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 26.37/26.64 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 26.37/26.64 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 26.37/26.64 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 26.37/26.64 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 26.37/26.64 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 26.37/26.64 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 26.37/26.64 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 26.37/26.64 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 26.37/26.64 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 26.37/26.64 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.37/26.64 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 26.37/26.64 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 26.37/26.64 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 26.37/26.64 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 26.37/26.64 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 26.37/26.64 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.37/26.64 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.37/26.64 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 26.37/26.64 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 26.37/26.64 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 26.37/26.64 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 26.37/26.64 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 26.37/26.64 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 26.37/26.64 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 26.37/26.64 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 26.37/26.64 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 26.37/26.64 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 26.37/26.64 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 26.37/26.64 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 26.37/26.64 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 26.37/26.64 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 26.37/26.64 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 26.37/26.64 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 26.37/26.64 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 26.37/26.64 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 26.37/26.64 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 26.37/26.64 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 26.37/26.64 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 26.37/26.64 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 26.37/26.64 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 26.37/26.64 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 26.37/26.64 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 26.37/26.64 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 26.37/26.64 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 26.37/26.64 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 26.37/26.64 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 26.37/26.64 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 26.37/26.64 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 26.37/26.64 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 26.37/26.64 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 26.37/26.64 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 26.37/26.64 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 26.37/26.64 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 26.37/26.64 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 26.37/26.64 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 26.37/26.64 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 26.37/26.64 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 26.37/26.64 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 26.37/26.64 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 26.37/26.64 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 26.37/26.64 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 26.37/26.64 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 26.37/26.64 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 26.37/26.64 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 26.37/26.64 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 26.37/26.64 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 26.37/26.64 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 26.37/26.64 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 26.37/26.64 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 26.37/26.64 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 26.37/26.64 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 26.37/26.64 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 26.37/26.64 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 26.37/26.64 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 26.37/26.64 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 26.37/26.64 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 26.37/26.64 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 26.37/26.64 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 26.37/26.64 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 26.37/26.64 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 26.37/26.64 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 26.37/26.64 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 26.37/26.64 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 26.37/26.64 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 26.37/26.64 (assume a185 (tptp.ssList tptp.sk1))
% 26.37/26.64 (assume a186 (tptp.ssList tptp.sk2))
% 26.37/26.64 (assume a187 (tptp.ssList tptp.sk3))
% 26.37/26.64 (assume a188 (tptp.ssList tptp.sk4))
% 26.37/26.64 (assume a189 (= tptp.sk2 tptp.sk4))
% 26.37/26.64 (assume a190 (= tptp.sk1 tptp.sk3))
% 26.37/26.64 (assume a191 (tptp.ssList tptp.sk5))
% 26.37/26.64 (assume a192 (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4))
% 26.37/26.64 (assume a193 (tptp.strictorderedP tptp.sk3))
% 26.37/26.64 (assume a194 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))))
% 26.37/26.64 (assume a195 (tptp.ssItem tptp.sk6))
% 26.37/26.64 (assume a196 (tptp.ssItem tptp.sk7))
% 26.37/26.64 (assume a197 (tptp.ssList tptp.sk8))
% 26.37/26.64 (assume a198 (tptp.ssList tptp.sk9))
% 26.37/26.64 (assume a199 (tptp.ssList tptp.sk10))
% 26.37/26.64 (assume a200 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) tptp.sk1))
% 26.37/26.64 (assume a201 (tptp.leq tptp.sk7 tptp.sk6))
% 26.37/26.64 (assume a202 (or (tptp.ssItem tptp.sk11) (not (tptp.leq tptp.sk6 tptp.sk7))))
% 26.37/26.64 (assume a203 (or (tptp.memberP tptp.sk9 tptp.sk11) (not (tptp.leq tptp.sk6 tptp.sk7))))
% 26.37/26.64 (assume a204 (or (not (tptp.leq tptp.sk6 tptp.sk11)) (not (tptp.leq tptp.sk11 tptp.sk7)) (not (tptp.leq tptp.sk6 tptp.sk7))))
% 26.37/26.64 (assume a205 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 26.37/26.64 (step t1 (cl (not (= (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (or (not (= tptp.sk6 tptp.sk7)) (tptp.lt tptp.sk6 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk7))))) (not (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7)))) (or (not (= tptp.sk6 tptp.sk7)) (tptp.lt tptp.sk6 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk7)))) :rule equiv_pos2)
% 26.37/26.64 (step t2 (cl (= (not (= tptp.sk6 tptp.sk7)) (not (= tptp.sk6 tptp.sk7)))) :rule refl)
% 26.37/26.64 (step t3 (cl (= (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) true) (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 26.37/26.64 (step t4 (cl (not (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) true)) (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6))) :rule equiv1 :premises (t3))
% 26.37/26.64 (step t5 (cl (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) (= (tptp.lt tptp.sk6 tptp.sk6) (not (not (tptp.lt tptp.sk6 tptp.sk6)))))) :rule all_simplify)
% 26.37/26.64 (step t6 (cl (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk6))) :rule refl)
% 26.37/26.64 (step t7 (cl (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6))) :rule all_simplify)
% 26.37/26.64 (step t8 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk6)))) :rule cong :premises (t6 t7))
% 26.37/26.64 (step t9 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk6)) true)) :rule all_simplify)
% 26.37/26.64 (step t10 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) true)) :rule trans :premises (t8 t9))
% 26.37/26.64 (step t11 (cl (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) true)) :rule trans :premises (t5 t10))
% 26.37/26.64 (step t12 (cl (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6))) :rule resolution :premises (t4 t11))
% 26.37/26.64 (step t13 (cl (= (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.lt tptp.sk6 tptp.sk7)))) :rule refl)
% 26.37/26.64 (step t14 (cl (= (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (or (not (= tptp.sk6 tptp.sk7)) (tptp.lt tptp.sk6 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk7))))) :rule cong :premises (t2 t12 t13))
% 26.37/26.64 (step t15 (cl (not (= (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))))) (not (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)))) :rule equiv_pos2)
% 26.37/26.64 (step t16 (cl (= (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)))) :rule refl)
% 26.37/26.64 (step t17 (cl (= (= (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))))) :rule equiv_simplify)
% 26.37/26.64 (step t18 (cl (= (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (not (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))))) :rule equiv2 :premises (t17))
% 26.37/26.64 (step t19 (cl (not (not (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))))) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule not_not)
% 26.37/26.64 (step t20 (cl (= (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule resolution :premises (t18 t19))
% 26.37/26.64 (step t21 (cl (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t22)
% 26.37/26.64 (assume t22.a0 (not (tptp.lt tptp.sk6 tptp.sk6)))
% 26.37/26.64 (assume t22.a1 (= tptp.sk6 tptp.sk7))
% 26.37/26.64 (assume t22.a2 (tptp.lt tptp.sk6 tptp.sk7))
% 26.37/26.64 (step t22.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 26.37/26.64 (step t22.t2 (cl (= (= true false) false)) :rule all_simplify)
% 26.37/26.64 (step t22.t3 (cl (= (= (tptp.lt tptp.sk6 tptp.sk7) true) (tptp.lt tptp.sk6 tptp.sk7))) :rule equiv_simplify)
% 26.37/26.64 (step t22.t4 (cl (= (tptp.lt tptp.sk6 tptp.sk7) true) (not (tptp.lt tptp.sk6 tptp.sk7))) :rule equiv2 :premises (t22.t3))
% 26.37/26.64 (step t22.t5 (cl (= (tptp.lt tptp.sk6 tptp.sk7) true)) :rule resolution :premises (t22.t4 t22.a2))
% 26.37/26.64 (step t22.t6 (cl (= true (tptp.lt tptp.sk6 tptp.sk7))) :rule symm :premises (t22.t5))
% 26.37/26.64 (step t22.t7 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 26.37/26.64 (step t22.t8 (cl (= tptp.sk7 tptp.sk6)) :rule symm :premises (t22.a1))
% 26.37/26.64 (step t22.t9 (cl (= (tptp.lt tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk6))) :rule cong :premises (t22.t7 t22.t8))
% 26.37/26.64 (step t22.t10 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) false) (not (tptp.lt tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 26.37/26.64 (step t22.t11 (cl (= (tptp.lt tptp.sk6 tptp.sk6) false) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) :rule equiv2 :premises (t22.t10))
% 26.37/26.64 (step t22.t12 (cl (not (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (tptp.lt tptp.sk6 tptp.sk6)) :rule not_not)
% 26.37/26.64 (step t22.t13 (cl (= (tptp.lt tptp.sk6 tptp.sk6) false) (tptp.lt tptp.sk6 tptp.sk6)) :rule resolution :premises (t22.t11 t22.t12))
% 26.37/26.64 (step t22.t14 (cl (= (tptp.lt tptp.sk6 tptp.sk6) false)) :rule resolution :premises (t22.t13 t22.a0))
% 26.37/26.64 (step t22.t15 (cl (= true false)) :rule trans :premises (t22.t6 t22.t9 t22.t14))
% 26.37/26.64 (step t22.t16 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t15))
% 26.37/26.64 (step t22 (cl (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (= tptp.sk6 tptp.sk7)) (not (tptp.lt tptp.sk6 tptp.sk7)) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 26.37/26.64 (step t23 (cl (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (tptp.lt tptp.sk6 tptp.sk6))) :rule and_pos)
% 26.37/26.64 (step t24 (cl (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (= tptp.sk6 tptp.sk7)) :rule and_pos)
% 26.37/26.64 (step t25 (cl (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (tptp.lt tptp.sk6 tptp.sk7)) :rule and_pos)
% 26.37/26.64 (step t26 (cl false (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t22 t23 t24 t25))
% 26.37/26.64 (step t27 (cl (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) false) :rule reordering :premises (t26))
% 26.37/26.64 (step t28 (cl (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) false) :rule contraction :premises (t27))
% 26.37/26.64 (step t29 (cl (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) false) :rule resolution :premises (t21 t28))
% 26.37/26.64 (step t30 (cl (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (not false)) :rule implies_neg2)
% 26.37/26.64 (step t31 (cl (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false)) :rule resolution :premises (t29 t30))
% 26.37/26.64 (step t32 (cl (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false)) :rule contraction :premises (t31))
% 26.37/26.64 (step t33 (cl (= (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))))) :rule implies_simplify)
% 26.37/26.64 (step t34 (cl (not (=> (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false)) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) :rule equiv1 :premises (t33))
% 26.37/26.64 (step t35 (cl (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t32 t34))
% 26.37/26.64 (step t36 (cl (= (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) false)) :rule resolution :premises (t20 t35))
% 26.37/26.64 (step t37 (cl (= (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) false))) :rule cong :premises (t16 t36))
% 26.37/26.64 (step t38 (cl (= (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) false) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))))) :rule all_simplify)
% 26.37/26.64 (step t39 (cl (= (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))))) :rule trans :premises (t37 t38))
% 26.37/26.64 (step t40 (cl (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t41)
% 26.37/26.64 (assume t41.a0 (= tptp.sk6 tptp.sk7))
% 26.37/26.64 (assume t41.a1 (not (tptp.lt tptp.sk6 tptp.sk6)))
% 26.37/26.64 (assume t41.a2 (tptp.lt tptp.sk6 tptp.sk7))
% 26.37/26.64 (step t41.t1 (cl (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (= tptp.sk6 tptp.sk7)) (not (tptp.lt tptp.sk6 tptp.sk7))) :rule and_neg)
% 26.37/26.64 (step t41.t2 (cl (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule resolution :premises (t41.t1 t41.a1 t41.a0 t41.a2))
% 26.37/26.64 (step t41 (cl (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 26.37/26.64 (step t42 (cl (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (= tptp.sk6 tptp.sk7)) :rule and_pos)
% 26.37/26.64 (step t43 (cl (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (not (tptp.lt tptp.sk6 tptp.sk6))) :rule and_pos)
% 26.37/26.64 (step t44 (cl (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (tptp.lt tptp.sk6 tptp.sk7)) :rule and_pos)
% 26.37/26.64 (step t45 (cl (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t41 t42 t43 t44))
% 26.37/26.64 (step t46 (cl (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule reordering :premises (t45))
% 26.37/26.64 (step t47 (cl (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7))) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule contraction :premises (t46))
% 26.37/26.64 (step t48 (cl (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) :rule resolution :premises (t40 t47))
% 26.37/26.64 (step t49 (cl (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (not (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) :rule implies_neg2)
% 26.37/26.64 (step t50 (cl (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7))) (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t48 t49))
% 26.37/26.64 (step t51 (cl (=> (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)) (and (not (tptp.lt tptp.sk6 tptp.sk6)) (= tptp.sk6 tptp.sk7) (tptp.lt tptp.sk6 tptp.sk7)))) :rule contraction :premises (t50))
% 26.37/26.64 (step t52 (cl (not (and (= tptp.sk6 tptp.sk7) (not (tptp.lt tptp.sk6 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t15 t39 t51))
% 26.37/26.64 (step t53 (cl (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) :rule not_and :premises (t52))
% 26.37/26.64 (step t54 (cl (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (not (not (= tptp.sk6 tptp.sk7)))) :rule or_neg)
% 26.37/26.64 (step t55 (cl (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (not (not (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule or_neg)
% 26.37/26.64 (step t56 (cl (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (not (not (tptp.lt tptp.sk6 tptp.sk7)))) :rule or_neg)
% 26.37/26.64 (step t57 (cl (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7))) (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t53 t54 t55 t56))
% 26.37/26.64 (step t58 (cl (or (not (= tptp.sk6 tptp.sk7)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) (not (tptp.lt tptp.sk6 tptp.sk7)))) :rule contraction :premises (t57))
% 26.37/26.64 (step t59 (cl (or (not (= tptp.sk6 tptp.sk7)) (tptp.lt tptp.sk6 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t1 t14 t58))
% 26.37/26.64 (step t60 (cl (not (= tptp.sk6 tptp.sk7)) (tptp.lt tptp.sk6 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk7))) :rule or :premises (t59))
% 26.37/26.64 (step t61 (cl (not (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7))) (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7)) :rule or_pos)
% 26.37/26.64 (step t62 (cl (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk7)) (not (tptp.leq tptp.sk7 tptp.sk6)) (= tptp.sk6 tptp.sk7) (not (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7)))) :rule reordering :premises (t61))
% 26.37/26.64 (step t63 (cl (not (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7)) :rule or_pos)
% 26.37/26.64 (step t64 (cl (tptp.leq tptp.sk6 tptp.sk7) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk7)) (not (tptp.lt tptp.sk6 tptp.sk7)) (not (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7)))) :rule reordering :premises (t63))
% 26.37/26.64 (step t65 (cl (not (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7)) :rule or_pos)
% 26.37/26.64 (step t66 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk10)) (tptp.lt tptp.sk6 tptp.sk7) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7)))) :rule reordering :premises (t65))
% 26.37/26.64 (step t67 (cl (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule and_neg)
% 26.37/26.64 (step t68 (cl (=> (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t69)
% 26.37/26.64 (assume t69.a0 (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))
% 26.37/26.64 (assume t69.a1 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.37/26.64 (assume t69.a2 (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))
% 26.37/26.64 (assume t69.a3 (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.37/26.64 (assume t69.a4 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))
% 26.37/26.64 (step t69.t1 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t69.t2)
% 26.37/26.64 (assume t69.t2.a0 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))
% 26.37/26.64 (assume t69.t2.a1 (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.37/26.64 (assume t69.t2.a2 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.37/26.64 (assume t69.t2.a3 (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))
% 26.37/26.64 (assume t69.t2.a4 (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))
% 26.37/26.64 (step t69.t2.t1 (cl (= (= (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) true) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule equiv_simplify)
% 26.37/26.64 (step t69.t2.t2 (cl (not (= (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) true)) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule equiv1 :premises (t69.t2.t1))
% 26.37/26.64 (step t69.t2.t3 (cl (= tptp.sk8 tptp.sk8)) :rule refl)
% 26.37/26.64 (step t69.t2.t4 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))) :rule symm :premises (t69.t2.a2))
% 26.37/26.64 (step t69.t2.t5 (cl (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule symm :premises (t69.t2.t4))
% 26.37/26.64 (step t69.t2.t6 (cl (= (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule cong :premises (t69.t2.t3 t69.t2.t5))
% 26.37/26.64 (step t69.t2.t7 (cl (= (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (t69.t2.a1))
% 26.37/26.64 (step t69.t2.t8 (cl (= (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule trans :premises (t69.t2.t6 t69.t2.t7))
% 26.37/26.64 (step t69.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))) :rule symm :premises (t69.t2.a3))
% 26.37/26.64 (step t69.t2.t10 (cl (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule symm :premises (t69.t2.t9))
% 26.37/26.64 (step t69.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule cong :premises (t69.t2.t8 t69.t2.t10))
% 26.37/26.64 (step t69.t2.t12 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule symm :premises (t69.t2.a0))
% 26.37/26.64 (step t69.t2.t13 (cl (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule trans :premises (t69.t2.t11 t69.t2.t12))
% 26.37/26.64 (step t69.t2.t14 (cl (= (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule cong :premises (t69.t2.t13))
% 26.37/26.64 (step t69.t2.t15 (cl (= (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) true) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule equiv_simplify)
% 26.37/26.64 (step t69.t2.t16 (cl (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) true) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule equiv2 :premises (t69.t2.t15))
% 26.37/26.64 (step t69.t2.t17 (cl (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) true)) :rule resolution :premises (t69.t2.t16 t69.t2.a4))
% 26.37/26.64 (step t69.t2.t18 (cl (= (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) true)) :rule trans :premises (t69.t2.t14 t69.t2.t17))
% 26.37/26.64 (step t69.t2.t19 (cl (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t69.t2.t2 t69.t2.t18))
% 26.37/26.64 (step t69.t2 (cl (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule subproof :discharge (t69.t2.a0 t69.t2.a1 t69.t2.a2 t69.t2.a3 t69.t2.a4))
% 26.37/26.64 (step t69.t3 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule and_pos)
% 26.37/26.64 (step t69.t4 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.37/26.64 (step t69.t5 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.37/26.64 (step t69.t6 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t69.t7 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t69.t8 (cl (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))))) :rule resolution :premises (t69.t2 t69.t3 t69.t4 t69.t5 t69.t6 t69.t7))
% 26.37/26.64 (step t69.t9 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule reordering :premises (t69.t8))
% 26.37/26.64 (step t69.t10 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule contraction :premises (t69.t9))
% 26.37/26.64 (step t69.t11 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t69.t1 t69.t10))
% 26.37/26.64 (step t69.t12 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule implies_neg2)
% 26.37/26.64 (step t69.t13 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule resolution :premises (t69.t11 t69.t12))
% 26.37/26.64 (step t69.t14 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule contraction :premises (t69.t13))
% 26.37/26.64 (step t69.t15 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule implies :premises (t69.t14))
% 26.37/26.64 (step t69.t16 (cl (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule and_neg)
% 26.37/26.64 (step t69.t17 (cl (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule resolution :premises (t69.t16 t69.a4 t69.a3 t69.a1 t69.a2 t69.a0))
% 26.37/26.64 (step t69.t18 (cl (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t69.t15 t69.t17))
% 26.37/26.64 (step t69 (cl (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule subproof :discharge (t69.a0 t69.a1 t69.a2 t69.a3 t69.a4))
% 26.37/26.64 (step t70 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t71 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.37/26.64 (step t72 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t73 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.37/26.64 (step t74 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule and_pos)
% 26.37/26.64 (step t75 (cl (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule resolution :premises (t69 t70 t71 t72 t73 t74))
% 26.37/26.64 (step t76 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule reordering :premises (t75))
% 26.37/26.64 (step t77 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule contraction :premises (t76))
% 26.37/26.64 (step t78 (cl (=> (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t68 t77))
% 26.37/26.64 (step t79 (cl (=> (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule implies_neg2)
% 26.37/26.64 (step t80 (cl (=> (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule resolution :premises (t78 t79))
% 26.37/26.64 (step t81 (cl (=> (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule contraction :premises (t80))
% 26.37/26.64 (step t82 (cl (not (and (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule implies :premises (t81))
% 26.37/26.64 (step t83 (cl (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t67 t82))
% 26.37/26.64 (step t84 (cl (not (= (tptp.strictorderedP tptp.sk3) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (tptp.strictorderedP tptp.sk3)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule equiv_pos2)
% 26.37/26.64 (step t85 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.37/26.64 (step t86 (cl (not (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule equiv_pos2)
% 26.37/26.64 (step t87 (cl (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.37/26.64 (step t88 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (a192))
% 26.37/26.64 (step t89 (cl (and (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t87 t88 a190 a189))
% 26.37/26.64 (step t90 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t89))
% 26.37/26.64 (step t91 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule refl)
% 26.37/26.64 (step t92 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule cong :premises (t90 t91))
% 26.37/26.64 (step t93 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule symm :premises (a200))
% 26.37/26.64 (step t94 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule resolution :premises (t86 t92 t93))
% 26.37/26.64 (step t95 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t85 t94 t88 a190 a189))
% 26.37/26.64 (step t96 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule and :premises (t95))
% 26.37/26.64 (step t97 (cl (= (tptp.strictorderedP tptp.sk3) (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule cong :premises (t96))
% 26.37/26.64 (step t98 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule resolution :premises (t84 t97 a193))
% 26.37/26.64 (step t99 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule or_pos)
% 26.37/26.64 (step t100 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule reordering :premises (t99))
% 26.37/26.64 (step t101 (cl (not (= (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) (not (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule equiv_pos2)
% 26.37/26.64 (step t102 (cl (= (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)))) (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)))))) :rule refl)
% 26.37/26.64 (step t103 (cl (= (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule refl)
% 26.37/26.64 (step t104 (cl (= (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk9)))) :rule refl)
% 26.37/26.64 (step t105 (cl (= (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule all_simplify)
% 26.37/26.64 (step t106 (cl (= (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule cong :premises (t103 t104 t105))
% 26.37/26.64 (step t107 (cl (= (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule cong :premises (t102 t106))
% 26.37/26.64 (step t108 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (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))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t109)
% 26.37/26.64 (assume t109.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 26.37/26.64 (step t109.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk9)))
% 26.37/26.64 (step t109.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule or :premises (t109.t1))
% 26.37/26.64 (step t109.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t109.t2 t109.a0))
% 26.37/26.64 (step t109 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule subproof :discharge (t109.a0))
% 26.37/26.64 (step t110 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t108 t109))
% 26.37/26.64 (step t111 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule implies_neg2)
% 26.37/26.64 (step t112 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule resolution :premises (t110 t111))
% 26.37/26.64 (step t113 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule contraction :premises (t112))
% 26.37/26.64 (step t114 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t101 t107 t113))
% 26.37/26.64 (step t115 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule implies :premises (t114))
% 26.37/26.64 (step t116 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule resolution :premises (t115 a119))
% 26.37/26.64 (step t117 (cl (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule resolution :premises (t100 a195 a198 t116))
% 26.37/26.64 (step t118 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule or_pos)
% 26.37/26.64 (step t119 (cl (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule reordering :premises (t118))
% 26.37/26.64 (step t120 (cl (not (= (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) (not (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))))) (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule equiv_pos2)
% 26.37/26.64 (step t121 (cl (= (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk7)))) :rule refl)
% 26.37/26.64 (step t122 (cl (= (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk10)))) :rule refl)
% 26.37/26.64 (step t123 (cl (= (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule all_simplify)
% 26.37/26.64 (step t124 (cl (= (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule cong :premises (t121 t122 t123))
% 26.37/26.64 (step t125 (cl (= (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule cong :premises (t102 t124))
% 26.37/26.64 (step t126 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) (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))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t127)
% 26.37/26.64 (assume t127.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 26.37/26.64 (step t127.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk10)))
% 26.37/26.64 (step t127.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) :rule or :premises (t127.t1))
% 26.37/26.64 (step t127.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t127.t2 t127.a0))
% 26.37/26.64 (step t127 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) :rule subproof :discharge (t127.a0))
% 26.37/26.64 (step t128 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t126 t127))
% 26.37/26.64 (step t129 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))))) :rule implies_neg2)
% 26.37/26.64 (step t130 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))))) :rule resolution :premises (t128 t129))
% 26.37/26.64 (step t131 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))))) :rule contraction :premises (t130))
% 26.37/26.64 (step t132 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule resolution :premises (t120 t125 t131))
% 26.37/26.64 (step t133 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule implies :premises (t132))
% 26.37/26.64 (step t134 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk10)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule resolution :premises (t133 a119))
% 26.37/26.64 (step t135 (cl (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule resolution :premises (t119 a196 a199 t134))
% 26.37/26.64 (step t136 (cl (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule or_pos)
% 26.37/26.64 (step t137 (cl (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule reordering :premises (t136))
% 26.37/26.64 (step t138 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule or_pos)
% 26.37/26.64 (step t139 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule reordering :premises (t138))
% 26.37/26.64 (step t140 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t141)
% 26.37/26.64 (assume t141.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.37/26.64 (step t141.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil)))
% 26.37/26.64 (step t141.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t141.t1))
% 26.37/26.64 (step t141.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t141.t2 t141.a0))
% 26.37/26.64 (step t141 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t141.a0))
% 26.37/26.64 (step t142 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t140 t141))
% 26.37/26.64 (step t143 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 26.37/26.64 (step t144 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t142 t143))
% 26.37/26.64 (step t145 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t144))
% 26.37/26.64 (step t146 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t145))
% 26.37/26.64 (step t147 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t146 a85))
% 26.37/26.64 (step t148 (cl (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t139 a7 a195 t147))
% 26.37/26.64 (step t149 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t150)
% 26.37/26.64 (assume t150.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 26.37/26.64 (step t150.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule forall_inst :args ((:= U tptp.sk9) (:= V (tptp.cons tptp.sk6 tptp.nil)) (:= W tptp.sk8)))
% 26.37/26.64 (step t150.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule or :premises (t150.t1))
% 26.37/26.64 (step t150.t3 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t150.t2 t150.a0))
% 26.37/26.64 (step t150 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule subproof :discharge (t150.a0))
% 26.37/26.64 (step t151 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t149 t150))
% 26.37/26.64 (step t152 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule implies_neg2)
% 26.37/26.64 (step t153 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule resolution :premises (t151 t152))
% 26.37/26.64 (step t154 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule contraction :premises (t153))
% 26.37/26.64 (step t155 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule implies :premises (t154))
% 26.37/26.64 (step t156 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t155 a148))
% 26.37/26.64 (step t157 (cl (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule resolution :premises (t137 a197 a198 t148 t156))
% 26.37/26.64 (step t158 (cl (not (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule or_pos)
% 26.37/26.64 (step t159 (cl (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule reordering :premises (t158))
% 26.37/26.64 (step t160 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) :rule or_pos)
% 26.37/26.64 (step t161 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule reordering :premises (t160))
% 26.37/26.64 (step t162 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t163)
% 26.37/26.64 (assume t163.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.37/26.64 (step t163.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 26.37/26.64 (step t163.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule or :premises (t163.t1))
% 26.37/26.64 (step t163.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t163.t2 t163.a0))
% 26.37/26.64 (step t163 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule subproof :discharge (t163.a0))
% 26.37/26.64 (step t164 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t162 t163))
% 26.37/26.64 (step t165 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule implies_neg2)
% 26.37/26.64 (step t166 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t164 t165))
% 26.37/26.64 (step t167 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule contraction :premises (t166))
% 26.37/26.64 (step t168 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule implies :premises (t167))
% 26.37/26.64 (step t169 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t168 a85))
% 26.37/26.64 (step t170 (cl (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) :rule resolution :premises (t161 a7 a196 t169))
% 26.37/26.64 (step t171 (cl (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule or_pos)
% 26.37/26.64 (step t172 (cl (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule reordering :premises (t171))
% 26.37/26.64 (step t173 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) :rule or_pos)
% 26.37/26.64 (step t174 (cl (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))) (not (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))))) :rule reordering :premises (t173))
% 26.37/26.64 (step t175 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t176)
% 26.37/26.64 (assume t176.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.37/26.64 (step t176.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk6 tptp.nil)) (:= V tptp.sk8)))
% 26.37/26.64 (step t176.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) :rule or :premises (t176.t1))
% 26.37/26.64 (step t176.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t176.t2 t176.a0))
% 26.37/26.64 (step t176 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) :rule subproof :discharge (t176.a0))
% 26.37/26.64 (step t177 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t175 t176))
% 26.37/26.64 (step t178 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))))) :rule implies_neg2)
% 26.37/26.64 (step t179 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))))) :rule resolution :premises (t177 t178))
% 26.37/26.64 (step t180 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))))) :rule contraction :premises (t179))
% 26.37/26.64 (step t181 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) :rule implies :premises (t180))
% 26.37/26.64 (step t182 (cl (or (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList tptp.sk8)) (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t181 a84))
% 26.37/26.64 (step t183 (cl (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t174 a197 t148 t182))
% 26.37/26.64 (step t184 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t185)
% 26.37/26.64 (assume t185.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.37/26.64 (step t185.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule forall_inst :args ((:= U tptp.sk9) (:= V (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))))
% 26.37/26.64 (step t185.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule or :premises (t185.t1))
% 26.37/26.64 (step t185.t3 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule resolution :premises (t185.t2 t185.a0))
% 26.37/26.64 (step t185 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule subproof :discharge (t185.a0))
% 26.37/26.64 (step t186 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule resolution :premises (t184 t185))
% 26.37/26.64 (step t187 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule implies_neg2)
% 26.37/26.64 (step t188 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule resolution :premises (t186 t187))
% 26.37/26.64 (step t189 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))) :rule contraction :premises (t188))
% 26.37/26.64 (step t190 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule implies :premises (t189))
% 26.37/26.64 (step t191 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule resolution :premises (t190 a84))
% 26.37/26.64 (step t192 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t172 a198 t183 t191))
% 26.37/26.64 (step t193 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t194)
% 26.37/26.64 (assume t194.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 26.37/26.64 (step t194.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule forall_inst :args ((:= U tptp.sk10) (:= V (tptp.cons tptp.sk7 tptp.nil)) (:= W (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))))
% 26.37/26.64 (step t194.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule or :premises (t194.t1))
% 26.37/26.64 (step t194.t3 (cl (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule resolution :premises (t194.t2 t194.a0))
% 26.37/26.64 (step t194 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule subproof :discharge (t194.a0))
% 26.37/26.64 (step t195 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule resolution :premises (t193 t194))
% 26.37/26.64 (step t196 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule implies_neg2)
% 26.37/26.64 (step t197 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule resolution :premises (t195 t196))
% 26.37/26.64 (step t198 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule contraction :premises (t197))
% 26.37/26.64 (step t199 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule implies :premises (t198))
% 26.37/26.64 (step t200 (cl (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule resolution :premises (t199 a148))
% 26.37/26.64 (step t201 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule resolution :premises (t159 a199 t170 t192 t200))
% 26.37/26.64 (step t202 (cl (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t83 t98 t117 t135 t157 t201))
% 26.37/26.64 (step t203 (cl (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule and_neg)
% 26.37/26.64 (step t204 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t205)
% 26.37/26.64 (assume t205.a0 (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))
% 26.37/26.64 (assume t205.a1 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.37/26.64 (assume t205.a2 (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))
% 26.37/26.64 (assume t205.a3 (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.37/26.64 (assume t205.a4 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))
% 26.37/26.64 (step t205.t1 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t205.t2)
% 26.37/26.64 (assume t205.t2.a0 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))
% 26.37/26.64 (assume t205.t2.a1 (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.37/26.64 (assume t205.t2.a2 (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))
% 26.37/26.64 (assume t205.t2.a3 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.37/26.64 (assume t205.t2.a4 (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))
% 26.37/26.64 (step t205.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) true) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule equiv_simplify)
% 26.37/26.64 (step t205.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) true)) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule equiv1 :premises (t205.t2.t1))
% 26.37/26.64 (step t205.t2.t3 (cl (= tptp.sk8 tptp.sk8)) :rule refl)
% 26.37/26.64 (step t205.t2.t4 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))) :rule symm :premises (t205.t2.a3))
% 26.37/26.64 (step t205.t2.t5 (cl (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule symm :premises (t205.t2.t4))
% 26.37/26.64 (step t205.t2.t6 (cl (= (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule cong :premises (t205.t2.t3 t205.t2.t5))
% 26.37/26.64 (step t205.t2.t7 (cl (= (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (t205.t2.a1))
% 26.37/26.64 (step t205.t2.t8 (cl (= (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule trans :premises (t205.t2.t6 t205.t2.t7))
% 26.37/26.64 (step t205.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10) (tptp.cons tptp.sk7 tptp.sk10))) :rule symm :premises (t205.t2.a2))
% 26.37/26.64 (step t205.t2.t10 (cl (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule symm :premises (t205.t2.t9))
% 26.37/26.64 (step t205.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule cong :premises (t205.t2.t8 t205.t2.t10))
% 26.37/26.64 (step t205.t2.t12 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule symm :premises (t205.t2.a0))
% 26.37/26.64 (step t205.t2.t13 (cl (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule trans :premises (t205.t2.t11 t205.t2.t12))
% 26.37/26.64 (step t205.t2.t14 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule cong :premises (t205.t2.t13))
% 26.37/26.64 (step t205.t2.t15 (cl (= (= (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) true) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule equiv_simplify)
% 26.37/26.64 (step t205.t2.t16 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) true) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule equiv2 :premises (t205.t2.t15))
% 26.37/26.64 (step t205.t2.t17 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) true)) :rule resolution :premises (t205.t2.t16 t205.t2.a4))
% 26.37/26.64 (step t205.t2.t18 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) true)) :rule trans :premises (t205.t2.t14 t205.t2.t17))
% 26.37/26.64 (step t205.t2.t19 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t205.t2.t2 t205.t2.t18))
% 26.37/26.64 (step t205.t2 (cl (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule subproof :discharge (t205.t2.a0 t205.t2.a1 t205.t2.a2 t205.t2.a3 t205.t2.a4))
% 26.37/26.64 (step t205.t3 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule and_pos)
% 26.37/26.64 (step t205.t4 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.37/26.64 (step t205.t5 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t205.t6 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.37/26.64 (step t205.t7 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t205.t8 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))))) :rule resolution :premises (t205.t2 t205.t3 t205.t4 t205.t5 t205.t6 t205.t7))
% 26.37/26.64 (step t205.t9 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule reordering :premises (t205.t8))
% 26.37/26.64 (step t205.t10 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule contraction :premises (t205.t9))
% 26.37/26.64 (step t205.t11 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t205.t1 t205.t10))
% 26.37/26.64 (step t205.t12 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule implies_neg2)
% 26.37/26.64 (step t205.t13 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule resolution :premises (t205.t11 t205.t12))
% 26.37/26.64 (step t205.t14 (cl (=> (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule contraction :premises (t205.t13))
% 26.37/26.64 (step t205.t15 (cl (not (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule implies :premises (t205.t14))
% 26.37/26.64 (step t205.t16 (cl (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule and_neg)
% 26.37/26.64 (step t205.t17 (cl (and (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule resolution :premises (t205.t16 t205.a4 t205.a3 t205.a2 t205.a1 t205.a0))
% 26.37/26.64 (step t205.t18 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t205.t15 t205.t17))
% 26.37/26.64 (step t205 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule subproof :discharge (t205.a0 t205.a1 t205.a2 t205.a3 t205.a4))
% 26.37/26.64 (step t206 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t207 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.37/26.64 (step t208 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) :rule and_pos)
% 26.37/26.64 (step t209 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.37/26.64 (step t210 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) :rule and_pos)
% 26.37/26.64 (step t211 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))))) :rule resolution :premises (t205 t206 t207 t208 t209 t210))
% 26.37/26.64 (step t212 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule reordering :premises (t211))
% 26.37/26.64 (step t213 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule contraction :premises (t212))
% 26.37/26.64 (step t214 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t204 t213))
% 26.37/26.64 (step t215 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule implies_neg2)
% 26.37/26.64 (step t216 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule resolution :premises (t214 t215))
% 26.37/26.64 (step t217 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10))))) :rule contraction :premises (t216))
% 26.37/26.64 (step t218 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)) (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule implies :premises (t217))
% 26.37/26.64 (step t219 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (= (tptp.cons tptp.sk7 tptp.sk10) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10))) (not (= (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10) (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk10)))) (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t203 t218))
% 26.37/26.64 (step t220 (cl (not (= (tptp.ssList tptp.sk1) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) (not (tptp.ssList tptp.sk1)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule equiv_pos2)
% 26.37/26.64 (step t221 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t95))
% 26.37/26.64 (step t222 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule and :premises (t95))
% 26.37/26.64 (step t223 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule trans :premises (t221 t222))
% 26.37/26.64 (step t224 (cl (= (tptp.ssList tptp.sk1) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10)))) :rule cong :premises (t223))
% 26.37/26.64 (step t225 (cl (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.cons tptp.sk7 tptp.nil)) tptp.sk10))) :rule resolution :premises (t220 t224 a185))
% 26.37/26.64 (step t226 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) :rule resolution :premises (t219 t225 t117 t135 t157 t201))
% 26.37/26.64 (step t227 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t228)
% 26.37/26.64 (assume t228.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))
% 26.37/26.64 (step t228.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7)))) :rule forall_inst :args ((:= U tptp.sk8) (:= V tptp.sk6) (:= W tptp.sk9) (:= X tptp.sk7) (:= Y tptp.sk10)))
% 26.37/26.64 (step t228.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) :rule or :premises (t228.t1))
% 26.37/26.64 (step t228.t3 (cl (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) :rule resolution :premises (t228.t2 t228.a0))
% 26.37/26.64 (step t228 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) :rule subproof :discharge (t228.a0))
% 26.37/26.64 (step t229 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) :rule resolution :premises (t227 t228))
% 26.37/26.64 (step t230 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) (not (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7)))) :rule implies_neg2)
% 26.37/26.64 (step t231 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7)))) :rule resolution :premises (t229 t230))
% 26.37/26.64 (step t232 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7)))) :rule contraction :premises (t231))
% 26.37/26.64 (step t233 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) :rule implies :premises (t232))
% 26.37/26.64 (step t234 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule equiv_pos2)
% 26.37/26.64 (anchor :step t235 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y) (Z $$unsorted) (:= Z Z)))
% 26.37/26.64 (step t235.t1 (cl (= U U)) :rule refl)
% 26.37/26.64 (step t235.t2 (cl (= V V)) :rule refl)
% 26.37/26.64 (step t235.t3 (cl (= W W)) :rule refl)
% 26.37/26.64 (step t235.t4 (cl (= X X)) :rule refl)
% 26.37/26.64 (step t235.t5 (cl (= Y Y)) :rule refl)
% 26.37/26.64 (step t235.t6 (cl (= Z Z)) :rule refl)
% 26.37/26.64 (step t235.t7 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z) (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y))))) :rule all_simplify)
% 26.37/26.64 (step t235.t8 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule cong :premises (t235.t7))
% 26.37/26.64 (step t235.t9 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 26.37/26.64 (step t235.t10 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 26.37/26.64 (step t235.t11 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.37/26.64 (step t235.t12 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 26.37/26.64 (step t235.t13 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.37/26.64 (step t235.t14 (cl (= (not (tptp.strictorderedP Z)) (not (tptp.strictorderedP Z)))) :rule refl)
% 26.37/26.64 (step t235.t15 (cl (= (not (tptp.ssList Z)) (not (tptp.ssList Z)))) :rule refl)
% 26.37/26.64 (step t235.t16 (cl (= (tptp.lt V X) (tptp.lt V X))) :rule refl)
% 26.37/26.64 (step t235.t17 (cl (= (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)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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)))) :rule cong :premises (t235.t8 t235.t9 t235.t10 t235.t11 t235.t12 t235.t13 t235.t14 t235.t15 t235.t16))
% 26.37/26.64 (step t235 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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))))) :rule bind)
% 26.37/26.64 (step t236 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule all_simplify)
% 26.37/26.64 (anchor :step t237 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 26.37/26.64 (step t237.t1 (cl (= U U)) :rule refl)
% 26.37/26.64 (step t237.t2 (cl (= V V)) :rule refl)
% 26.37/26.64 (step t237.t3 (cl (= W W)) :rule refl)
% 26.37/26.64 (step t237.t4 (cl (= X X)) :rule refl)
% 26.37/26.64 (step t237.t5 (cl (= Y Y)) :rule refl)
% 26.37/26.64 (step t237.t6 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y))) true)) :rule all_simplify)
% 26.37/26.64 (step t237.t7 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not true))) :rule cong :premises (t237.t6))
% 26.37/26.64 (step t237.t8 (cl (= (not true) false)) :rule all_simplify)
% 26.37/26.64 (step t237.t9 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) false)) :rule trans :premises (t237.t7 t237.t8))
% 26.37/26.64 (step t237.t10 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 26.37/26.64 (step t237.t11 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 26.37/26.64 (step t237.t12 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.37/26.64 (step t237.t13 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 26.37/26.64 (step t237.t14 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.37/26.64 (step t237.t15 (cl (= (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule refl)
% 26.37/26.64 (step t237.t16 (cl (= (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule refl)
% 26.37/26.64 (step t237.t17 (cl (= (tptp.lt V X) (tptp.lt V X))) :rule refl)
% 26.37/26.64 (step t237.t18 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)) (or false (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule cong :premises (t237.t9 t237.t10 t237.t11 t237.t12 t237.t13 t237.t14 t237.t15 t237.t16 t237.t17))
% 26.37/26.64 (step t237.t19 (cl (= (or false (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule all_simplify)
% 26.37/26.64 (step t237.t20 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule trans :premises (t237.t18 t237.t19))
% 26.37/26.64 (step t237 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule bind)
% 26.37/26.64 (step t238 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule trans :premises (t236 t237))
% 26.37/26.64 (step t239 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule trans :premises (t235 t238))
% 26.37/26.64 (step t240 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule resolution :premises (t234 t239 a180))
% 26.37/26.64 (step t241 (cl (or (not (tptp.ssList tptp.sk10)) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.strictorderedP (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk8 (tptp.cons tptp.sk6 tptp.sk9)) (tptp.cons tptp.sk7 tptp.sk10)))) (tptp.lt tptp.sk6 tptp.sk7))) :rule resolution :premises (t233 t240))
% 26.37/26.64 (step t242 (cl (tptp.lt tptp.sk6 tptp.sk7)) :rule resolution :premises (t66 a195 a196 a197 a198 a199 t202 t226 t241))
% 26.37/26.64 (step t243 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t244)
% 26.37/26.64 (assume t244.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 26.37/26.64 (step t244.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7)))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk7)))
% 26.37/26.64 (step t244.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) :rule or :premises (t244.t1))
% 26.37/26.64 (step t244.t3 (cl (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) :rule resolution :premises (t244.t2 t244.a0))
% 26.37/26.64 (step t244 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) :rule subproof :discharge (t244.a0))
% 26.37/26.64 (step t245 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) :rule resolution :premises (t243 t244))
% 26.37/26.64 (step t246 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) (not (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7)))) :rule implies_neg2)
% 26.37/26.64 (step t247 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7)))) :rule resolution :premises (t245 t246))
% 26.37/26.64 (step t248 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7)))) :rule contraction :premises (t247))
% 26.37/26.64 (step t249 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) :rule implies :premises (t248))
% 26.37/26.64 (step t250 (cl (or (not (tptp.lt tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk7))) :rule resolution :premises (t249 a102))
% 26.37/26.64 (step t251 (cl (tptp.leq tptp.sk6 tptp.sk7)) :rule resolution :premises (t64 a195 a196 t242 t250))
% 26.37/26.64 (step t252 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7)))) :rule equiv_pos2)
% 26.37/26.64 (step t253 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))) :rule refl)
% 26.37/26.64 (step t254 (cl (= (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk7 tptp.sk6)))) :rule refl)
% 26.37/26.64 (step t255 (cl (= (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.leq tptp.sk6 tptp.sk7)))) :rule refl)
% 26.37/26.64 (step t256 (cl (= (= tptp.sk7 tptp.sk6) (= tptp.sk6 tptp.sk7))) :rule all_simplify)
% 26.37/26.64 (step t257 (cl (= (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6)) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7)))) :rule cong :premises (t254 t255 t121 t103 t256))
% 26.37/26.64 (step t258 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7))))) :rule cong :premises (t253 t257))
% 26.37/26.64 (step t259 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t260)
% 26.37/26.64 (assume t260.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))
% 26.37/26.64 (step t260.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk6)))
% 26.37/26.64 (step t260.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) :rule or :premises (t260.t1))
% 26.37/26.64 (step t260.t3 (cl (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) :rule resolution :premises (t260.t2 t260.a0))
% 26.37/26.64 (step t260 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) :rule subproof :discharge (t260.a0))
% 26.37/26.64 (step t261 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) :rule resolution :premises (t259 t260))
% 26.37/26.64 (step t262 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) (not (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6)))) :rule implies_neg2)
% 26.37/26.64 (step t263 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6)))) :rule resolution :premises (t261 t262))
% 26.37/26.64 (step t264 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk7 tptp.sk6)))) :rule contraction :premises (t263))
% 26.37/26.64 (step t265 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7)))) :rule resolution :premises (t252 t258 t264))
% 26.37/26.64 (step t266 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7))) :rule implies :premises (t265))
% 26.37/26.64 (step t267 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule equiv_pos2)
% 26.37/26.64 (anchor :step t268 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.37/26.64 (step t268.t1 (cl (= U U)) :rule refl)
% 26.37/26.64 (step t268.t2 (cl (= V V)) :rule refl)
% 26.37/26.64 (step t268.t3 (cl (= (not (tptp.leq U V)) (not (tptp.leq U V)))) :rule refl)
% 26.37/26.64 (step t268.t4 (cl (= (not (tptp.leq V U)) (not (tptp.leq V U)))) :rule refl)
% 26.37/26.64 (step t268.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 26.37/26.64 (step t268.t6 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.37/26.64 (step t268.t7 (cl (= (= V U) (= U V))) :rule all_simplify)
% 26.37/26.64 (step t268.t8 (cl (= (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule cong :premises (t268.t3 t268.t4 t268.t5 t268.t6 t268.t7))
% 26.37/26.64 (step t268 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))) :rule bind)
% 26.37/26.64 (step t269 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule resolution :premises (t267 t268 a129))
% 26.37/26.64 (step t270 (cl (or (not (tptp.leq tptp.sk7 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk6 tptp.sk7))) :rule resolution :premises (t266 t269))
% 26.37/26.64 (step t271 (cl (= tptp.sk6 tptp.sk7)) :rule resolution :premises (t62 t251 a195 a196 a201 t270))
% 26.37/26.64 (step t272 (cl (not (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))) :rule or_pos)
% 26.37/26.64 (step t273 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.lt tptp.sk6 tptp.sk6)) (not (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule reordering :premises (t272))
% 26.37/26.64 (step t274 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) :rule implies_neg1)
% 26.37/26.64 (anchor :step t275)
% 26.37/26.64 (assume t275.a0 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.37/26.64 (step t275.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 26.37/26.64 (step t275.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule or :premises (t275.t1))
% 26.37/26.64 (step t275.t3 (cl (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t275.t2 t275.a0))
% 26.37/26.64 (step t275 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule subproof :discharge (t275.a0))
% 26.37/26.64 (step t276 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t274 t275))
% 26.37/26.64 (step t277 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (not (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule implies_neg2)
% 26.37/26.64 (step t278 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule resolution :premises (t276 t277))
% 26.37/26.64 (step t279 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule contraction :premises (t278))
% 26.37/26.64 (step t280 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule implies :premises (t279))
% 26.37/26.64 (step t281 (cl (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t280 a62))
% 26.37/26.64 (step t282 (cl (not (tptp.lt tptp.sk6 tptp.sk6))) :rule resolution :premises (t273 a195 t281))
% 26.37/26.64 (step t283 (cl) :rule resolution :premises (t60 t271 t242 t282))
% 26.37/26.64
% 26.37/26.64 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.MiQmtsK3Pc/cvc5---1.0.5_32326.smt2
% 26.37/26.65 % cvc5---1.0.5 exiting
% 26.37/26.65 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------