TSTP Solution File: SWC383-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC383-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:01:50 EDT 2024
% Result : Unsatisfiable 30.12s 30.29s
% Output : Proof 30.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC383-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.15 % Command : do_cvc5 %s %d
% 0.16/0.36 % Computer : n019.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 16:13:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.44/10.68 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.53/15.71 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.55/20.74 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.52/25.77 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.12/30.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.XW4yZj6lVM/cvc5---1.0.5_32255.smt2
% 30.12/30.29 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.XW4yZj6lVM/cvc5---1.0.5_32255.smt2
% 30.14/30.34 (assume a0 (tptp.equalelemsP tptp.nil))
% 30.14/30.34 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 30.14/30.34 (assume a2 (tptp.strictorderedP tptp.nil))
% 30.14/30.34 (assume a3 (tptp.totalorderedP tptp.nil))
% 30.14/30.34 (assume a4 (tptp.strictorderP tptp.nil))
% 30.14/30.34 (assume a5 (tptp.totalorderP tptp.nil))
% 30.14/30.34 (assume a6 (tptp.cyclefreeP tptp.nil))
% 30.14/30.34 (assume a7 (tptp.ssList tptp.nil))
% 30.14/30.34 (assume a8 (tptp.ssItem tptp.skac3))
% 30.14/30.34 (assume a9 (tptp.ssItem tptp.skac2))
% 30.14/30.34 (assume a10 (not (tptp.singletonP tptp.nil)))
% 30.14/30.34 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 30.14/30.34 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 30.14/30.34 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 30.14/30.34 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 30.14/30.34 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 30.14/30.34 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 30.14/30.34 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 30.14/30.34 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 30.14/30.34 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 30.14/30.34 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 30.14/30.34 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 30.14/30.34 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 30.14/30.34 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 30.14/30.34 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 30.14/30.34 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 30.14/30.34 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 30.14/30.34 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 30.14/30.34 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 30.14/30.34 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 30.14/30.34 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 30.14/30.34 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 30.14/30.34 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 30.14/30.34 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 30.14/30.34 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 30.14/30.34 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 30.14/30.34 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 30.14/30.34 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 30.14/30.34 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 30.14/30.34 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 30.14/30.34 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 30.14/30.34 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 30.14/30.34 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 30.14/30.34 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 30.14/30.34 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 30.14/30.34 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 30.14/30.34 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 30.14/30.34 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 30.14/30.34 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 30.14/30.34 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 30.14/30.34 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 30.14/30.34 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 30.14/30.34 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 30.14/30.34 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 30.14/30.34 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 30.14/30.34 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 30.14/30.34 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 30.14/30.34 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 30.14/30.34 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 30.14/30.34 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 30.14/30.34 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 30.14/30.34 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 30.14/30.34 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 30.14/30.34 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 30.14/30.34 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 30.14/30.34 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 30.14/30.34 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 30.14/30.34 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 30.14/30.34 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 30.14/30.34 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 30.14/30.34 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 30.14/30.34 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 30.14/30.34 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 30.14/30.34 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 30.14/30.34 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 30.14/30.34 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 30.14/30.34 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 30.14/30.34 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 30.14/30.34 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 30.14/30.34 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 30.14/30.34 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 30.14/30.34 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 30.14/30.34 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 30.14/30.34 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 30.14/30.34 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 30.14/30.34 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 30.14/30.34 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 30.14/30.34 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 30.14/30.34 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 30.14/30.34 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 30.14/30.34 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 30.14/30.34 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 30.14/30.34 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 30.14/30.34 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 30.14/30.34 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 30.14/30.34 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 30.14/30.34 (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))))
% 30.14/30.34 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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))))
% 30.14/30.34 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 30.14/30.34 (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)))))
% 30.14/30.34 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 30.14/30.34 (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)))))
% 30.14/30.34 (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)))))
% 30.14/30.34 (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)))))
% 30.14/30.34 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 30.14/30.34 (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))))
% 30.14/30.34 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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)))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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)))))
% 30.14/30.34 (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))))
% 30.14/30.34 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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)))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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)))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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)))))
% 30.14/30.35 (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)))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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))))
% 30.14/30.35 (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)))))
% 30.14/30.35 (assume a185 (tptp.ssList tptp.sk1))
% 30.14/30.35 (assume a186 (tptp.ssList tptp.sk2))
% 30.14/30.35 (assume a187 (tptp.ssList tptp.sk3))
% 30.14/30.35 (assume a188 (tptp.ssList tptp.sk4))
% 30.14/30.35 (assume a189 (= tptp.sk2 tptp.sk4))
% 30.14/30.35 (assume a190 (= tptp.sk1 tptp.sk3))
% 30.14/30.35 (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 30.14/30.35 (assume a192 (or (tptp.ssItem tptp.sk5) (= tptp.nil tptp.sk4)))
% 30.14/30.35 (assume a193 (or (tptp.ssItem tptp.sk5) (= tptp.nil tptp.sk3)))
% 30.14/30.35 (assume a194 (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk4)))
% 30.14/30.35 (assume a195 (or (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk4)))
% 30.14/30.35 (assume a196 (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (= tptp.sk5 A) (not (tptp.memberP tptp.sk4 A)) (not (tptp.leq tptp.sk5 A)) (= tptp.nil tptp.sk4))))
% 30.14/30.35 (assume a197 (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk3)))
% 30.14/30.35 (assume a198 (or (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk3)))
% 30.14/30.35 (assume a199 (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (= tptp.sk5 A) (not (tptp.memberP tptp.sk4 A)) (not (tptp.leq tptp.sk5 A)) (= tptp.nil tptp.sk3))))
% 30.14/30.35 (assume a200 (or (not (tptp.singletonP tptp.sk1)) (not (tptp.segmentP tptp.sk2 tptp.sk1))))
% 30.14/30.35 (step t1 (cl (not (= (or (not (tptp.singletonP tptp.sk1)) (not (tptp.segmentP tptp.sk2 tptp.sk1))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))))) (not (or (not (tptp.singletonP tptp.sk1)) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv_pos2)
% 30.14/30.35 (step t2 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 30.14/30.35 (step t3 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t2 a190 a189))
% 30.14/30.35 (step t4 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t3))
% 30.14/30.35 (step t5 (cl (= (tptp.singletonP tptp.sk1) (tptp.singletonP tptp.sk3))) :rule cong :premises (t4))
% 30.14/30.35 (step t6 (cl (= (not (tptp.singletonP tptp.sk1)) (not (tptp.singletonP tptp.sk3)))) :rule cong :premises (t5))
% 30.14/30.35 (step t7 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t3))
% 30.14/30.35 (step t8 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule cong :premises (t7 t4))
% 30.14/30.35 (step t9 (cl (= (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule cong :premises (t8))
% 30.14/30.35 (step t10 (cl (= (or (not (tptp.singletonP tptp.sk1)) (not (tptp.segmentP tptp.sk2 tptp.sk1))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))))) :rule cong :premises (t6 t9))
% 30.14/30.35 (step t11 (cl (or (not (tptp.singletonP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule resolution :premises (t1 t10 a200))
% 30.14/30.35 (step t12 (cl (not (tptp.singletonP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule or :premises (t11))
% 30.14/30.35 (step t13 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.singletonP tptp.sk3))) :rule reordering :premises (t12))
% 30.14/30.35 (step t14 (cl (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule and_neg)
% 30.14/30.35 (step t15 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t16)
% 30.14/30.35 (assume t16.a0 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 30.14/30.35 (assume t16.a1 (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 30.14/30.35 (assume t16.a2 (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))
% 30.14/30.35 (assume t16.a3 (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))
% 30.14/30.35 (step t16.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t16.t2)
% 30.14/30.35 (assume t16.t2.a0 (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))
% 30.14/30.35 (assume t16.t2.a1 (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 30.14/30.35 (assume t16.t2.a2 (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))
% 30.14/30.35 (assume t16.t2.a3 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 30.14/30.35 (step t16.t2.t1 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv_simplify)
% 30.14/30.35 (step t16.t2.t2 (cl (not (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule equiv1 :premises (t16.t2.t1))
% 30.14/30.35 (step t16.t2.t3 (cl (= (tptp.app tptp.sk4 tptp.nil) tptp.sk4)) :rule symm :premises (t16.t2.a3))
% 30.14/30.35 (step t16.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule symm :premises (t16.t2.t3))
% 30.14/30.35 (step t16.t2.t5 (cl (= (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.sk4)) :rule symm :premises (t16.t2.a1))
% 30.14/30.35 (step t16.t2.t6 (cl (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule symm :premises (t16.t2.t5))
% 30.14/30.35 (step t16.t2.t7 (cl (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)) :rule symm :premises (t16.t2.a2))
% 30.14/30.35 (step t16.t2.t8 (cl (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule symm :premises (t16.t2.t7))
% 30.14/30.35 (step t16.t2.t9 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule cong :premises (t16.t2.t6 t16.t2.t8))
% 30.14/30.35 (step t16.t2.t10 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule trans :premises (t16.t2.t4 t16.t2.t9))
% 30.14/30.35 (step t16.t2.t11 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 30.14/30.35 (step t16.t2.t12 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule cong :premises (t16.t2.t10 t16.t2.t11))
% 30.14/30.35 (step t16.t2.t13 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) true) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule equiv_simplify)
% 30.14/30.35 (step t16.t2.t14 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) true) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule equiv2 :premises (t16.t2.t13))
% 30.14/30.35 (step t16.t2.t15 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) true)) :rule resolution :premises (t16.t2.t14 t16.t2.a0))
% 30.14/30.35 (step t16.t2.t16 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) :rule trans :premises (t16.t2.t12 t16.t2.t15))
% 30.14/30.35 (step t16.t2.t17 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t16.t2.t2 t16.t2.t16))
% 30.14/30.35 (step t16.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule subproof :discharge (t16.t2.a0 t16.t2.a1 t16.t2.a2 t16.t2.a3))
% 30.14/30.35 (step t16.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) :rule and_pos)
% 30.14/30.35 (step t16.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_pos)
% 30.14/30.35 (step t16.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule and_pos)
% 30.14/30.35 (step t16.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t16.t7 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t16.t2 t16.t3 t16.t4 t16.t5 t16.t6))
% 30.14/30.35 (step t16.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule reordering :premises (t16.t7))
% 30.14/30.35 (step t16.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule contraction :premises (t16.t8))
% 30.14/30.35 (step t16.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t16.t1 t16.t9))
% 30.14/30.35 (step t16.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg2)
% 30.14/30.35 (step t16.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t16.t10 t16.t11))
% 30.14/30.35 (step t16.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t16.t12))
% 30.14/30.35 (step t16.t14 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule implies :premises (t16.t13))
% 30.14/30.35 (step t16.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t16.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t16.t15 t16.a2 t16.a1 t16.a3 t16.a0))
% 30.14/30.35 (step t16.t17 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t16.t14 t16.t16))
% 30.14/30.35 (step t16 (cl (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule subproof :discharge (t16.a0 t16.a1 t16.a2 t16.a3))
% 30.14/30.35 (step t17 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t18 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_pos)
% 30.14/30.35 (step t19 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) :rule and_pos)
% 30.14/30.35 (step t20 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule and_pos)
% 30.14/30.35 (step t21 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t16 t17 t18 t19 t20))
% 30.14/30.35 (step t22 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule reordering :premises (t21))
% 30.14/30.35 (step t23 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule contraction :premises (t22))
% 30.14/30.35 (step t24 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t15 t23))
% 30.14/30.35 (step t25 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg2)
% 30.14/30.35 (step t26 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t24 t25))
% 30.14/30.35 (step t27 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t26))
% 30.14/30.35 (step t28 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule implies :premises (t27))
% 30.14/30.35 (step t29 (cl (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t14 t28))
% 30.14/30.35 (step t30 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule reordering :premises (t29))
% 30.14/30.35 (step t31 (cl (not (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule or_pos)
% 30.14/30.35 (step t32 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (not (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule reordering :premises (t31))
% 30.14/30.35 (step t33 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t34)
% 30.14/30.35 (assume t34.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 30.14/30.35 (step t34.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk4)))
% 30.14/30.35 (step t34.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule or :premises (t34.t1))
% 30.14/30.35 (step t34.t3 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t34.t2 t34.a0))
% 30.14/30.35 (step t34 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule subproof :discharge (t34.a0))
% 30.14/30.35 (step t35 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t33 t34))
% 30.14/30.35 (step t36 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule implies_neg2)
% 30.14/30.35 (step t37 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t35 t36))
% 30.14/30.35 (step t38 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule contraction :premises (t37))
% 30.14/30.35 (step t39 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule implies :premises (t38))
% 30.14/30.35 (step t40 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t39 a50))
% 30.14/30.35 (step t41 (cl (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule and_neg)
% 30.14/30.35 (step t42 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t43)
% 30.14/30.35 (assume t43.a0 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 30.14/30.35 (assume t43.a1 (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))
% 30.14/30.35 (step t43.t1 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t43.t2)
% 30.14/30.35 (assume t43.t2.a0 (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))
% 30.14/30.35 (assume t43.t2.a1 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 30.14/30.35 (step t43.t2.t1 (cl (= (tptp.app tptp.sk4 tptp.nil) tptp.sk4)) :rule symm :premises (t43.t2.a1))
% 30.14/30.35 (step t43.t2.t2 (cl (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk4)) :rule symm :premises (t43.t2.a0))
% 30.14/30.35 (step t43.t2.t3 (cl (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule symm :premises (t43.t2.t2))
% 30.14/30.35 (step t43.t2.t4 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule trans :premises (t43.t2.t1 t43.t2.t3))
% 30.14/30.35 (step t43.t2 (cl (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule subproof :discharge (t43.t2.a0 t43.t2.a1))
% 30.14/30.35 (step t43.t3 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule and_pos)
% 30.14/30.35 (step t43.t4 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t43.t5 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t43.t2 t43.t3 t43.t4))
% 30.14/30.35 (step t43.t6 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule reordering :premises (t43.t5))
% 30.14/30.35 (step t43.t7 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule contraction :premises (t43.t6))
% 30.14/30.35 (step t43.t8 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t43.t1 t43.t7))
% 30.14/30.35 (step t43.t9 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule implies_neg2)
% 30.14/30.35 (step t43.t10 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (=> (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t43.t8 t43.t9))
% 30.14/30.35 (step t43.t11 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule contraction :premises (t43.t10))
% 30.14/30.35 (step t43.t12 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule implies :premises (t43.t11))
% 30.14/30.35 (step t43.t13 (cl (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t43.t14 (cl (and (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t43.t13 t43.a1 t43.a0))
% 30.14/30.35 (step t43.t15 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t43.t12 t43.t14))
% 30.14/30.35 (step t43 (cl (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule subproof :discharge (t43.a0 t43.a1))
% 30.14/30.35 (step t44 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t45 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule and_pos)
% 30.14/30.35 (step t46 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule resolution :premises (t43 t44 t45))
% 30.14/30.35 (step t47 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule reordering :premises (t46))
% 30.14/30.35 (step t48 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule contraction :premises (t47))
% 30.14/30.35 (step t49 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t42 t48))
% 30.14/30.35 (step t50 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule implies_neg2)
% 30.14/30.35 (step t51 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t49 t50))
% 30.14/30.35 (step t52 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule contraction :premises (t51))
% 30.14/30.35 (step t53 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule implies :premises (t52))
% 30.14/30.35 (step t54 (cl (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t41 t53))
% 30.14/30.35 (step t55 (cl (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule or_pos)
% 30.14/30.35 (step t56 (cl (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule reordering :premises (t55))
% 30.14/30.35 (step t57 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t58)
% 30.14/30.35 (assume t58.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 30.14/30.35 (step t58.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk4)))
% 30.14/30.35 (step t58.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule or :premises (t58.t1))
% 30.14/30.35 (step t58.t3 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t58.t2 t58.a0))
% 30.14/30.35 (step t58 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule subproof :discharge (t58.a0))
% 30.14/30.35 (step t59 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t57 t58))
% 30.14/30.35 (step t60 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule implies_neg2)
% 30.14/30.35 (step t61 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t59 t60))
% 30.14/30.35 (step t62 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule contraction :premises (t61))
% 30.14/30.35 (step t63 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies :premises (t62))
% 30.14/30.35 (step t64 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t65 :args ((U $$unsorted) (:= U U)))
% 30.14/30.35 (step t65.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t65.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 30.14/30.35 (step t65.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 30.14/30.35 (step t65.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule cong :premises (t65.t2 t65.t3))
% 30.14/30.35 (step t65 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) :rule bind)
% 30.14/30.35 (step t66 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t64 t65 a72))
% 30.14/30.35 (step t67 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t63 t66))
% 30.14/30.35 (step t68 (cl (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule resolution :premises (t56 a188 t67))
% 30.14/30.35 (step t69 (cl (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule or_pos)
% 30.14/30.35 (step t70 (cl (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule contraction :premises (t69))
% 30.14/30.35 (step t71 (cl (not (tptp.ssList tptp.sk4)) (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule reordering :premises (t70))
% 30.14/30.35 (step t72 (cl (not (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4)) :rule or_pos)
% 30.14/30.35 (step t73 (cl (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4) (not (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4)))) :rule reordering :premises (t72))
% 30.14/30.35 (step t74 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t75)
% 30.14/30.35 (assume t75.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 30.14/30.35 (step t75.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 30.14/30.35 (step t75.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule or :premises (t75.t1))
% 30.14/30.35 (step t75.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule resolution :premises (t75.t2 t75.a0))
% 30.14/30.35 (step t75 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule subproof :discharge (t75.a0))
% 30.14/30.35 (step t76 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule resolution :premises (t74 t75))
% 30.14/30.35 (step t77 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4)))) :rule implies_neg2)
% 30.14/30.35 (step t78 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4)))) :rule resolution :premises (t76 t77))
% 30.14/30.35 (step t79 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4)))) :rule contraction :premises (t78))
% 30.14/30.35 (step t80 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule implies :premises (t79))
% 30.14/30.35 (step t81 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule resolution :premises (t80 a60))
% 30.14/30.35 (step t82 (cl (tptp.frontsegP tptp.sk4 tptp.sk4)) :rule resolution :premises (t73 a188 t81))
% 30.14/30.35 (step t83 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t84)
% 30.14/30.35 (assume t84.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))
% 30.14/30.35 (step t84.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk4)))
% 30.14/30.35 (step t84.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule or :premises (t84.t1))
% 30.14/30.35 (step t84.t3 (cl (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t84.t2 t84.a0))
% 30.14/30.35 (step t84 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule subproof :discharge (t84.a0))
% 30.14/30.35 (step t85 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t83 t84))
% 30.14/30.35 (step t86 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule implies_neg2)
% 30.14/30.35 (step t87 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule resolution :premises (t85 t86))
% 30.14/30.35 (step t88 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule contraction :premises (t87))
% 30.14/30.35 (step t89 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule implies :premises (t88))
% 30.14/30.35 (step t90 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t91 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 30.14/30.35 (step t91.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t91.t2 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t91.t3 (cl (= (not (tptp.frontsegP U V)) (not (tptp.frontsegP U V)))) :rule refl)
% 30.14/30.35 (step t91.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 30.14/30.35 (step t91.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 30.14/30.35 (step t91.t6 (cl (= (= (tptp.app V (tptp.skaf45 U V)) U) (= U (tptp.app V (tptp.skaf45 U V))))) :rule all_simplify)
% 30.14/30.35 (step t91.t7 (cl (= (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule cong :premises (t91.t3 t91.t4 t91.t5 t91.t6))
% 30.14/30.35 (step t91 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) :rule bind)
% 30.14/30.35 (step t92 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule resolution :premises (t90 t91 a131))
% 30.14/30.35 (step t93 (cl (or (not (tptp.frontsegP tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t89 t92))
% 30.14/30.35 (step t94 (cl (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t71 a188 t82 t93))
% 30.14/30.35 (step t95 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t54 t68 t94))
% 30.14/30.35 (step t96 (cl (not (= (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) (=> (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))) (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))))) (not (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)))) (=> (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))) (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule equiv_pos2)
% 30.14/30.35 (step t97 (cl (= (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))) (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))))) :rule refl)
% 30.14/30.35 (step t98 (cl (= (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil)) (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule all_simplify)
% 30.14/30.35 (step t99 (cl (= (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule cong :premises (t98))
% 30.14/30.35 (step t100 (cl (= (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule refl)
% 30.14/30.35 (step t101 (cl (= (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule refl)
% 30.14/30.35 (step t102 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 30.14/30.35 (step t103 (cl (= (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule all_simplify)
% 30.14/30.35 (step t104 (cl (= (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)) (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule cong :premises (t99 t100 t101 t102 t103))
% 30.14/30.35 (step t105 (cl (= (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) (=> (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))) (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule cong :premises (t97 t104))
% 30.14/30.35 (step t106 (cl (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) (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)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t107)
% 30.14/30.35 (assume t107.a0 (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))))
% 30.14/30.35 (step t107.t1 (cl (or (not (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)))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V (tptp.skaf45 tptp.sk4 tptp.sk4)) (:= W tptp.nil)))
% 30.14/30.35 (step t107.t2 (cl (not (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)))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) :rule or :premises (t107.t1))
% 30.14/30.35 (step t107.t3 (cl (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) :rule resolution :premises (t107.t2 t107.a0))
% 30.14/30.35 (step t107 (cl (not (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)))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) :rule subproof :discharge (t107.a0))
% 30.14/30.35 (step t108 (cl (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) :rule resolution :premises (t106 t107))
% 30.14/30.35 (step t109 (cl (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) (not (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)))) :rule implies_neg2)
% 30.14/30.35 (step t110 (cl (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil))) (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)))) :rule resolution :premises (t108 t109))
% 30.14/30.35 (step t111 (cl (=> (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))) (or (not (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) (tptp.app tptp.sk4 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)))) :rule contraction :premises (t110))
% 30.14/30.35 (step t112 (cl (=> (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))) (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule resolution :premises (t96 t105 t111))
% 30.14/30.35 (step t113 (cl (not (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)))) (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule implies :premises (t112))
% 30.14/30.35 (step t114 (cl (or (not (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t113 a149))
% 30.14/30.35 (step t115 (cl (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t32 a7 a188 t40 t95 t114))
% 30.14/30.35 (step t116 (cl (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t117 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t118)
% 30.14/30.35 (assume t118.a0 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (assume t118.a1 (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (step t118.t1 (cl (=> (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t118.t2)
% 30.14/30.35 (assume t118.t2.a0 (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (assume t118.t2.a1 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (step t118.t2.t1 (cl (= (= (tptp.singletonP tptp.sk3) true) (tptp.singletonP tptp.sk3))) :rule equiv_simplify)
% 30.14/30.35 (step t118.t2.t2 (cl (not (= (tptp.singletonP tptp.sk3) true)) (tptp.singletonP tptp.sk3)) :rule equiv1 :premises (t118.t2.t1))
% 30.14/30.35 (step t118.t2.t3 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t118.t2.a1))
% 30.14/30.35 (step t118.t2.t4 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t118.t2.t3))
% 30.14/30.35 (step t118.t2.t5 (cl (= (tptp.singletonP tptp.sk3) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t118.t2.t4))
% 30.14/30.35 (step t118.t2.t6 (cl (= (= (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 30.14/30.35 (step t118.t2.t7 (cl (= (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) true) (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv2 :premises (t118.t2.t6))
% 30.14/30.35 (step t118.t2.t8 (cl (= (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) true)) :rule resolution :premises (t118.t2.t7 t118.t2.a0))
% 30.14/30.35 (step t118.t2.t9 (cl (= (tptp.singletonP tptp.sk3) true)) :rule trans :premises (t118.t2.t5 t118.t2.t8))
% 30.14/30.35 (step t118.t2.t10 (cl (tptp.singletonP tptp.sk3)) :rule resolution :premises (t118.t2.t2 t118.t2.t9))
% 30.14/30.35 (step t118.t2 (cl (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) :rule subproof :discharge (t118.t2.a0 t118.t2.a1))
% 30.14/30.35 (step t118.t3 (cl (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t118.t4 (cl (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t118.t5 (cl (tptp.singletonP tptp.sk3) (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t118.t2 t118.t3 t118.t4))
% 30.14/30.35 (step t118.t6 (cl (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP tptp.sk3)) :rule reordering :premises (t118.t5))
% 30.14/30.35 (step t118.t7 (cl (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP tptp.sk3)) :rule contraction :premises (t118.t6))
% 30.14/30.35 (step t118.t8 (cl (=> (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (tptp.singletonP tptp.sk3)) :rule resolution :premises (t118.t1 t118.t7))
% 30.14/30.35 (step t118.t9 (cl (=> (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (not (tptp.singletonP tptp.sk3))) :rule implies_neg2)
% 30.14/30.35 (step t118.t10 (cl (=> (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (=> (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3))) :rule resolution :premises (t118.t8 t118.t9))
% 30.14/30.35 (step t118.t11 (cl (=> (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3))) :rule contraction :premises (t118.t10))
% 30.14/30.35 (step t118.t12 (cl (not (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP tptp.sk3)) :rule implies :premises (t118.t11))
% 30.14/30.35 (step t118.t13 (cl (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t118.t14 (cl (and (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t118.t13 t118.a1 t118.a0))
% 30.14/30.35 (step t118.t15 (cl (tptp.singletonP tptp.sk3)) :rule resolution :premises (t118.t12 t118.t14))
% 30.14/30.35 (step t118 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) :rule subproof :discharge (t118.a0 t118.a1))
% 30.14/30.35 (step t119 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t120 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t121 (cl (tptp.singletonP tptp.sk3) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t118 t119 t120))
% 30.14/30.35 (step t122 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP tptp.sk3)) :rule reordering :premises (t121))
% 30.14/30.35 (step t123 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP tptp.sk3)) :rule contraction :premises (t122))
% 30.14/30.35 (step t124 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (tptp.singletonP tptp.sk3)) :rule resolution :premises (t117 t123))
% 30.14/30.35 (step t125 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (not (tptp.singletonP tptp.sk3))) :rule implies_neg2)
% 30.14/30.35 (step t126 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3))) :rule resolution :premises (t124 t125))
% 30.14/30.35 (step t127 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3))) :rule contraction :premises (t126))
% 30.14/30.35 (step t128 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.singletonP tptp.sk3)) :rule implies :premises (t127))
% 30.14/30.35 (step t129 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP tptp.sk3)) :rule resolution :premises (t116 t128))
% 30.14/30.35 (step t130 (cl (tptp.singletonP tptp.sk3) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t129))
% 30.14/30.35 (step t131 (cl (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or_pos)
% 30.14/30.35 (step t132 (cl (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule reordering :premises (t131))
% 30.14/30.35 (step t133 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t134)
% 30.14/30.35 (assume t134.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))
% 30.14/30.35 (step t134.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk5)))
% 30.14/30.35 (step t134.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule or :premises (t134.t1))
% 30.14/30.35 (step t134.t3 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t134.t2 t134.a0))
% 30.14/30.35 (step t134 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule subproof :discharge (t134.a0))
% 30.14/30.35 (step t135 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t133 t134))
% 30.14/30.35 (step t136 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule implies_neg2)
% 30.14/30.35 (step t137 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule resolution :premises (t135 t136))
% 30.14/30.35 (step t138 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule contraction :premises (t137))
% 30.14/30.35 (step t139 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies :premises (t138))
% 30.14/30.35 (step t140 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t141 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 30.14/30.35 (step t141.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t141.t2 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t141.t3 (cl (= (not (tptp.memberP U V)) (not (tptp.memberP U V)))) :rule refl)
% 30.14/30.35 (step t141.t4 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 30.14/30.35 (step t141.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 30.14/30.35 (step t141.t6 (cl (= (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) :rule all_simplify)
% 30.14/30.35 (step t141.t7 (cl (= (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)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule cong :premises (t141.t3 t141.t4 t141.t5 t141.t6))
% 30.14/30.35 (step t141 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))) :rule bind)
% 30.14/30.35 (step t142 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule resolution :premises (t140 t141 a168))
% 30.14/30.35 (step t143 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t139 t142))
% 30.14/30.35 (step t144 (cl (not (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)) :rule or_pos)
% 30.14/30.35 (step t145 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (not (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)))) :rule reordering :premises (t144))
% 30.14/30.35 (step t146 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t147)
% 30.14/30.35 (assume t147.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 30.14/30.35 (step t147.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk5)))
% 30.14/30.35 (step t147.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule or :premises (t147.t1))
% 30.14/30.35 (step t147.t3 (cl (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule resolution :premises (t147.t2 t147.a0))
% 30.14/30.35 (step t147 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule subproof :discharge (t147.a0))
% 30.14/30.35 (step t148 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule resolution :premises (t146 t147))
% 30.14/30.35 (step t149 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule implies_neg2)
% 30.14/30.35 (step t150 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule resolution :premises (t148 t149))
% 30.14/30.35 (step t151 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule contraction :premises (t150))
% 30.14/30.35 (step t152 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule implies :premises (t151))
% 30.14/30.35 (step t153 (cl (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule resolution :premises (t152 a52))
% 30.14/30.35 (step t154 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) (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)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t155)
% 30.14/30.35 (assume t155.a0 (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))))
% 30.14/30.35 (step t155.t1 (cl (or (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (:= V tptp.sk3) (:= W (tptp.skaf45 tptp.sk4 tptp.sk4)) (:= X (tptp.skaf42 tptp.sk4 tptp.sk5))))
% 30.14/30.35 (step t155.t2 (cl (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule or :premises (t155.t1))
% 30.14/30.35 (step t155.t3 (cl (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t155.t2 t155.a0))
% 30.14/30.35 (step t155 (cl (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule subproof :discharge (t155.a0))
% 30.14/30.35 (step t156 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t154 t155))
% 30.14/30.35 (step t157 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) (not (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)))) :rule implies_neg2)
% 30.14/30.35 (step t158 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t156 t157))
% 30.14/30.35 (step t159 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3)))) :rule contraction :premises (t158))
% 30.14/30.35 (step t160 (cl (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule implies :premises (t159))
% 30.14/30.35 (step t161 (cl (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t160 a171))
% 30.14/30.35 (step t162 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 30.14/30.35 (step t163 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t162))
% 30.14/30.35 (step t164 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t165)
% 30.14/30.35 (assume t165.a0 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))))
% 30.14/30.35 (step t165.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5)))
% 30.14/30.35 (step t165.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t165.t1))
% 30.14/30.35 (step t165.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t165.t2 t165.a0))
% 30.14/30.35 (step t165 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t165.a0))
% 30.14/30.35 (step t166 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t164 t165))
% 30.14/30.35 (step t167 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 30.14/30.35 (step t168 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t166 t167))
% 30.14/30.35 (step t169 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t168))
% 30.14/30.35 (step t170 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t169))
% 30.14/30.35 (step t171 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t172 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 30.14/30.35 (step t172.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t172.t2 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t172.t3 (cl (= (= (tptp.cons U tptp.nil) V) (= V (tptp.cons U tptp.nil)))) :rule all_simplify)
% 30.14/30.35 (step t172.t4 (cl (= (not (= (tptp.cons U tptp.nil) V)) (not (= V (tptp.cons U tptp.nil))))) :rule cong :premises (t172.t3))
% 30.14/30.35 (step t172.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 30.14/30.35 (step t172.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 30.14/30.35 (step t172.t7 (cl (= (tptp.singletonP V) (tptp.singletonP V))) :rule refl)
% 30.14/30.35 (step t172.t8 (cl (= (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V)) (or (not (= V (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V)))) :rule cong :premises (t172.t4 t172.t5 t172.t6 t172.t7))
% 30.14/30.35 (step t172 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= V (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))) :rule bind)
% 30.14/30.35 (step t173 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= V (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))) (forall ((U $$unsorted)) (or (not (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))))) :rule all_simplify)
% 30.14/30.35 (anchor :step t174 :args ((U $$unsorted) (:= U U)))
% 30.14/30.35 (step t174.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t174.t2 (cl (= (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil)) true)) :rule all_simplify)
% 30.14/30.35 (step t174.t3 (cl (= (not (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil))) (not true))) :rule cong :premises (t174.t2))
% 30.14/30.35 (step t174.t4 (cl (= (not true) false)) :rule all_simplify)
% 30.14/30.35 (step t174.t5 (cl (= (not (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil))) false)) :rule trans :premises (t174.t3 t174.t4))
% 30.14/30.35 (step t174.t6 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 30.14/30.35 (step t174.t7 (cl (= (not (tptp.ssList (tptp.cons U tptp.nil))) (not (tptp.ssList (tptp.cons U tptp.nil))))) :rule refl)
% 30.14/30.35 (step t174.t8 (cl (= (tptp.singletonP (tptp.cons U tptp.nil)) (tptp.singletonP (tptp.cons U tptp.nil)))) :rule refl)
% 30.14/30.35 (step t174.t9 (cl (= (or (not (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))) (or false (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) :rule cong :premises (t174.t5 t174.t6 t174.t7 t174.t8))
% 30.14/30.35 (step t174.t10 (cl (= (or false (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) :rule all_simplify)
% 30.14/30.35 (step t174.t11 (cl (= (or (not (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) :rule trans :premises (t174.t9 t174.t10))
% 30.14/30.35 (step t174 (cl (= (forall ((U $$unsorted)) (or (not (= (tptp.cons U tptp.nil) (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))))) :rule bind)
% 30.14/30.35 (step t175 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= V (tptp.cons U tptp.nil))) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))))) :rule trans :premises (t173 t174))
% 30.14/30.35 (step t176 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil)))))) :rule trans :premises (t172 t175))
% 30.14/30.35 (step t177 (cl (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList (tptp.cons U tptp.nil))) (tptp.singletonP (tptp.cons U tptp.nil))))) :rule resolution :premises (t171 t176 a115))
% 30.14/30.35 (step t178 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.singletonP (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t170 t177))
% 30.14/30.35 (step t179 (cl (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.nil tptp.sk3)) :rule or :premises (a198))
% 30.14/30.35 (step t180 (cl (= tptp.nil tptp.sk3) (tptp.memberP tptp.sk4 tptp.sk5)) :rule reordering :premises (t179))
% 30.14/30.35 (step t181 (cl (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule and_neg)
% 30.14/30.35 (step t182 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t183)
% 30.14/30.35 (assume t183.a0 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (assume t183.a1 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 30.14/30.35 (assume t183.a2 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 30.14/30.35 (assume t183.a3 (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))
% 30.14/30.35 (assume t183.a4 (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 30.14/30.35 (assume t183.a5 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))
% 30.14/30.35 (step t183.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t183.t2)
% 30.14/30.35 (assume t183.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))
% 30.14/30.35 (assume t183.t2.a1 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 30.14/30.35 (assume t183.t2.a2 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 30.14/30.35 (assume t183.t2.a3 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (assume t183.t2.a4 (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))
% 30.14/30.35 (assume t183.t2.a5 (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 30.14/30.35 (step t183.t2.t1 (cl (= (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule equiv_simplify)
% 30.14/30.35 (step t183.t2.t2 (cl (not (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule equiv1 :premises (t183.t2.t1))
% 30.14/30.35 (step t183.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule symm :premises (t183.t2.a5))
% 30.14/30.35 (step t183.t2.t4 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule symm :premises (t183.t2.t3))
% 30.14/30.35 (step t183.t2.t5 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 30.14/30.35 (step t183.t2.t6 (cl (= (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) tptp.nil)) :rule symm :premises (t183.t2.a4))
% 30.14/30.35 (step t183.t2.t7 (cl (= (tptp.cons tptp.sk5 (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (tptp.cons tptp.sk5 tptp.nil))) :rule cong :premises (t183.t2.t5 t183.t2.t6))
% 30.14/30.35 (step t183.t2.t8 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule symm :premises (t183.t2.t7))
% 30.14/30.35 (step t183.t2.t9 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t183.t2.a3))
% 30.14/30.35 (step t183.t2.t10 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t183.t2.t9))
% 30.14/30.35 (step t183.t2.t11 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t183.t2.t10))
% 30.14/30.35 (step t183.t2.t12 (cl (= (tptp.cons tptp.sk5 (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (tptp.app tptp.sk3 tptp.nil))) :rule trans :premises (t183.t2.t7 t183.t2.t11 t183.t2.a2))
% 30.14/30.35 (step t183.t2.t13 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t183.t2.a2))
% 30.14/30.35 (step t183.t2.t14 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t183.t2.a1))
% 30.14/30.35 (step t183.t2.t15 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t183.t2.t14))
% 30.14/30.35 (step t183.t2.t16 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app tptp.nil tptp.sk3))) :rule trans :premises (t183.t2.t13 t183.t2.t15))
% 30.14/30.35 (step t183.t2.t17 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.nil tptp.sk3))) :rule trans :premises (t183.t2.t8 t183.t2.t12 t183.t2.t16))
% 30.14/30.35 (step t183.t2.t18 (cl (= (tptp.skaf43 tptp.sk5 tptp.sk4) (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule refl)
% 30.14/30.35 (step t183.t2.t19 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule cong :premises (t183.t2.t17 t183.t2.t18))
% 30.14/30.35 (step t183.t2.t20 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule trans :premises (t183.t2.t4 t183.t2.t19))
% 30.14/30.35 (step t183.t2.t21 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 30.14/30.35 (step t183.t2.t22 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule cong :premises (t183.t2.t20 t183.t2.t21))
% 30.14/30.35 (step t183.t2.t23 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule equiv_simplify)
% 30.14/30.35 (step t183.t2.t24 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule equiv2 :premises (t183.t2.t23))
% 30.14/30.35 (step t183.t2.t25 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true)) :rule resolution :premises (t183.t2.t24 t183.t2.a0))
% 30.14/30.35 (step t183.t2.t26 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true)) :rule trans :premises (t183.t2.t22 t183.t2.t25))
% 30.14/30.35 (step t183.t2.t27 (cl (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t183.t2.t2 t183.t2.t26))
% 30.14/30.35 (step t183.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule subproof :discharge (t183.t2.a0 t183.t2.a1 t183.t2.a2 t183.t2.a3 t183.t2.a4 t183.t2.a5))
% 30.14/30.35 (step t183.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule and_pos)
% 30.14/30.35 (step t183.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 30.14/30.35 (step t183.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t183.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t183.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t183.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule and_pos)
% 30.14/30.35 (step t183.t9 (cl (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t183.t2 t183.t3 t183.t4 t183.t5 t183.t6 t183.t7 t183.t8))
% 30.14/30.35 (step t183.t10 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule reordering :premises (t183.t9))
% 30.14/30.35 (step t183.t11 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule contraction :premises (t183.t10))
% 30.14/30.35 (step t183.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t183.t1 t183.t11))
% 30.14/30.35 (step t183.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule implies_neg2)
% 30.14/30.35 (step t183.t14 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t183.t12 t183.t13))
% 30.14/30.35 (step t183.t15 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule contraction :premises (t183.t14))
% 30.14/30.35 (step t183.t16 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule implies :premises (t183.t15))
% 30.14/30.35 (step t183.t17 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_neg)
% 30.14/30.35 (step t183.t18 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t183.t17 t183.a5 t183.a2 t183.a1 t183.a0 t183.a3 t183.a4))
% 30.14/30.35 (step t183.t19 (cl (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t183.t16 t183.t18))
% 30.14/30.35 (step t183 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule subproof :discharge (t183.a0 t183.a1 t183.a2 t183.a3 t183.a4 t183.a5))
% 30.14/30.35 (step t184 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t185 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t186 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 30.14/30.35 (step t187 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t188 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule and_pos)
% 30.14/30.35 (step t189 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule and_pos)
% 30.14/30.35 (step t190 (cl (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t183 t184 t185 t186 t187 t188 t189))
% 30.14/30.35 (step t191 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule reordering :premises (t190))
% 30.14/30.35 (step t192 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule contraction :premises (t191))
% 30.14/30.35 (step t193 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t182 t192))
% 30.14/30.35 (step t194 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule implies_neg2)
% 30.14/30.35 (step t195 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t193 t194))
% 30.14/30.35 (step t196 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule contraction :premises (t195))
% 30.14/30.35 (step t197 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule implies :premises (t196))
% 30.14/30.35 (step t198 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t181 t197))
% 30.14/30.35 (step t199 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule reordering :premises (t198))
% 30.14/30.35 (step t200 (cl (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule or_pos)
% 30.14/30.35 (step t201 (cl (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule contraction :premises (t200))
% 30.14/30.35 (step t202 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule reordering :premises (t201))
% 30.14/30.35 (step t203 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)) :rule or_pos)
% 30.14/30.35 (step t204 (cl (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule reordering :premises (t203))
% 30.14/30.35 (step t205 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t206)
% 30.14/30.35 (assume t206.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 30.14/30.35 (step t206.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 30.14/30.35 (step t206.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule or :premises (t206.t1))
% 30.14/30.35 (step t206.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t206.t2 t206.a0))
% 30.14/30.35 (step t206 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule subproof :discharge (t206.a0))
% 30.14/30.35 (step t207 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t205 t206))
% 30.14/30.35 (step t208 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule implies_neg2)
% 30.14/30.35 (step t209 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule resolution :premises (t207 t208))
% 30.14/30.35 (step t210 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule contraction :premises (t209))
% 30.14/30.35 (step t211 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule implies :premises (t210))
% 30.14/30.35 (step t212 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t211 a56))
% 30.14/30.35 (step t213 (cl (tptp.segmentP tptp.sk3 tptp.sk3)) :rule resolution :premises (t204 a187 t212))
% 30.14/30.35 (step t214 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t215)
% 30.14/30.35 (assume t215.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 30.14/30.35 (step t215.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk4)))
% 30.14/30.35 (step t215.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule or :premises (t215.t1))
% 30.14/30.35 (step t215.t3 (cl (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule resolution :premises (t215.t2 t215.a0))
% 30.14/30.35 (step t215 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule subproof :discharge (t215.a0))
% 30.14/30.35 (step t216 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule resolution :premises (t214 t215))
% 30.14/30.35 (step t217 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule implies_neg2)
% 30.14/30.35 (step t218 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule resolution :premises (t216 t217))
% 30.14/30.35 (step t219 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule contraction :premises (t218))
% 30.14/30.35 (step t220 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule implies :premises (t219))
% 30.14/30.35 (step t221 (cl (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule resolution :premises (t220 a51))
% 30.14/30.35 (step t222 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (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)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t223)
% 30.14/30.35 (assume t223.a0 (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))))
% 30.14/30.35 (step t223.t1 (cl (or (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk3) (:= W (tptp.skaf43 tptp.sk5 tptp.sk4)) (:= X tptp.nil)))
% 30.14/30.35 (step t223.t2 (cl (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule or :premises (t223.t1))
% 30.14/30.35 (step t223.t3 (cl (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t223.t2 t223.a0))
% 30.14/30.35 (step t223 (cl (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule subproof :discharge (t223.a0))
% 30.14/30.35 (step t224 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t222 t223))
% 30.14/30.35 (step t225 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule implies_neg2)
% 30.14/30.35 (step t226 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t224 t225))
% 30.14/30.35 (step t227 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule contraction :premises (t226))
% 30.14/30.35 (step t228 (cl (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule implies :premises (t227))
% 30.14/30.35 (step t229 (cl (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t228 a171))
% 30.14/30.35 (step t230 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t202 a7 a187 t213 t221 t229))
% 30.14/30.35 (step t231 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule or_pos)
% 30.14/30.35 (step t232 (cl (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule reordering :premises (t231))
% 30.14/30.35 (step t233 (cl (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule or_pos)
% 30.14/30.35 (step t234 (cl (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule contraction :premises (t233))
% 30.14/30.35 (step t235 (cl (not (tptp.ssList tptp.nil)) (not (tptp.segmentP tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule reordering :premises (t234))
% 30.14/30.35 (step t236 (cl (not (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) (not (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U)))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule equiv_pos2)
% 30.14/30.35 (step t237 (cl (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule all_simplify)
% 30.14/30.35 (step t238 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 30.14/30.35 (step t239 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t238))
% 30.14/30.35 (step t240 (cl (= (not true) false)) :rule all_simplify)
% 30.14/30.35 (step t241 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t239 t240))
% 30.14/30.35 (step t242 (cl (= (tptp.segmentP tptp.nil tptp.nil) (tptp.segmentP tptp.nil tptp.nil))) :rule refl)
% 30.14/30.35 (step t243 (cl (= (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or false (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule cong :premises (t241 t102 t242))
% 30.14/30.35 (step t244 (cl (= (or false (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule all_simplify)
% 30.14/30.35 (step t245 (cl (= (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule trans :premises (t243 t244))
% 30.14/30.35 (step t246 (cl (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule trans :premises (t237 t245))
% 30.14/30.35 (step t247 (cl (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule resolution :premises (t236 t246 a78))
% 30.14/30.35 (step t248 (cl (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) :rule or :premises (t247))
% 30.14/30.35 (step t249 (cl (tptp.segmentP tptp.nil tptp.nil)) :rule resolution :premises (t248 a7))
% 30.14/30.35 (step t250 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t251)
% 30.14/30.35 (assume t251.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))
% 30.14/30.35 (step t251.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 30.14/30.35 (step t251.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule or :premises (t251.t1))
% 30.14/30.35 (step t251.t3 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t251.t2 t251.a0))
% 30.14/30.35 (step t251 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule subproof :discharge (t251.a0))
% 30.14/30.35 (step t252 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t250 t251))
% 30.14/30.35 (step t253 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule implies_neg2)
% 30.14/30.35 (step t254 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t252 t253))
% 30.14/30.35 (step t255 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule contraction :premises (t254))
% 30.14/30.35 (step t256 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies :premises (t255))
% 30.14/30.35 (step t257 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t258 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 30.14/30.35 (step t258.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t258.t2 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t258.t3 (cl (= (not (tptp.segmentP U V)) (not (tptp.segmentP U V)))) :rule refl)
% 30.14/30.35 (step t258.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 30.14/30.35 (step t258.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 30.14/30.35 (step t258.t6 (cl (= (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) :rule all_simplify)
% 30.14/30.35 (step t258.t7 (cl (= (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)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule cong :premises (t258.t3 t258.t4 t258.t5 t258.t6))
% 30.14/30.35 (step t258 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))) :rule bind)
% 30.14/30.35 (step t259 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule resolution :premises (t257 t258 a167))
% 30.14/30.35 (step t260 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t256 t259))
% 30.14/30.35 (step t261 (cl (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t235 a7 t249 t260))
% 30.14/30.35 (step t262 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule or_pos)
% 30.14/30.35 (step t263 (cl (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule reordering :premises (t262))
% 30.14/30.35 (step t264 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t265)
% 30.14/30.35 (assume t265.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 30.14/30.35 (step t265.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 30.14/30.35 (step t265.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule or :premises (t265.t1))
% 30.14/30.35 (step t265.t3 (cl (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t265.t2 t265.a0))
% 30.14/30.35 (step t265 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule subproof :discharge (t265.a0))
% 30.14/30.35 (step t266 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t264 t265))
% 30.14/30.35 (step t267 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule implies_neg2)
% 30.14/30.35 (step t268 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule resolution :premises (t266 t267))
% 30.14/30.35 (step t269 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule contraction :premises (t268))
% 30.14/30.35 (step t270 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule implies :premises (t269))
% 30.14/30.35 (step t271 (cl (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t270 a48))
% 30.14/30.35 (step t272 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t273)
% 30.14/30.35 (assume t273.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 30.14/30.35 (step t273.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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U tptp.nil) (:= V (tptp.skaf47 tptp.nil tptp.nil))))
% 30.14/30.35 (step t273.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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule or :premises (t273.t1))
% 30.14/30.35 (step t273.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t273.t2 t273.a0))
% 30.14/30.35 (step t273 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule subproof :discharge (t273.a0))
% 30.14/30.35 (step t274 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t272 t273))
% 30.14/30.35 (step t275 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule implies_neg2)
% 30.14/30.35 (step t276 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t274 t275))
% 30.14/30.35 (step t277 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule contraction :premises (t276))
% 30.14/30.35 (step t278 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule implies :premises (t277))
% 30.14/30.35 (step t279 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t278 a84))
% 30.14/30.35 (step t280 (cl (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule resolution :premises (t263 a7 t271 t279))
% 30.14/30.35 (step t281 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t282)
% 30.14/30.35 (assume t282.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 30.14/30.35 (step t282.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 30.14/30.35 (step t282.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule or :premises (t282.t1))
% 30.14/30.35 (step t282.t3 (cl (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t282.t2 t282.a0))
% 30.14/30.35 (step t282 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule subproof :discharge (t282.a0))
% 30.14/30.35 (step t283 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t281 t282))
% 30.14/30.35 (step t284 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule implies_neg2)
% 30.14/30.35 (step t285 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t283 t284))
% 30.14/30.35 (step t286 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule contraction :premises (t285))
% 30.14/30.35 (step t287 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule implies :premises (t286))
% 30.14/30.35 (step t288 (cl (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t287 a47))
% 30.14/30.35 (step t289 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t290)
% 30.14/30.35 (assume t290.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 30.14/30.35 (step t290.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (:= V (tptp.skaf48 tptp.nil tptp.nil))))
% 30.14/30.35 (step t290.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule or :premises (t290.t1))
% 30.14/30.35 (step t290.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t290.t2 t290.a0))
% 30.14/30.35 (step t290 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule subproof :discharge (t290.a0))
% 30.14/30.35 (step t291 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t289 t290))
% 30.14/30.35 (step t292 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule implies_neg2)
% 30.14/30.35 (step t293 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t291 t292))
% 30.14/30.35 (step t294 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule contraction :premises (t293))
% 30.14/30.35 (step t295 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule implies :premises (t294))
% 30.14/30.35 (step t296 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t297 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 30.14/30.35 (step t297.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t297.t2 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t297.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 30.14/30.35 (step t297.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t297.t3))
% 30.14/30.35 (step t297.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 30.14/30.35 (step t297.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 30.14/30.35 (step t297.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 30.14/30.35 (step t297.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t297.t4 t297.t5 t297.t6 t297.t7))
% 30.14/30.35 (step t297 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 30.14/30.35 (step t298 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t296 t297 a117))
% 30.14/30.35 (step t299 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t295 t298))
% 30.14/30.35 (step t300 (cl (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule resolution :premises (t232 t261 t280 t288 t299))
% 30.14/30.35 (step t301 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule or_pos)
% 30.14/30.35 (step t302 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule reordering :premises (t301))
% 30.14/30.35 (step t303 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t304)
% 30.14/30.35 (assume t304.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 30.14/30.35 (step t304.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 30.14/30.35 (step t304.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule or :premises (t304.t1))
% 30.14/30.35 (step t304.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t304.t2 t304.a0))
% 30.14/30.35 (step t304 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule subproof :discharge (t304.a0))
% 30.14/30.35 (step t305 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t303 t304))
% 30.14/30.35 (step t306 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule implies_neg2)
% 30.14/30.35 (step t307 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t305 t306))
% 30.14/30.35 (step t308 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule contraction :premises (t307))
% 30.14/30.35 (step t309 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies :premises (t308))
% 30.14/30.35 (step t310 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 30.14/30.35 (anchor :step t311 :args ((U $$unsorted) (:= U U)))
% 30.14/30.35 (step t311.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t311.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 30.14/30.35 (step t311.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 30.14/30.35 (step t311.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t311.t2 t311.t3))
% 30.14/30.35 (step t311 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 30.14/30.35 (step t312 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t310 t311 a73))
% 30.14/30.35 (step t313 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t309 t312))
% 30.14/30.35 (step t314 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t302 a187 t313))
% 30.14/30.35 (step t315 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule or_pos)
% 30.14/30.35 (step t316 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule reordering :premises (t315))
% 30.14/30.35 (step t317 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t318)
% 30.14/30.35 (assume t318.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 30.14/30.35 (step t318.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 30.14/30.35 (step t318.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule or :premises (t318.t1))
% 30.14/30.35 (step t318.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t318.t2 t318.a0))
% 30.14/30.35 (step t318 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule subproof :discharge (t318.a0))
% 30.14/30.35 (step t319 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t317 t318))
% 30.14/30.35 (step t320 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule implies_neg2)
% 30.14/30.35 (step t321 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule resolution :premises (t319 t320))
% 30.14/30.35 (step t322 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule contraction :premises (t321))
% 30.14/30.35 (step t323 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule implies :premises (t322))
% 30.14/30.35 (step t324 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t323 t66))
% 30.14/30.35 (step t325 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule resolution :premises (t316 a187 t324))
% 30.14/30.35 (step t326 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t327 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t328)
% 30.14/30.35 (assume t328.a0 (tptp.ssList tptp.sk3))
% 30.14/30.35 (assume t328.a1 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (step t328.t1 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t328.t2)
% 30.14/30.35 (assume t328.t2.a0 (tptp.ssList tptp.sk3))
% 30.14/30.35 (assume t328.t2.a1 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (step t328.t2.t1 (cl (= (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 30.14/30.35 (step t328.t2.t2 (cl (not (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule equiv1 :premises (t328.t2.t1))
% 30.14/30.35 (step t328.t2.t3 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t328.t2.a1))
% 30.14/30.35 (step t328.t2.t4 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t328.t2.t3))
% 30.14/30.35 (step t328.t2.t5 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t328.t2.t4))
% 30.14/30.35 (step t328.t2.t6 (cl (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (tptp.ssList tptp.sk3))) :rule cong :premises (t328.t2.t5))
% 30.14/30.35 (step t328.t2.t7 (cl (= (= (tptp.ssList tptp.sk3) true) (tptp.ssList tptp.sk3))) :rule equiv_simplify)
% 30.14/30.35 (step t328.t2.t8 (cl (= (tptp.ssList tptp.sk3) true) (not (tptp.ssList tptp.sk3))) :rule equiv2 :premises (t328.t2.t7))
% 30.14/30.35 (step t328.t2.t9 (cl (= (tptp.ssList tptp.sk3) true)) :rule resolution :premises (t328.t2.t8 t328.t2.a0))
% 30.14/30.35 (step t328.t2.t10 (cl (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true)) :rule trans :premises (t328.t2.t6 t328.t2.t9))
% 30.14/30.35 (step t328.t2.t11 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t328.t2.t2 t328.t2.t10))
% 30.14/30.35 (step t328.t2 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule subproof :discharge (t328.t2.a0 t328.t2.a1))
% 30.14/30.35 (step t328.t3 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList tptp.sk3)) :rule and_pos)
% 30.14/30.35 (step t328.t4 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t328.t5 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t328.t2 t328.t3 t328.t4))
% 30.14/30.35 (step t328.t6 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t328.t5))
% 30.14/30.35 (step t328.t7 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule contraction :premises (t328.t6))
% 30.14/30.35 (step t328.t8 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t328.t1 t328.t7))
% 30.14/30.35 (step t328.t9 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg2)
% 30.14/30.35 (step t328.t10 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t328.t8 t328.t9))
% 30.14/30.35 (step t328.t11 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t328.t10))
% 30.14/30.35 (step t328.t12 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule implies :premises (t328.t11))
% 30.14/30.35 (step t328.t13 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t328.t14 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t328.t13 t328.a0 t328.a1))
% 30.14/30.35 (step t328.t15 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t328.t12 t328.t14))
% 30.14/30.35 (step t328 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule subproof :discharge (t328.a0 t328.a1))
% 30.14/30.35 (step t329 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList tptp.sk3)) :rule and_pos)
% 30.14/30.35 (step t330 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t331 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t328 t329 t330))
% 30.14/30.35 (step t332 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t331))
% 30.14/30.35 (step t333 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule contraction :premises (t332))
% 30.14/30.35 (step t334 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t327 t333))
% 30.14/30.35 (step t335 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg2)
% 30.14/30.35 (step t336 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t334 t335))
% 30.14/30.35 (step t337 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t336))
% 30.14/30.35 (step t338 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule implies :premises (t337))
% 30.14/30.35 (step t339 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t326 t338))
% 30.14/30.35 (step t340 (cl (not (= (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil tptp.sk3))))) (not (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 30.14/30.35 (step t341 (cl (= (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule refl)
% 30.14/30.35 (step t342 (cl (= (= (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) true) (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule equiv_simplify)
% 30.14/30.35 (step t343 (cl (not (= (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) true)) (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv1 :premises (t342))
% 30.14/30.35 (step t344 (cl (= (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))))) :rule all_simplify)
% 30.14/30.35 (step t345 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule refl)
% 30.14/30.35 (step t346 (cl (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule all_simplify)
% 30.14/30.35 (step t347 (cl (= (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule cong :premises (t345 t346))
% 30.14/30.35 (step t348 (cl (= (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) true)) :rule all_simplify)
% 30.14/30.35 (step t349 (cl (= (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) true)) :rule trans :premises (t347 t348))
% 30.14/30.35 (step t350 (cl (= (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) true)) :rule trans :premises (t344 t349))
% 30.14/30.35 (step t351 (cl (= (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t343 t350))
% 30.14/30.35 (step t352 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 30.14/30.35 (step t353 (cl (= (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil tptp.sk3))))) :rule cong :premises (t341 t351 t352))
% 30.14/30.35 (step t354 (cl (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule and_neg)
% 30.14/30.35 (step t355 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t356)
% 30.14/30.35 (assume t356.a0 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (assume t356.a1 (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))
% 30.14/30.35 (step t356.t1 (cl (=> (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3))) (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t356.t2)
% 30.14/30.35 (assume t356.t2.a0 (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))
% 30.14/30.35 (assume t356.t2.a1 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 30.14/30.35 (step t356.t2.t1 (cl (= (= (= tptp.nil tptp.sk3) false) (not (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 30.14/30.35 (step t356.t2.t2 (cl (not (= (= tptp.nil tptp.sk3) false)) (not (= tptp.nil tptp.sk3))) :rule equiv1 :premises (t356.t2.t1))
% 30.14/30.35 (step t356.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 30.14/30.35 (step t356.t2.t4 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t356.t2.a1))
% 30.14/30.35 (step t356.t2.t5 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t356.t2.t4))
% 30.14/30.35 (step t356.t2.t6 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t356.t2.t3 t356.t2.t5))
% 30.14/30.35 (step t356.t2.t7 (cl (= (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) false) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule equiv_simplify)
% 30.14/30.35 (step t356.t2.t8 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) false) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule equiv2 :premises (t356.t2.t7))
% 30.14/30.35 (step t356.t2.t9 (cl (not (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule not_not)
% 30.14/30.35 (step t356.t2.t10 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) false) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t356.t2.t8 t356.t2.t9))
% 30.14/30.35 (step t356.t2.t11 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) false)) :rule resolution :premises (t356.t2.t10 t356.t2.a0))
% 30.14/30.35 (step t356.t2.t12 (cl (= (= tptp.nil tptp.sk3) false)) :rule trans :premises (t356.t2.t6 t356.t2.t11))
% 30.14/30.35 (step t356.t2.t13 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t356.t2.t2 t356.t2.t12))
% 30.14/30.35 (step t356.t2 (cl (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t356.t2.a0 t356.t2.a1))
% 30.14/30.35 (step t356.t3 (cl (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 30.14/30.35 (step t356.t4 (cl (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t356.t5 (cl (not (= tptp.nil tptp.sk3)) (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t356.t2 t356.t3 t356.t4))
% 30.14/30.35 (step t356.t6 (cl (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t356.t5))
% 30.14/30.35 (step t356.t7 (cl (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t356.t6))
% 30.14/30.35 (step t356.t8 (cl (=> (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t356.t1 t356.t7))
% 30.14/30.35 (step t356.t9 (cl (=> (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 30.14/30.35 (step t356.t10 (cl (=> (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3))) (=> (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t356.t8 t356.t9))
% 30.14/30.35 (step t356.t11 (cl (=> (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t356.t10))
% 30.14/30.35 (step t356.t12 (cl (not (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t356.t11))
% 30.14/30.35 (step t356.t13 (cl (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 30.14/30.35 (step t356.t14 (cl (and (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t356.t13 t356.a1 t356.a0))
% 30.14/30.35 (step t356.t15 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t356.t12 t356.t14))
% 30.14/30.35 (step t356 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t356.a0 t356.a1))
% 30.14/30.35 (step t357 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 30.14/30.35 (step t358 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 30.14/30.35 (step t359 (cl (not (= tptp.nil tptp.sk3)) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t356 t357 t358))
% 30.14/30.35 (step t360 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t359))
% 30.14/30.35 (step t361 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t360))
% 30.14/30.35 (step t362 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t355 t361))
% 30.14/30.35 (step t363 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 30.14/30.35 (step t364 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t362 t363))
% 30.14/30.35 (step t365 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t364))
% 30.14/30.35 (step t366 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t365))
% 30.14/30.35 (step t367 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t354 t366))
% 30.14/30.35 (step t368 (cl (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule or_neg)
% 30.14/30.35 (step t369 (cl (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (not (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))))) :rule or_neg)
% 30.14/30.35 (step t370 (cl (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 30.14/30.35 (step t371 (cl (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t367 t368 t369 t370))
% 30.14/30.35 (step t372 (cl (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t371))
% 30.14/30.35 (step t373 (cl (or (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t340 t353 t372))
% 30.14/30.35 (step t374 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil tptp.sk3))) :rule or :premises (t373))
% 30.14/30.35 (step t375 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t374))
% 30.14/30.35 (step t376 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 30.14/30.35 (step t377 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t376))
% 30.14/30.35 (step t378 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t379)
% 30.14/30.35 (assume t379.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 30.14/30.35 (step t379.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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 30.14/30.35 (step t379.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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t379.t1))
% 30.14/30.35 (step t379.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t379.t2 t379.a0))
% 30.14/30.35 (step t379 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t379.a0))
% 30.14/30.35 (step t380 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t378 t379))
% 30.14/30.35 (step t381 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 30.14/30.35 (step t382 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t380 t381))
% 30.14/30.35 (step t383 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t382))
% 30.14/30.35 (step t384 (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.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t383))
% 30.14/30.35 (step t385 (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)
% 30.14/30.35 (anchor :step t386 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 30.14/30.35 (step t386.t1 (cl (= U U)) :rule refl)
% 30.14/30.35 (step t386.t2 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t386.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 30.14/30.35 (step t386.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t386.t3))
% 30.14/30.35 (step t386.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 30.14/30.35 (step t386.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 30.14/30.35 (step t386.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 (t386.t4 t386.t5 t386.t6))
% 30.14/30.35 (step t386 (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)
% 30.14/30.35 (step t387 (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 (t385 t386 a97))
% 30.14/30.35 (step t388 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule or_pos)
% 30.14/30.35 (step t389 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule reordering :premises (t388))
% 30.14/30.35 (step t390 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule equiv_pos2)
% 30.14/30.35 (step t391 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))) :rule refl)
% 30.14/30.35 (step t392 (cl (= (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule refl)
% 30.14/30.35 (step t393 (cl (= (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule refl)
% 30.14/30.35 (step t394 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule all_simplify)
% 30.14/30.35 (step t395 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule cong :premises (t392 t393 t394))
% 30.14/30.35 (step t396 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule cong :premises (t391 t395))
% 30.14/30.35 (step t397 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t398)
% 30.14/30.35 (assume t398.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 30.14/30.35 (step t398.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 30.14/30.35 (step t398.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or :premises (t398.t1))
% 30.14/30.35 (step t398.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t398.t2 t398.a0))
% 30.14/30.35 (step t398 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule subproof :discharge (t398.a0))
% 30.14/30.35 (step t399 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t397 t398))
% 30.14/30.35 (step t400 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies_neg2)
% 30.14/30.35 (step t401 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t399 t400))
% 30.14/30.35 (step t402 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule contraction :premises (t401))
% 30.14/30.35 (step t403 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t390 t396 t402))
% 30.14/30.35 (step t404 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule implies :premises (t403))
% 30.14/30.35 (step t405 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule or_pos)
% 30.14/30.35 (step t406 (cl (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule reordering :premises (t405))
% 30.14/30.35 (step t407 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t13 t30 t115 t68 t130 t132 t143 a188 t145 t153 t40 t161 a187 t163 t178 t180 t199 t230 t300 t314 t325 t339 a187 t375 t377 a7 t384 t387 t389 t404 a119 t406))
% 30.14/30.35 (step t408 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule contraction :premises (t407))
% 30.14/30.35 (step t409 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t410)
% 30.14/30.35 (assume t410.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 30.14/30.35 (step t410.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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 30.14/30.35 (step t410.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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or :premises (t410.t1))
% 30.14/30.35 (step t410.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t410.t2 t410.a0))
% 30.14/30.35 (step t410 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule subproof :discharge (t410.a0))
% 30.14/30.35 (step t411 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t409 t410))
% 30.14/30.35 (step t412 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies_neg2)
% 30.14/30.35 (step t413 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t411 t412))
% 30.14/30.35 (step t414 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule contraction :premises (t413))
% 30.14/30.35 (step t415 (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.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule implies :premises (t414))
% 30.14/30.35 (step t416 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5))) :rule resolution :premises (t408 t220 a51 t415 a85))
% 30.14/30.35 (step t417 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t416))
% 30.14/30.35 (step t418 (cl (not (= (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk4)) (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil tptp.sk4)))) (not (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk4))) (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil tptp.sk4))) :rule equiv_pos2)
% 30.14/30.35 (step t419 (cl (= (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule all_simplify)
% 30.14/30.35 (step t420 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))) :rule refl)
% 30.14/30.35 (step t421 (cl (= (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.nil tptp.sk4)) (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil tptp.sk4)))) :rule cong :premises (t419 t420))
% 30.14/30.35 (step t422 (cl (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t418 t421 a194))
% 30.14/30.35 (step t423 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil tptp.sk4)) :rule or :premises (t422))
% 30.14/30.35 (step t424 (cl (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t423))
% 30.14/30.35 (step t425 (cl (not (= (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.sk4)))) (not (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4))))) (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.sk4))) :rule equiv_pos2)
% 30.14/30.35 (step t426 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 30.14/30.35 (step t427 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 30.14/30.35 (step t428 (cl (= (= (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4)) true) (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4)))) :rule equiv_simplify)
% 30.14/30.35 (step t429 (cl (not (= (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4)) true)) (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4))) :rule equiv1 :premises (t428))
% 30.14/30.35 (step t430 (cl (= (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4)) (= (tptp.neq tptp.sk4 tptp.sk4) (not (not (tptp.neq tptp.sk4 tptp.sk4)))))) :rule all_simplify)
% 30.14/30.35 (step t431 (cl (= (tptp.neq tptp.sk4 tptp.sk4) (tptp.neq tptp.sk4 tptp.sk4))) :rule refl)
% 30.14/30.35 (step t432 (cl (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4))) :rule all_simplify)
% 30.14/30.35 (step t433 (cl (= (= (tptp.neq tptp.sk4 tptp.sk4) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (= (tptp.neq tptp.sk4 tptp.sk4) (tptp.neq tptp.sk4 tptp.sk4)))) :rule cong :premises (t431 t432))
% 30.14/30.35 (step t434 (cl (= (= (tptp.neq tptp.sk4 tptp.sk4) (tptp.neq tptp.sk4 tptp.sk4)) true)) :rule all_simplify)
% 30.14/30.35 (step t435 (cl (= (= (tptp.neq tptp.sk4 tptp.sk4) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) true)) :rule trans :premises (t433 t434))
% 30.14/30.35 (step t436 (cl (= (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4)) true)) :rule trans :premises (t430 t435))
% 30.14/30.35 (step t437 (cl (= (not (not (tptp.neq tptp.sk4 tptp.sk4))) (tptp.neq tptp.sk4 tptp.sk4))) :rule resolution :premises (t429 t436))
% 30.14/30.35 (step t438 (cl (= (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.sk4)))) :rule cong :premises (t426 t427 t437))
% 30.14/30.35 (step t439 (cl (not (= (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))))) (not (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule equiv_pos2)
% 30.14/30.35 (step t440 (cl (= (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule refl)
% 30.14/30.35 (step t441 (cl (= (= (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))))) :rule equiv_simplify)
% 30.14/30.35 (step t442 (cl (= (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (not (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))))) :rule equiv2 :premises (t441))
% 30.14/30.35 (step t443 (cl (not (not (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule not_not)
% 30.14/30.35 (step t444 (cl (= (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule resolution :premises (t442 t443))
% 30.14/30.35 (step t445 (cl (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t446)
% 30.14/30.35 (assume t446.a0 (tptp.neq tptp.sk4 tptp.nil))
% 30.14/30.35 (assume t446.a1 (= tptp.nil tptp.sk4))
% 30.14/30.35 (assume t446.a2 (not (tptp.neq tptp.sk4 tptp.sk4)))
% 30.14/30.35 (step t446.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 30.14/30.35 (step t446.t2 (cl (= (= false true) false)) :rule all_simplify)
% 30.14/30.35 (step t446.t3 (cl (= (= (tptp.neq tptp.sk4 tptp.sk4) false) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule equiv_simplify)
% 30.14/30.35 (step t446.t4 (cl (= (tptp.neq tptp.sk4 tptp.sk4) false) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule equiv2 :premises (t446.t3))
% 30.14/30.35 (step t446.t5 (cl (not (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (tptp.neq tptp.sk4 tptp.sk4)) :rule not_not)
% 30.14/30.35 (step t446.t6 (cl (= (tptp.neq tptp.sk4 tptp.sk4) false) (tptp.neq tptp.sk4 tptp.sk4)) :rule resolution :premises (t446.t4 t446.t5))
% 30.14/30.35 (step t446.t7 (cl (= (tptp.neq tptp.sk4 tptp.sk4) false)) :rule resolution :premises (t446.t6 t446.a2))
% 30.14/30.35 (step t446.t8 (cl (= false (tptp.neq tptp.sk4 tptp.sk4))) :rule symm :premises (t446.t7))
% 30.14/30.35 (step t446.t9 (cl (= tptp.sk4 tptp.sk4)) :rule refl)
% 30.14/30.35 (step t446.t10 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t446.a1))
% 30.14/30.35 (step t446.t11 (cl (= (tptp.neq tptp.sk4 tptp.sk4) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t446.t9 t446.t10))
% 30.14/30.35 (step t446.t12 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) true) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_simplify)
% 30.14/30.35 (step t446.t13 (cl (= (tptp.neq tptp.sk4 tptp.nil) true) (not (tptp.neq tptp.sk4 tptp.nil))) :rule equiv2 :premises (t446.t12))
% 30.14/30.35 (step t446.t14 (cl (= (tptp.neq tptp.sk4 tptp.nil) true)) :rule resolution :premises (t446.t13 t446.a0))
% 30.14/30.35 (step t446.t15 (cl (= false true)) :rule trans :premises (t446.t8 t446.t11 t446.t14))
% 30.14/30.35 (step t446.t16 (cl false) :rule resolution :premises (t446.t1 t446.t2 t446.t15))
% 30.14/30.35 (step t446 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.sk4))) false) :rule subproof :discharge (t446.a0 t446.a1 t446.a2))
% 30.14/30.35 (step t447 (cl (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (tptp.neq tptp.sk4 tptp.nil)) :rule and_pos)
% 30.14/30.35 (step t448 (cl (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 30.14/30.35 (step t449 (cl (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (tptp.neq tptp.sk4 tptp.sk4))) :rule and_pos)
% 30.14/30.35 (step t450 (cl false (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule resolution :premises (t446 t447 t448 t449))
% 30.14/30.35 (step t451 (cl (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) false) :rule reordering :premises (t450))
% 30.14/30.35 (step t452 (cl (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) false) :rule contraction :premises (t451))
% 30.14/30.35 (step t453 (cl (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) false) :rule resolution :premises (t445 t452))
% 30.14/30.35 (step t454 (cl (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (not false)) :rule implies_neg2)
% 30.14/30.35 (step t455 (cl (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false)) :rule resolution :premises (t453 t454))
% 30.14/30.35 (step t456 (cl (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false)) :rule contraction :premises (t455))
% 30.14/30.35 (step t457 (cl (= (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))))) :rule implies_simplify)
% 30.14/30.35 (step t458 (cl (not (=> (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false)) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule equiv1 :premises (t457))
% 30.14/30.35 (step t459 (cl (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule resolution :premises (t456 t458))
% 30.14/30.35 (step t460 (cl (= (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) false)) :rule resolution :premises (t444 t459))
% 30.14/30.35 (step t461 (cl (= (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) false))) :rule cong :premises (t440 t460))
% 30.14/30.35 (step t462 (cl (= (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) false) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))))) :rule all_simplify)
% 30.14/30.35 (step t463 (cl (= (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))))) :rule trans :premises (t461 t462))
% 30.14/30.35 (step t464 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t465)
% 30.14/30.35 (assume t465.a0 (= tptp.nil tptp.sk4))
% 30.14/30.35 (assume t465.a1 (tptp.neq tptp.sk4 tptp.nil))
% 30.14/30.35 (assume t465.a2 (not (tptp.neq tptp.sk4 tptp.sk4)))
% 30.14/30.35 (step t465.t1 (cl (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) (not (tptp.neq tptp.sk4 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule and_neg)
% 30.14/30.35 (step t465.t2 (cl (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule resolution :premises (t465.t1 t465.a1 t465.a0 t465.a2))
% 30.14/30.35 (step t465 (cl (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule subproof :discharge (t465.a0 t465.a1 t465.a2))
% 30.14/30.35 (step t466 (cl (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 30.14/30.35 (step t467 (cl (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (tptp.neq tptp.sk4 tptp.nil)) :rule and_pos)
% 30.14/30.35 (step t468 (cl (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (tptp.neq tptp.sk4 tptp.sk4))) :rule and_pos)
% 30.14/30.35 (step t469 (cl (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule resolution :premises (t465 t466 t467 t468))
% 30.14/30.35 (step t470 (cl (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule reordering :premises (t469))
% 30.14/30.35 (step t471 (cl (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4)))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule contraction :premises (t470))
% 30.14/30.35 (step t472 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule resolution :premises (t464 t471))
% 30.14/30.35 (step t473 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule implies_neg2)
% 30.14/30.35 (step t474 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4)))) (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule resolution :premises (t472 t473))
% 30.14/30.35 (step t475 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))) (and (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule contraction :premises (t474))
% 30.14/30.35 (step t476 (cl (not (and (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule resolution :premises (t439 t463 t475))
% 30.14/30.35 (step t477 (cl (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) :rule not_and :premises (t476))
% 30.14/30.35 (step t478 (cl (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 30.14/30.35 (step t479 (cl (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (not (tptp.neq tptp.sk4 tptp.nil)))) :rule or_neg)
% 30.14/30.35 (step t480 (cl (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (not (not (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule or_neg)
% 30.14/30.35 (step t481 (cl (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4)))) (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule resolution :premises (t477 t478 t479 t480))
% 30.14/30.35 (step t482 (cl (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (not (tptp.neq tptp.sk4 tptp.sk4))))) :rule contraction :premises (t481))
% 30.14/30.35 (step t483 (cl (or (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.sk4))) :rule resolution :premises (t425 t438 t482))
% 30.14/30.35 (step t484 (cl (not (= tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.sk4)) :rule or :premises (t483))
% 30.14/30.35 (step t485 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk4 tptp.sk4)) :rule reordering :premises (t484))
% 30.14/30.35 (step t486 (cl (not (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule equiv_pos2)
% 30.14/30.35 (step t487 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t3))
% 30.14/30.35 (step t488 (cl (= tptp.nil tptp.nil)) :rule refl)
% 30.14/30.35 (step t489 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t487 t488))
% 30.14/30.35 (step t490 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t486 t489 a191))
% 30.14/30.35 (step t491 (cl (not (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4))) :rule or_pos)
% 30.14/30.35 (step t492 (cl (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.sk4)) (not (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4))))) :rule reordering :premises (t491))
% 30.14/30.35 (step t493 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 30.14/30.35 (anchor :step t494)
% 30.14/30.35 (assume t494.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 30.14/30.35 (step t494.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4))))) :rule forall_inst :args ((:= V tptp.sk4)))
% 30.14/30.35 (step t494.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule or :premises (t494.t1))
% 30.14/30.35 (step t494.t3 (cl (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule resolution :premises (t494.t2 t494.a0))
% 30.14/30.35 (step t494 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule subproof :discharge (t494.a0))
% 30.14/30.35 (step t495 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule resolution :premises (t493 t494))
% 30.14/30.35 (step t496 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) (not (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4))))) :rule implies_neg2)
% 30.14/30.35 (step t497 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4))))) :rule resolution :premises (t495 t496))
% 30.14/30.35 (step t498 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4))))) :rule contraction :premises (t497))
% 30.14/30.35 (step t499 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule implies :premises (t498))
% 30.14/30.35 (step t500 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 30.14/30.35 (step t501 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 30.14/30.35 (anchor :step t502 :args ((V $$unsorted) (:= V V)))
% 30.14/30.35 (step t502.t1 (cl (= V V)) :rule refl)
% 30.14/30.35 (step t502.t2 (cl (= (= V V) true)) :rule all_simplify)
% 30.14/30.35 (step t502.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t502.t2))
% 30.14/30.35 (step t502.t4 (cl (= (not (= V V)) false)) :rule trans :premises (t502.t3 t240))
% 30.14/30.35 (step t502.t5 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 30.14/30.35 (step t502.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 30.14/30.35 (step t502.t7 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t502.t4 t502.t5 t502.t6 t502.t6))
% 30.14/30.35 (step t502.t8 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 30.14/30.35 (step t502.t9 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t502.t7 t502.t8))
% 30.14/30.35 (step t502 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 30.14/30.35 (step t503 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t501 t502))
% 30.14/30.35 (step t504 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t500 t503 a114))
% 30.14/30.35 (step t505 (cl (or (not (tptp.neq tptp.sk4 tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule resolution :premises (t499 t504))
% 30.14/30.35 (step t506 (cl (not (tptp.neq tptp.sk4 tptp.sk4))) :rule resolution :premises (t492 a188 t505))
% 30.14/30.35 (step t507 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t485 t490 t506))
% 30.14/30.35 (step t508 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t424 t507))
% 30.14/30.35 (step t509 (cl (tptp.ssItem tptp.sk5) (= tptp.nil tptp.sk4)) :rule or :premises (a192))
% 30.14/30.35 (step t510 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t509 t507))
% 30.14/30.35 (step t511 (cl) :rule resolution :premises (t417 t508 t510))
% 30.14/30.35
% 30.14/30.35 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.XW4yZj6lVM/cvc5---1.0.5_32255.smt2
% 30.14/30.35 % cvc5---1.0.5 exiting
% 30.14/30.36 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------