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