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