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