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