TSTP Solution File: SWC348-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC348-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n028.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:39 EDT 2024
% Result : Unsatisfiable 25.98s 26.27s
% Output : Proof 26.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWC348-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 26 15:06:24 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.48/10.70 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.54/15.74 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.57/20.76 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.58/25.80 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 25.98/26.27 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.jyysZhR0FY/cvc5---1.0.5_22103.smt2
% 25.98/26.27 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.jyysZhR0FY/cvc5---1.0.5_22103.smt2
% 26.08/26.30 (assume a0 (tptp.equalelemsP tptp.nil))
% 26.08/26.30 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 26.08/26.30 (assume a2 (tptp.strictorderedP tptp.nil))
% 26.08/26.30 (assume a3 (tptp.totalorderedP tptp.nil))
% 26.08/26.30 (assume a4 (tptp.strictorderP tptp.nil))
% 26.08/26.30 (assume a5 (tptp.totalorderP tptp.nil))
% 26.08/26.30 (assume a6 (tptp.cyclefreeP tptp.nil))
% 26.08/26.30 (assume a7 (tptp.ssList tptp.nil))
% 26.08/26.30 (assume a8 (tptp.ssItem tptp.skac3))
% 26.08/26.30 (assume a9 (tptp.ssItem tptp.skac2))
% 26.08/26.30 (assume a10 (not (tptp.singletonP tptp.nil)))
% 26.08/26.30 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 26.08/26.30 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 26.08/26.30 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 26.08/26.30 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 26.08/26.30 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 26.08/26.30 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 26.08/26.30 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 26.08/26.30 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 26.08/26.30 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 26.08/26.30 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 26.08/26.30 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 26.08/26.30 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 26.08/26.30 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 26.08/26.30 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 26.08/26.30 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 26.08/26.30 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 26.08/26.30 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 26.08/26.30 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 26.08/26.30 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 26.08/26.30 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 26.08/26.30 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 26.08/26.30 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 26.08/26.30 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 26.08/26.30 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 26.08/26.30 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 26.08/26.30 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 26.08/26.30 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 26.08/26.30 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 26.08/26.30 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 26.08/26.30 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 26.08/26.30 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 26.08/26.30 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 26.08/26.30 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 26.08/26.30 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 26.08/26.30 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 26.08/26.30 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 26.08/26.30 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 26.08/26.30 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 26.08/26.30 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 26.08/26.30 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 26.08/26.30 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 26.08/26.30 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 26.08/26.30 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 26.08/26.30 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 26.08/26.30 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 26.08/26.30 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.08/26.30 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 26.08/26.30 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 26.08/26.30 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 26.08/26.30 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 26.08/26.30 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 26.08/26.30 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.08/26.30 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.08/26.30 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 26.08/26.30 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 26.08/26.30 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 26.08/26.30 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.08/26.30 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.08/26.30 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.08/26.30 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.08/26.30 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 26.08/26.30 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.08/26.30 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 26.08/26.30 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.08/26.30 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 26.08/26.30 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.08/26.30 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.08/26.30 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.08/26.30 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 26.08/26.30 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 26.08/26.30 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 26.08/26.30 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 26.08/26.30 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 26.08/26.30 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.08/26.30 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.08/26.30 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.08/26.30 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.08/26.30 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 26.08/26.30 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 26.08/26.30 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.08/26.30 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.08/26.30 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 26.08/26.30 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 26.08/26.30 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 26.08/26.30 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 26.08/26.30 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 26.08/26.30 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 26.08/26.30 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 26.08/26.30 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 26.08/26.30 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 26.08/26.30 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 26.08/26.30 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 26.08/26.30 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.08/26.30 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 26.08/26.30 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 26.08/26.30 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 26.08/26.30 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 26.08/26.30 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 26.08/26.30 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.08/26.30 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.08/26.30 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 26.08/26.30 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 26.08/26.30 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 26.08/26.30 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 26.08/26.30 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 26.08/26.30 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 26.08/26.30 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 26.08/26.30 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 26.08/26.30 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 26.08/26.30 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 26.08/26.30 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 26.08/26.30 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 26.08/26.30 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 26.08/26.30 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 26.08/26.30 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 26.08/26.30 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 26.08/26.30 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 26.08/26.30 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 26.08/26.30 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 26.08/26.30 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 26.08/26.30 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 26.08/26.30 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 26.08/26.30 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 26.08/26.30 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 26.08/26.30 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 26.08/26.30 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 26.08/26.30 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 26.08/26.30 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 26.08/26.30 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 26.08/26.30 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 26.08/26.30 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 26.08/26.30 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 26.08/26.30 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 26.08/26.30 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 26.08/26.30 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 26.08/26.30 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 26.08/26.30 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 26.08/26.30 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 26.08/26.30 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 26.08/26.30 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 26.08/26.30 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 26.08/26.30 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 26.08/26.30 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 26.08/26.30 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 26.08/26.30 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 26.08/26.30 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 26.08/26.30 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 26.08/26.30 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 26.08/26.30 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 26.08/26.30 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 26.08/26.30 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 26.08/26.30 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 26.08/26.30 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 26.08/26.30 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 26.08/26.30 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 26.08/26.30 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 26.08/26.30 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 26.08/26.30 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 26.08/26.30 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 26.08/26.30 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 26.08/26.30 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 26.08/26.30 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 26.08/26.30 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 26.08/26.30 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 26.08/26.30 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 26.08/26.30 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 26.08/26.30 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 26.08/26.30 (assume a185 (tptp.ssList tptp.sk1))
% 26.08/26.30 (assume a186 (tptp.ssList tptp.sk2))
% 26.08/26.30 (assume a187 (tptp.ssList tptp.sk3))
% 26.08/26.30 (assume a188 (tptp.ssList tptp.sk4))
% 26.08/26.30 (assume a189 (= tptp.sk2 tptp.sk4))
% 26.08/26.30 (assume a190 (= tptp.sk1 tptp.sk3))
% 26.08/26.30 (assume a191 (tptp.segmentP tptp.sk4 tptp.sk3))
% 26.08/26.30 (assume a192 (or (tptp.singletonP tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 26.08/26.30 (assume a193 (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.strictorderedP tptp.sk1))))
% 26.08/26.30 (step t1 (cl (not (= (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (tptp.strictorderedP tptp.sk3) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))))) (not (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) (or (not (tptp.strictorderedP tptp.nil)) (tptp.strictorderedP tptp.sk3) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule equiv_pos2)
% 26.08/26.30 (step t2 (cl (= (not (tptp.strictorderedP tptp.nil)) (not (tptp.strictorderedP tptp.nil)))) :rule refl)
% 26.08/26.30 (step t3 (cl (= (= (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3)) true) (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3)))) :rule equiv_simplify)
% 26.08/26.30 (step t4 (cl (not (= (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3)) true)) (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3))) :rule equiv1 :premises (t3))
% 26.08/26.30 (step t5 (cl (= (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3)) (= (tptp.strictorderedP tptp.sk3) (not (not (tptp.strictorderedP tptp.sk3)))))) :rule all_simplify)
% 26.08/26.30 (step t6 (cl (= (tptp.strictorderedP tptp.sk3) (tptp.strictorderedP tptp.sk3))) :rule refl)
% 26.08/26.30 (step t7 (cl (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3))) :rule all_simplify)
% 26.08/26.30 (step t8 (cl (= (= (tptp.strictorderedP tptp.sk3) (not (not (tptp.strictorderedP tptp.sk3)))) (= (tptp.strictorderedP tptp.sk3) (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t6 t7))
% 26.08/26.30 (step t9 (cl (= (= (tptp.strictorderedP tptp.sk3) (tptp.strictorderedP tptp.sk3)) true)) :rule all_simplify)
% 26.08/26.30 (step t10 (cl (= (= (tptp.strictorderedP tptp.sk3) (not (not (tptp.strictorderedP tptp.sk3)))) true)) :rule trans :premises (t8 t9))
% 26.08/26.30 (step t11 (cl (= (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3)) true)) :rule trans :premises (t5 t10))
% 26.08/26.30 (step t12 (cl (= (not (not (tptp.strictorderedP tptp.sk3))) (tptp.strictorderedP tptp.sk3))) :rule resolution :premises (t4 t11))
% 26.08/26.30 (step t13 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 26.08/26.30 (step t14 (cl (= (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule refl)
% 26.08/26.30 (step t15 (cl (= (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk3 tptp.sk4)))) :rule refl)
% 26.08/26.30 (step t16 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule refl)
% 26.08/26.30 (step t17 (cl (= (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule refl)
% 26.08/26.30 (step t18 (cl (= (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule refl)
% 26.08/26.30 (step t19 (cl (= (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (tptp.strictorderedP tptp.sk3) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))))) :rule cong :premises (t2 t12 t13 t14 t15 t16 t17 t18))
% 26.08/26.30 (step t20 (cl (not (= (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))))) (not (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule equiv_pos2)
% 26.08/26.30 (step t21 (cl (= (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule refl)
% 26.08/26.30 (step t22 (cl (= (= (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))))) :rule equiv_simplify)
% 26.08/26.30 (step t23 (cl (= (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (not (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))))) :rule equiv2 :premises (t22))
% 26.08/26.30 (step t24 (cl (not (not (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule not_not)
% 26.08/26.30 (step t25 (cl (= (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule resolution :premises (t23 t24))
% 26.08/26.30 (step t26 (cl (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t27)
% 26.08/26.30 (assume t27.a0 (tptp.strictorderedP tptp.nil))
% 26.08/26.30 (assume t27.a1 (= tptp.nil tptp.sk4))
% 26.08/26.30 (assume t27.a2 (= tptp.sk3 tptp.sk4))
% 26.08/26.30 (assume t27.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 26.08/26.30 (assume t27.a4 (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))
% 26.08/26.30 (assume t27.a5 (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))
% 26.08/26.30 (assume t27.a6 (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))
% 26.08/26.30 (assume t27.a7 (not (tptp.strictorderedP tptp.sk3)))
% 26.08/26.30 (step t27.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 26.08/26.30 (step t27.t2 (cl (= (= false true) false)) :rule all_simplify)
% 26.08/26.30 (step t27.t3 (cl (= (= (tptp.strictorderedP tptp.sk3) false) (not (tptp.strictorderedP tptp.sk3)))) :rule equiv_simplify)
% 26.08/26.30 (step t27.t4 (cl (= (tptp.strictorderedP tptp.sk3) false) (not (not (tptp.strictorderedP tptp.sk3)))) :rule equiv2 :premises (t27.t3))
% 26.08/26.30 (step t27.t5 (cl (not (not (not (tptp.strictorderedP tptp.sk3)))) (tptp.strictorderedP tptp.sk3)) :rule not_not)
% 26.08/26.30 (step t27.t6 (cl (= (tptp.strictorderedP tptp.sk3) false) (tptp.strictorderedP tptp.sk3)) :rule resolution :premises (t27.t4 t27.t5))
% 26.08/26.30 (step t27.t7 (cl (= (tptp.strictorderedP tptp.sk3) false)) :rule resolution :premises (t27.t6 t27.a7))
% 26.08/26.30 (step t27.t8 (cl (= false (tptp.strictorderedP tptp.sk3))) :rule symm :premises (t27.t7))
% 26.08/26.30 (step t27.t9 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t27.a1))
% 26.08/26.30 (step t27.t10 (cl (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil)) :rule symm :premises (t27.a4))
% 26.08/26.30 (step t27.t11 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 26.08/26.30 (step t27.t12 (cl (= (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3) (tptp.app tptp.nil tptp.sk3))) :rule cong :premises (t27.t10 t27.t11))
% 26.08/26.30 (step t27.t13 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t27.a3))
% 26.08/26.30 (step t27.t14 (cl (= (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3) tptp.sk3)) :rule trans :premises (t27.t12 t27.t13))
% 26.08/26.30 (step t27.t15 (cl (= (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)) (tptp.app tptp.nil tptp.sk3))) :rule cong :premises (t27.t9 t27.t14))
% 26.08/26.30 (step t27.t16 (cl (= (tptp.app tptp.nil tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) :rule symm :premises (t27.t15))
% 26.08/26.30 (step t27.t17 (cl (= (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)) (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule symm :premises (t27.a5))
% 26.08/26.30 (step t27.t18 (cl (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk4)) :rule symm :premises (t27.a6))
% 26.08/26.30 (step t27.t19 (cl (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule symm :premises (t27.t18))
% 26.08/26.30 (step t27.t20 (cl (= (tptp.app tptp.sk4 tptp.sk3) (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3))) :rule cong :premises (t27.t19 t27.t11))
% 26.08/26.30 (step t27.t21 (cl (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 tptp.sk3))) :rule symm :premises (t27.t20))
% 26.08/26.30 (step t27.t22 (cl (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk3))) :rule trans :premises (t27.a3 t27.t16 t27.t17 t27.t21))
% 26.08/26.30 (step t27.t23 (cl (= (tptp.strictorderedP tptp.sk3) (tptp.strictorderedP (tptp.app tptp.sk4 tptp.sk3)))) :rule cong :premises (t27.t22))
% 26.08/26.30 (step t27.t24 (cl (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) :rule symm :premises (t27.t17))
% 26.08/26.30 (step t27.t25 (cl (= tptp.sk4 tptp.sk3)) :rule symm :premises (t27.a2))
% 26.08/26.30 (step t27.t26 (cl (= tptp.sk3 tptp.sk4)) :rule symm :premises (t27.t25))
% 26.08/26.30 (step t27.t27 (cl (= (tptp.app tptp.sk4 tptp.sk3) tptp.nil)) :rule trans :premises (t27.t20 t27.t24 t27.t15 t27.t13 t27.t26 t27.t9))
% 26.08/26.30 (step t27.t28 (cl (= (tptp.strictorderedP (tptp.app tptp.sk4 tptp.sk3)) (tptp.strictorderedP tptp.nil))) :rule cong :premises (t27.t27))
% 26.08/26.30 (step t27.t29 (cl (= (= (tptp.strictorderedP tptp.nil) true) (tptp.strictorderedP tptp.nil))) :rule equiv_simplify)
% 26.08/26.30 (step t27.t30 (cl (= (tptp.strictorderedP tptp.nil) true) (not (tptp.strictorderedP tptp.nil))) :rule equiv2 :premises (t27.t29))
% 26.08/26.30 (step t27.t31 (cl (= (tptp.strictorderedP tptp.nil) true)) :rule resolution :premises (t27.t30 t27.a0))
% 26.08/26.30 (step t27.t32 (cl (= false true)) :rule trans :premises (t27.t8 t27.t23 t27.t28 t27.t31))
% 26.08/26.30 (step t27.t33 (cl false) :rule resolution :premises (t27.t1 t27.t2 t27.t32))
% 26.08/26.30 (step t27 (cl (not (tptp.strictorderedP tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (not (tptp.strictorderedP tptp.sk3))) false) :rule subproof :discharge (t27.a0 t27.a1 t27.a2 t27.a3 t27.a4 t27.a5 t27.a6 t27.a7))
% 26.08/26.30 (step t28 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (tptp.strictorderedP tptp.nil)) :rule and_pos)
% 26.08/26.30 (step t29 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 26.08/26.30 (step t30 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (= tptp.sk3 tptp.sk4)) :rule and_pos)
% 26.08/26.30 (step t31 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 26.08/26.30 (step t32 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule and_pos)
% 26.08/26.30 (step t33 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) :rule and_pos)
% 26.08/26.30 (step t34 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule and_pos)
% 26.08/26.30 (step t35 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (tptp.strictorderedP tptp.sk3))) :rule and_pos)
% 26.08/26.30 (step t36 (cl false (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) :rule resolution :premises (t27 t28 t29 t30 t31 t32 t33 t34 t35))
% 26.08/26.30 (step t37 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) false) :rule reordering :premises (t36))
% 26.08/26.30 (step t38 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) false) :rule contraction :premises (t37))
% 26.08/26.30 (step t39 (cl (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) false) :rule resolution :premises (t26 t38))
% 26.08/26.30 (step t40 (cl (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (not false)) :rule implies_neg2)
% 26.08/26.30 (step t41 (cl (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false)) :rule resolution :premises (t39 t40))
% 26.08/26.30 (step t42 (cl (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false)) :rule contraction :premises (t41))
% 26.08/26.30 (step t43 (cl (= (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))))) :rule implies_simplify)
% 26.08/26.30 (step t44 (cl (not (=> (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false)) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) :rule equiv1 :premises (t43))
% 26.08/26.30 (step t45 (cl (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) :rule resolution :premises (t42 t44))
% 26.08/26.30 (step t46 (cl (= (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) false)) :rule resolution :premises (t25 t45))
% 26.08/26.30 (step t47 (cl (= (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) false))) :rule cong :premises (t21 t46))
% 26.08/26.30 (step t48 (cl (= (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) false) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))))) :rule all_simplify)
% 26.08/26.30 (step t49 (cl (= (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))))) :rule trans :premises (t47 t48))
% 26.08/26.30 (step t50 (cl (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t51)
% 26.08/26.30 (assume t51.a0 (tptp.strictorderedP tptp.nil))
% 26.08/26.30 (assume t51.a1 (not (tptp.strictorderedP tptp.sk3)))
% 26.08/26.30 (assume t51.a2 (= tptp.nil tptp.sk4))
% 26.08/26.30 (assume t51.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 26.08/26.30 (assume t51.a4 (= tptp.sk3 tptp.sk4))
% 26.08/26.30 (assume t51.a5 (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))
% 26.08/26.30 (assume t51.a6 (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))
% 26.08/26.30 (assume t51.a7 (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))
% 26.08/26.30 (step t51.t1 (cl (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) (not (tptp.strictorderedP tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (not (tptp.strictorderedP tptp.sk3)))) :rule and_neg)
% 26.08/26.30 (step t51.t2 (cl (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule resolution :premises (t51.t1 t51.a0 t51.a2 t51.a4 t51.a3 t51.a6 t51.a7 t51.a5 t51.a1))
% 26.08/26.30 (step t51 (cl (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule subproof :discharge (t51.a0 t51.a1 t51.a2 t51.a3 t51.a4 t51.a5 t51.a6 t51.a7))
% 26.08/26.30 (step t52 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (tptp.strictorderedP tptp.nil)) :rule and_pos)
% 26.08/26.30 (step t53 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (tptp.strictorderedP tptp.sk3))) :rule and_pos)
% 26.08/26.30 (step t54 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 26.08/26.30 (step t55 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 26.08/26.30 (step t56 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (= tptp.sk3 tptp.sk4)) :rule and_pos)
% 26.08/26.30 (step t57 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule and_pos)
% 26.08/26.30 (step t58 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule and_pos)
% 26.08/26.30 (step t59 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) :rule and_pos)
% 26.08/26.30 (step t60 (cl (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule resolution :premises (t51 t52 t53 t54 t55 t56 t57 t58 t59))
% 26.08/26.30 (step t61 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule reordering :premises (t60))
% 26.08/26.30 (step t62 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule contraction :premises (t61))
% 26.08/26.30 (step t63 (cl (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) :rule resolution :premises (t50 t62))
% 26.08/26.30 (step t64 (cl (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (not (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) :rule implies_neg2)
% 26.08/26.30 (step t65 (cl (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3)))) (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) :rule resolution :premises (t63 t64))
% 26.08/26.30 (step t66 (cl (=> (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) (and (tptp.strictorderedP tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk3 tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.strictorderedP tptp.sk3))))) :rule contraction :premises (t65))
% 26.08/26.30 (step t67 (cl (not (and (tptp.strictorderedP tptp.nil) (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk4) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule resolution :premises (t20 t49 t66))
% 26.08/26.30 (step t68 (cl (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule not_and :premises (t67))
% 26.08/26.30 (step t69 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (tptp.strictorderedP tptp.nil)))) :rule or_neg)
% 26.08/26.30 (step t70 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (not (tptp.strictorderedP tptp.sk3))))) :rule or_neg)
% 26.08/26.30 (step t71 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 26.08/26.30 (step t72 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule or_neg)
% 26.08/26.30 (step t73 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (= tptp.sk3 tptp.sk4)))) :rule or_neg)
% 26.08/26.30 (step t74 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))))) :rule or_neg)
% 26.08/26.30 (step t75 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule or_neg)
% 26.08/26.30 (step t76 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule or_neg)
% 26.08/26.30 (step t77 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule resolution :premises (t68 t69 t70 t71 t72 t73 t74 t75 t76))
% 26.08/26.30 (step t78 (cl (or (not (tptp.strictorderedP tptp.nil)) (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule contraction :premises (t77))
% 26.08/26.30 (step t79 (cl (or (not (tptp.strictorderedP tptp.nil)) (tptp.strictorderedP tptp.sk3) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule resolution :premises (t1 t19 t78))
% 26.08/26.30 (step t80 (cl (not (tptp.strictorderedP tptp.nil)) (tptp.strictorderedP tptp.sk3) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule or :premises (t79))
% 26.08/26.30 (step t81 (cl (tptp.strictorderedP tptp.sk3) (not (tptp.strictorderedP tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) (not (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule reordering :premises (t80))
% 26.08/26.30 (step t82 (cl (not (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4)) :rule or_pos)
% 26.08/26.30 (step t83 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 tptp.sk4) (not (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4)))) :rule reordering :premises (t82))
% 26.08/26.30 (step t84 (cl (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.nil)) (not (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_neg)
% 26.08/26.30 (step t85 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4)) (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t86)
% 26.08/26.30 (assume t86.a0 (= tptp.nil tptp.sk4))
% 26.08/26.30 (assume t86.a1 (tptp.segmentP tptp.sk3 tptp.nil))
% 26.08/26.30 (assume t86.a2 (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))))
% 26.08/26.30 (assume t86.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 26.08/26.30 (step t86.t1 (cl (=> (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t86.t2)
% 26.08/26.30 (assume t86.t2.a0 (tptp.segmentP tptp.sk3 tptp.nil))
% 26.08/26.30 (assume t86.t2.a1 (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))))
% 26.08/26.30 (assume t86.t2.a2 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 26.08/26.30 (assume t86.t2.a3 (= tptp.nil tptp.sk4))
% 26.08/26.30 (step t86.t2.t1 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) true) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule equiv_simplify)
% 26.08/26.30 (step t86.t2.t2 (cl (not (= (tptp.segmentP tptp.sk3 tptp.sk4) true)) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule equiv1 :premises (t86.t2.t1))
% 26.08/26.30 (step t86.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.nil)) :rule symm :premises (t86.t2.a2))
% 26.08/26.30 (step t86.t2.t4 (cl (= (tptp.skaf45 tptp.sk3 tptp.nil) (tptp.skaf45 tptp.sk3 tptp.nil))) :rule refl)
% 26.08/26.30 (step t86.t2.t5 (cl (= (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.skaf45 tptp.sk3 tptp.nil)) (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) :rule cong :premises (t86.t2.t3 t86.t2.t4))
% 26.08/26.30 (step t86.t2.t6 (cl (= (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)) tptp.sk3)) :rule symm :premises (t86.t2.a1))
% 26.08/26.30 (step t86.t2.t7 (cl (= (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.skaf45 tptp.sk3 tptp.nil)) tptp.sk3)) :rule trans :premises (t86.t2.t5 t86.t2.t6))
% 26.08/26.30 (step t86.t2.t8 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.skaf45 tptp.sk3 tptp.nil)))) :rule symm :premises (t86.t2.t7))
% 26.08/26.30 (step t86.t2.t9 (cl (= tptp.sk4 tptp.sk4)) :rule refl)
% 26.08/26.30 (step t86.t2.t10 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.skaf45 tptp.sk3 tptp.nil)) tptp.sk4))) :rule cong :premises (t86.t2.t8 t86.t2.t9))
% 26.08/26.30 (step t86.t2.t11 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t86.t2.a3))
% 26.08/26.30 (step t86.t2.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.skaf45 tptp.sk3 tptp.nil)) tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil))) :rule cong :premises (t86.t2.t7 t86.t2.t11))
% 26.08/26.30 (step t86.t2.t13 (cl (= (= (tptp.segmentP tptp.sk3 tptp.nil) true) (tptp.segmentP tptp.sk3 tptp.nil))) :rule equiv_simplify)
% 26.08/26.30 (step t86.t2.t14 (cl (= (tptp.segmentP tptp.sk3 tptp.nil) true) (not (tptp.segmentP tptp.sk3 tptp.nil))) :rule equiv2 :premises (t86.t2.t13))
% 26.08/26.30 (step t86.t2.t15 (cl (= (tptp.segmentP tptp.sk3 tptp.nil) true)) :rule resolution :premises (t86.t2.t14 t86.t2.a0))
% 26.08/26.30 (step t86.t2.t16 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) true)) :rule trans :premises (t86.t2.t10 t86.t2.t12 t86.t2.t15))
% 26.08/26.30 (step t86.t2.t17 (cl (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t86.t2.t2 t86.t2.t16))
% 26.08/26.30 (step t86.t2 (cl (not (tptp.segmentP tptp.sk3 tptp.nil)) (not (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 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.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule subproof :discharge (t86.t2.a0 t86.t2.a1 t86.t2.a2 t86.t2.a3))
% 26.08/26.30 (step t86.t3 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.nil)) :rule and_pos)
% 26.08/26.30 (step t86.t4 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) :rule and_pos)
% 26.08/26.30 (step t86.t5 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 26.08/26.30 (step t86.t6 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 26.08/26.30 (step t86.t7 (cl (tptp.segmentP tptp.sk3 tptp.sk4) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t86.t2 t86.t3 t86.t4 t86.t5 t86.t6))
% 26.08/26.30 (step t86.t8 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule reordering :premises (t86.t7))
% 26.08/26.30 (step t86.t9 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule contraction :premises (t86.t8))
% 26.08/26.30 (step t86.t10 (cl (=> (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t86.t1 t86.t9))
% 26.08/26.30 (step t86.t11 (cl (=> (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule implies_neg2)
% 26.08/26.30 (step t86.t12 (cl (=> (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) (=> (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t86.t10 t86.t11))
% 26.08/26.30 (step t86.t13 (cl (=> (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule contraction :premises (t86.t12))
% 26.08/26.30 (step t86.t14 (cl (not (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule implies :premises (t86.t13))
% 26.08/26.30 (step t86.t15 (cl (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.nil)) (not (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 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.nil tptp.sk4))) :rule and_neg)
% 26.08/26.30 (step t86.t16 (cl (and (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil tptp.sk4))) :rule resolution :premises (t86.t15 t86.a1 t86.a2 t86.a3 t86.a0))
% 26.08/26.30 (step t86.t17 (cl (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t86.t14 t86.t16))
% 26.08/26.30 (step t86 (cl (not (= tptp.nil tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.nil)) (not (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule subproof :discharge (t86.a0 t86.a1 t86.a2 t86.a3))
% 26.08/26.30 (step t87 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 26.08/26.30 (step t88 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.nil)) :rule and_pos)
% 26.08/26.30 (step t89 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) :rule and_pos)
% 26.08/26.30 (step t90 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 26.08/26.30 (step t91 (cl (tptp.segmentP tptp.sk3 tptp.sk4) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 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 (t86 t87 t88 t89 t90))
% 26.08/26.30 (step t92 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule reordering :premises (t91))
% 26.08/26.30 (step t93 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule contraction :premises (t92))
% 26.08/26.30 (step t94 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t85 t93))
% 26.08/26.30 (step t95 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule implies_neg2)
% 26.08/26.30 (step t96 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4)) (=> (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t94 t95))
% 26.08/26.30 (step t97 (cl (=> (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule contraction :premises (t96))
% 26.08/26.30 (step t98 (cl (not (and (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk3 tptp.nil) (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule implies :premises (t97))
% 26.08/26.30 (step t99 (cl (not (= tptp.nil tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.nil)) (not (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t84 t98))
% 26.08/26.30 (step t100 (cl (not (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4) (not (tptp.segmentP tptp.sk3 tptp.nil)) (not (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule reordering :premises (t99))
% 26.08/26.30 (step t101 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)) :rule or_pos)
% 26.08/26.30 (step t102 (cl (tptp.neq tptp.sk4 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (= tptp.nil tptp.sk4) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t101))
% 26.08/26.30 (step t103 (cl (tptp.singletonP tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 26.08/26.30 (step t104 (cl (not (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule or_pos)
% 26.08/26.30 (step t105 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.singletonP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (not (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule reordering :premises (t104))
% 26.08/26.30 (step t106 (cl (not (= (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (tptp.strictorderedP tptp.sk3) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))))) (not (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) (or (tptp.strictorderedP tptp.sk3) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule equiv_pos2)
% 26.08/26.30 (step t107 (cl (= (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule refl)
% 26.08/26.30 (step t108 (cl (= (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule refl)
% 26.08/26.30 (step t109 (cl (= (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (tptp.strictorderedP tptp.sk3) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))))) :rule cong :premises (t12 t107 t108))
% 26.08/26.30 (step t110 (cl (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false) (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t111)
% 26.08/26.30 (assume t111.a0 (not (tptp.strictorderedP tptp.sk3)))
% 26.08/26.30 (assume t111.a1 (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))
% 26.08/26.30 (assume t111.a2 (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))
% 26.08/26.30 (step t111.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 26.08/26.30 (step t111.t2 (cl (= (= true false) false)) :rule all_simplify)
% 26.08/26.30 (step t111.t3 (cl (= (= (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) true) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule equiv_simplify)
% 26.08/26.30 (step t111.t4 (cl (= (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) true) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule equiv2 :premises (t111.t3))
% 26.08/26.30 (step t111.t5 (cl (= (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) true)) :rule resolution :premises (t111.t4 t111.a2))
% 26.08/26.30 (step t111.t6 (cl (= true (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule symm :premises (t111.t5))
% 26.08/26.30 (step t111.t7 (cl (= (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil) tptp.sk3)) :rule symm :premises (t111.a1))
% 26.08/26.30 (step t111.t8 (cl (= (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t111.t7))
% 26.08/26.30 (step t111.t9 (cl (= (= (tptp.strictorderedP tptp.sk3) false) (not (tptp.strictorderedP tptp.sk3)))) :rule equiv_simplify)
% 26.08/26.30 (step t111.t10 (cl (= (tptp.strictorderedP tptp.sk3) false) (not (not (tptp.strictorderedP tptp.sk3)))) :rule equiv2 :premises (t111.t9))
% 26.08/26.30 (step t111.t11 (cl (not (not (not (tptp.strictorderedP tptp.sk3)))) (tptp.strictorderedP tptp.sk3)) :rule not_not)
% 26.08/26.30 (step t111.t12 (cl (= (tptp.strictorderedP tptp.sk3) false) (tptp.strictorderedP tptp.sk3)) :rule resolution :premises (t111.t10 t111.t11))
% 26.08/26.30 (step t111.t13 (cl (= (tptp.strictorderedP tptp.sk3) false)) :rule resolution :premises (t111.t12 t111.a0))
% 26.08/26.30 (step t111.t14 (cl (= true false)) :rule trans :premises (t111.t6 t111.t8 t111.t13))
% 26.08/26.30 (step t111.t15 (cl false) :rule resolution :premises (t111.t1 t111.t2 t111.t14))
% 26.08/26.30 (step t111 (cl (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false) :rule subproof :discharge (t111.a0 t111.a1 t111.a2))
% 26.08/26.30 (step t112 (cl (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (tptp.strictorderedP tptp.sk3))) :rule and_pos)
% 26.08/26.30 (step t113 (cl (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule and_pos)
% 26.08/26.30 (step t114 (cl (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule and_pos)
% 26.08/26.30 (step t115 (cl false (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t111 t112 t113 t114))
% 26.08/26.30 (step t116 (cl (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) false) :rule reordering :premises (t115))
% 26.08/26.30 (step t117 (cl (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) false) :rule contraction :premises (t116))
% 26.08/26.30 (step t118 (cl (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false) false) :rule resolution :premises (t110 t117))
% 26.08/26.30 (step t119 (cl (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false) (not false)) :rule implies_neg2)
% 26.08/26.30 (step t120 (cl (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false) (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false)) :rule resolution :premises (t118 t119))
% 26.08/26.30 (step t121 (cl (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false)) :rule contraction :premises (t120))
% 26.08/26.30 (step t122 (cl (= (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false) (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))))) :rule implies_simplify)
% 26.08/26.30 (step t123 (cl (not (=> (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) false)) (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule equiv1 :premises (t122))
% 26.08/26.30 (step t124 (cl (not (and (not (tptp.strictorderedP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t121 t123))
% 26.08/26.30 (step t125 (cl (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule not_and :premises (t124))
% 26.08/26.30 (step t126 (cl (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (not (not (tptp.strictorderedP tptp.sk3))))) :rule or_neg)
% 26.08/26.30 (step t127 (cl (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule or_neg)
% 26.08/26.30 (step t128 (cl (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule or_neg)
% 26.08/26.30 (step t129 (cl (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t125 t126 t127 t128))
% 26.08/26.30 (step t130 (cl (or (not (not (tptp.strictorderedP tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule contraction :premises (t129))
% 26.08/26.30 (step t131 (cl (or (tptp.strictorderedP tptp.sk3) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t106 t109 t130))
% 26.08/26.30 (step t132 (cl (tptp.strictorderedP tptp.sk3) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule or :premises (t131))
% 26.08/26.30 (step t133 (cl (not (= (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.strictorderedP tptp.sk1))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3))))) (not (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)))) :rule equiv_pos2)
% 26.08/26.30 (step t134 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.08/26.30 (step t135 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t134 a190 a189))
% 26.08/26.30 (step t136 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t135))
% 26.08/26.30 (step t137 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t135))
% 26.08/26.30 (step t138 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule cong :premises (t136 t137))
% 26.08/26.30 (step t139 (cl (= (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule cong :premises (t138))
% 26.08/26.30 (step t140 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t137))
% 26.08/26.30 (step t141 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t140))
% 26.08/26.30 (step t142 (cl (= (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.strictorderedP tptp.sk1))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3))))) :rule cong :premises (t139 t141))
% 26.08/26.30 (step t143 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)))) :rule resolution :premises (t133 t142 a193))
% 26.08/26.30 (step t144 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3))) :rule or :premises (t143))
% 26.08/26.30 (step t145 (cl (not (tptp.strictorderedP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule reordering :premises (t144))
% 26.08/26.30 (step t146 (cl (not (tptp.strictorderedP tptp.sk3))) :rule resolution :premises (t145 a191))
% 26.08/26.30 (step t147 (cl (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule or_pos)
% 26.08/26.30 (step t148 (cl (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule reordering :premises (t147))
% 26.08/26.30 (step t149 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t150)
% 26.08/26.30 (assume t150.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 26.08/26.30 (step t150.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.08/26.30 (step t150.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule or :premises (t150.t1))
% 26.08/26.30 (step t150.t3 (cl (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule resolution :premises (t150.t2 t150.a0))
% 26.08/26.30 (step t150 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule subproof :discharge (t150.a0))
% 26.08/26.30 (step t151 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule resolution :premises (t149 t150))
% 26.08/26.30 (step t152 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule implies_neg2)
% 26.08/26.30 (step t153 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule resolution :premises (t151 t152))
% 26.08/26.30 (step t154 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule contraction :premises (t153))
% 26.08/26.30 (step t155 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule implies :premises (t154))
% 26.08/26.30 (step t156 (cl (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule resolution :premises (t155 a46))
% 26.08/26.30 (step t157 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil))))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t158)
% 26.08/26.30 (assume t158.a0 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 26.08/26.30 (step t158.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.skaf44 tptp.sk3))))
% 26.08/26.30 (step t158.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule or :premises (t158.t1))
% 26.08/26.30 (step t158.t3 (cl (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t158.t2 t158.a0))
% 26.08/26.30 (step t158 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule subproof :discharge (t158.a0))
% 26.08/26.30 (step t159 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t157 t158))
% 26.08/26.30 (step t160 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 26.08/26.30 (step t161 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t159 t160))
% 26.08/26.30 (step t162 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule contraction :premises (t161))
% 26.08/26.30 (step t163 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule implies :premises (t162))
% 26.08/26.30 (step t164 (cl (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t163 a65))
% 26.08/26.30 (step t165 (cl (tptp.strictorderedP (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule resolution :premises (t148 t156 t164))
% 26.08/26.30 (step t166 (cl (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t132 t146 t165))
% 26.08/26.30 (step t167 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t168)
% 26.08/26.30 (assume t168.a0 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))))
% 26.08/26.30 (step t168.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.08/26.30 (step t168.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule or :premises (t168.t1))
% 26.08/26.30 (step t168.t3 (cl (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t168.t2 t168.a0))
% 26.08/26.30 (step t168 (cl (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule subproof :discharge (t168.a0))
% 26.08/26.30 (step t169 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t167 t168))
% 26.08/26.30 (step t170 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 26.08/26.30 (step t171 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t169 t170))
% 26.08/26.30 (step t172 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule contraction :premises (t171))
% 26.08/26.30 (step t173 (cl (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule implies :premises (t172))
% 26.08/26.30 (step t174 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule equiv_pos2)
% 26.08/26.30 (anchor :step t175 :args ((U $$unsorted) (:= U U)))
% 26.08/26.30 (step t175.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t175.t2 (cl (= (not (tptp.singletonP U)) (not (tptp.singletonP U)))) :rule refl)
% 26.08/26.30 (step t175.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t175.t4 (cl (= (= (tptp.cons (tptp.skaf44 U) tptp.nil) U) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) :rule all_simplify)
% 26.08/26.30 (step t175.t5 (cl (= (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule cong :premises (t175.t2 t175.t3 t175.t4))
% 26.08/26.30 (step t175 (cl (= (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))))) :rule bind)
% 26.08/26.30 (step t176 (cl (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule resolution :premises (t174 t175 a100))
% 26.08/26.30 (step t177 (cl (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t173 t176))
% 26.08/26.30 (step t178 (cl (not (tptp.singletonP tptp.sk3))) :rule resolution :premises (t105 a187 t166 t177))
% 26.08/26.30 (step t179 (cl (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t103 t178))
% 26.08/26.30 (step t180 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t181)
% 26.08/26.30 (assume t181.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 26.08/26.30 (step t181.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk4)))
% 26.08/26.30 (step t181.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule or :premises (t181.t1))
% 26.08/26.30 (step t181.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t181.t2 t181.a0))
% 26.08/26.30 (step t181 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule subproof :discharge (t181.a0))
% 26.08/26.30 (step t182 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t180 t181))
% 26.08/26.30 (step t183 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 26.08/26.30 (step t184 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t182 t183))
% 26.08/26.30 (step t185 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t184))
% 26.08/26.30 (step t186 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule implies :premises (t185))
% 26.08/26.30 (step t187 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 26.08/26.30 (anchor :step t188 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.08/26.30 (step t188.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t188.t2 (cl (= V V)) :rule refl)
% 26.08/26.30 (step t188.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t188.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.08/26.30 (step t188.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 26.08/26.30 (step t188.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 26.08/26.30 (step t188.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t188.t3 t188.t4 t188.t5 t188.t6))
% 26.08/26.30 (step t188 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 26.08/26.30 (step t189 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t187 t188 a99))
% 26.08/26.30 (step t190 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t186 t189))
% 26.08/26.30 (step t191 (cl (= tptp.nil tptp.sk4)) :rule resolution :premises (t102 t179 a7 a188 t190))
% 26.08/26.30 (step t192 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil)) :rule or_pos)
% 26.08/26.30 (step t193 (cl (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil)))) :rule reordering :premises (t192))
% 26.08/26.30 (step t194 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t195)
% 26.08/26.30 (assume t195.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 26.08/26.30 (step t195.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.08/26.30 (step t195.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) :rule or :premises (t195.t1))
% 26.08/26.30 (step t195.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) :rule resolution :premises (t195.t2 t195.a0))
% 26.08/26.30 (step t195 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) :rule subproof :discharge (t195.a0))
% 26.08/26.30 (step t196 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) :rule resolution :premises (t194 t195))
% 26.08/26.30 (step t197 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil)))) :rule implies_neg2)
% 26.08/26.30 (step t198 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil)))) :rule resolution :premises (t196 t197))
% 26.08/26.30 (step t199 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil)))) :rule contraction :premises (t198))
% 26.08/26.30 (step t200 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) :rule implies :premises (t199))
% 26.08/26.30 (step t201 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.nil))) :rule resolution :premises (t200 a55))
% 26.08/26.30 (step t202 (cl (tptp.segmentP tptp.sk3 tptp.nil)) :rule resolution :premises (t193 a187 t201))
% 26.08/26.30 (step t203 (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)
% 26.08/26.30 (step t204 (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 (t203))
% 26.08/26.30 (step t205 (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)
% 26.08/26.30 (step t206 (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 (t205))
% 26.08/26.30 (step t207 (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)
% 26.08/26.30 (anchor :step t208)
% 26.08/26.30 (assume t208.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 26.08/26.30 (step t208.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)))
% 26.08/26.30 (step t208.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 (t208.t1))
% 26.08/26.30 (step t208.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.frontsegP tptp.sk3 tptp.nil))) :rule resolution :premises (t208.t2 t208.a0))
% 26.08/26.30 (step t208 (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 (t208.a0))
% 26.08/26.30 (step t209 (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 (t207 t208))
% 26.08/26.30 (step t210 (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)
% 26.08/26.30 (step t211 (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 (t209 t210))
% 26.08/26.30 (step t212 (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 (t211))
% 26.08/26.30 (step t213 (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 (t212))
% 26.08/26.30 (step t214 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.frontsegP tptp.sk3 tptp.nil))) :rule resolution :premises (t213 a59))
% 26.08/26.30 (step t215 (cl (tptp.frontsegP tptp.sk3 tptp.nil)) :rule resolution :premises (t206 a187 t214))
% 26.08/26.30 (step t216 (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)
% 26.08/26.30 (anchor :step t217)
% 26.08/26.30 (assume t217.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))))))
% 26.08/26.30 (step t217.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)))
% 26.08/26.30 (step t217.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 (t217.t1))
% 26.08/26.30 (step t217.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 (t217.t2 t217.a0))
% 26.08/26.30 (step t217 (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 (t217.a0))
% 26.08/26.30 (step t218 (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 (t216 t217))
% 26.08/26.30 (step t219 (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)
% 26.08/26.30 (step t220 (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 (t218 t219))
% 26.08/26.30 (step t221 (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 (t220))
% 26.08/26.30 (step t222 (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 (t221))
% 26.08/26.30 (step t223 (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)
% 26.08/26.30 (anchor :step t224 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.08/26.30 (step t224.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t224.t2 (cl (= V V)) :rule refl)
% 26.08/26.30 (step t224.t3 (cl (= (not (tptp.frontsegP U V)) (not (tptp.frontsegP U V)))) :rule refl)
% 26.08/26.30 (step t224.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.08/26.30 (step t224.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t224.t6 (cl (= (= (tptp.app V (tptp.skaf45 U V)) U) (= U (tptp.app V (tptp.skaf45 U V))))) :rule all_simplify)
% 26.08/26.30 (step t224.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 (t224.t3 t224.t4 t224.t5 t224.t6))
% 26.08/26.30 (step t224 (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)
% 26.08/26.30 (step t225 (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 (t223 t224 a131))
% 26.08/26.30 (step t226 (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 (t222 t225))
% 26.08/26.30 (step t227 (cl (= tptp.sk3 (tptp.app tptp.nil (tptp.skaf45 tptp.sk3 tptp.nil)))) :rule resolution :premises (t204 a7 a187 t215 t226))
% 26.08/26.30 (step t228 (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)
% 26.08/26.30 (step t229 (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 (t228))
% 26.08/26.30 (step t230 (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 (t229))
% 26.08/26.30 (step t231 (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)
% 26.08/26.30 (step t232 (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)
% 26.08/26.30 (step t233 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 26.08/26.30 (step t234 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t233))
% 26.08/26.30 (step t235 (cl (= (not true) false)) :rule all_simplify)
% 26.08/26.30 (step t236 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t234 t235))
% 26.08/26.30 (step t237 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 26.08/26.30 (step t238 (cl (= (tptp.segmentP tptp.nil tptp.nil) (tptp.segmentP tptp.nil tptp.nil))) :rule refl)
% 26.08/26.30 (step t239 (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 (t236 t237 t238))
% 26.08/26.30 (step t240 (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)
% 26.08/26.30 (step t241 (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 (t239 t240))
% 26.08/26.30 (step t242 (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 (t232 t241))
% 26.08/26.30 (step t243 (cl (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule resolution :premises (t231 t242 a78))
% 26.08/26.30 (step t244 (cl (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) :rule or :premises (t243))
% 26.08/26.30 (step t245 (cl (tptp.segmentP tptp.nil tptp.nil)) :rule resolution :premises (t244 a7))
% 26.08/26.30 (step t246 (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)
% 26.08/26.30 (anchor :step t247)
% 26.08/26.30 (assume t247.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))))))
% 26.08/26.30 (step t247.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)))
% 26.08/26.30 (step t247.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 (t247.t1))
% 26.08/26.30 (step t247.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 (t247.t2 t247.a0))
% 26.08/26.30 (step t247 (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 (t247.a0))
% 26.08/26.30 (step t248 (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 (t246 t247))
% 26.08/26.30 (step t249 (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)
% 26.08/26.30 (step t250 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (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 (t248 t249))
% 26.08/26.30 (step t251 (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 (t250))
% 26.08/26.30 (step t252 (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 (t251))
% 26.08/26.30 (step t253 (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)
% 26.08/26.30 (anchor :step t254 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.08/26.30 (step t254.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t254.t2 (cl (= V V)) :rule refl)
% 26.08/26.30 (step t254.t3 (cl (= (not (tptp.segmentP U V)) (not (tptp.segmentP U V)))) :rule refl)
% 26.08/26.30 (step t254.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.08/26.30 (step t254.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t254.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)
% 26.08/26.30 (step t254.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 (t254.t3 t254.t4 t254.t5 t254.t6))
% 26.08/26.30 (step t254 (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)
% 26.08/26.30 (step t255 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule resolution :premises (t253 t254 a167))
% 26.08/26.30 (step t256 (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 (t252 t255))
% 26.08/26.30 (step t257 (cl (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t230 a7 t245 t256))
% 26.08/26.30 (step t258 (cl (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t100 t191 t202 t227 t257))
% 26.08/26.30 (step t259 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4)))) :rule equiv_pos2)
% 26.08/26.30 (step t260 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))))) :rule refl)
% 26.08/26.30 (step t261 (cl (= (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule refl)
% 26.08/26.30 (step t262 (cl (= (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule refl)
% 26.08/26.30 (step t263 (cl (= (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule refl)
% 26.08/26.30 (step t264 (cl (= (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule refl)
% 26.08/26.30 (step t265 (cl (= (= tptp.sk4 tptp.sk3) (= tptp.sk3 tptp.sk4))) :rule all_simplify)
% 26.08/26.30 (step t266 (cl (= (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3)) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4)))) :rule cong :premises (t261 t262 t263 t264 t265))
% 26.08/26.30 (step t267 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4))))) :rule cong :premises (t260 t266))
% 26.08/26.30 (step t268 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t269)
% 26.08/26.30 (assume t269.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))))
% 26.08/26.30 (step t269.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk3)))
% 26.08/26.30 (step t269.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) :rule or :premises (t269.t1))
% 26.08/26.30 (step t269.t3 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) :rule resolution :premises (t269.t2 t269.a0))
% 26.08/26.30 (step t269 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) :rule subproof :discharge (t269.a0))
% 26.08/26.30 (step t270 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) :rule resolution :premises (t268 t269))
% 26.08/26.30 (step t271 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) (not (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3)))) :rule implies_neg2)
% 26.08/26.30 (step t272 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3)))) :rule resolution :premises (t270 t271))
% 26.08/26.30 (step t273 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk4 tptp.sk3)))) :rule contraction :premises (t272))
% 26.08/26.30 (step t274 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4)))) :rule resolution :premises (t259 t267 t273))
% 26.08/26.30 (step t275 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4))) :rule implies :premises (t274))
% 26.08/26.30 (step t276 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) :rule equiv_pos2)
% 26.08/26.30 (anchor :step t277 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.08/26.30 (step t277.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t277.t2 (cl (= V V)) :rule refl)
% 26.08/26.30 (step t277.t3 (cl (= (not (tptp.segmentP U V)) (not (tptp.segmentP U V)))) :rule refl)
% 26.08/26.30 (step t277.t4 (cl (= (not (tptp.segmentP V U)) (not (tptp.segmentP V U)))) :rule refl)
% 26.08/26.30 (step t277.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t277.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.08/26.30 (step t277.t7 (cl (= (= V U) (= U V))) :rule all_simplify)
% 26.08/26.30 (step t277.t8 (cl (= (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) :rule cong :premises (t277.t3 t277.t4 t277.t5 t277.t6 t277.t7))
% 26.08/26.30 (step t277 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V))))) :rule bind)
% 26.08/26.30 (step t278 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= U V)))) :rule resolution :premises (t276 t277 a126))
% 26.08/26.30 (step t279 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 tptp.sk4))) :rule resolution :premises (t275 t278))
% 26.08/26.30 (step t280 (cl (= tptp.sk3 tptp.sk4)) :rule resolution :premises (t83 a191 a187 a188 t258 t279))
% 26.08/26.30 (step t281 (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)
% 26.08/26.30 (step t282 (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 (t281))
% 26.08/26.30 (step t283 (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)
% 26.08/26.30 (anchor :step t284)
% 26.08/26.30 (assume t284.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 26.08/26.30 (step t284.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)))
% 26.08/26.30 (step t284.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 (t284.t1))
% 26.08/26.30 (step t284.t3 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t284.t2 t284.a0))
% 26.08/26.30 (step t284 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule subproof :discharge (t284.a0))
% 26.08/26.30 (step t285 (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 (t283 t284))
% 26.08/26.30 (step t286 (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)
% 26.08/26.30 (step t287 (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 (t285 t286))
% 26.08/26.30 (step t288 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule contraction :premises (t287))
% 26.08/26.30 (step t289 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule implies :premises (t288))
% 26.08/26.30 (step t290 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t289 a50))
% 26.08/26.30 (step t291 (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)
% 26.08/26.30 (step t292 (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)
% 26.08/26.30 (anchor :step t293)
% 26.08/26.30 (assume t293.a0 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 26.08/26.30 (assume t293.a1 (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))
% 26.08/26.30 (step t293.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)
% 26.08/26.30 (anchor :step t293.t2)
% 26.08/26.30 (assume t293.t2.a0 (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4))))
% 26.08/26.30 (assume t293.t2.a1 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 26.08/26.30 (step t293.t2.t1 (cl (= (tptp.app tptp.sk4 tptp.nil) tptp.sk4)) :rule symm :premises (t293.t2.a1))
% 26.08/26.30 (step t293.t2.t2 (cl (= (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk4)) :rule symm :premises (t293.t2.a0))
% 26.08/26.30 (step t293.t2.t3 (cl (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule symm :premises (t293.t2.t2))
% 26.08/26.30 (step t293.t2.t4 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule trans :premises (t293.t2.t1 t293.t2.t3))
% 26.08/26.30 (step t293.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 (t293.t2.a0 t293.t2.a1))
% 26.08/26.30 (step t293.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)
% 26.08/26.30 (step t293.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)
% 26.08/26.30 (step t293.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 (t293.t2 t293.t3 t293.t4))
% 26.08/26.30 (step t293.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 (t293.t5))
% 26.08/26.30 (step t293.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 (t293.t6))
% 26.08/26.30 (step t293.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 (t293.t1 t293.t7))
% 26.08/26.30 (step t293.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)
% 26.08/26.30 (step t293.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 (t293.t8 t293.t9))
% 26.08/26.30 (step t293.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 (t293.t10))
% 26.08/26.30 (step t293.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 (t293.t11))
% 26.08/26.30 (step t293.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)
% 26.08/26.30 (step t293.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 (t293.t13 t293.a1 t293.a0))
% 26.08/26.30 (step t293.t15 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t293.t12 t293.t14))
% 26.08/26.30 (step t293 (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 (t293.a0 t293.a1))
% 26.08/26.30 (step t294 (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)
% 26.08/26.30 (step t295 (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)
% 26.08/26.30 (step t296 (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 (t293 t294 t295))
% 26.08/26.30 (step t297 (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 (t296))
% 26.08/26.30 (step t298 (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 (t297))
% 26.08/26.30 (step t299 (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 (t292 t298))
% 26.08/26.30 (step t300 (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)
% 26.08/26.30 (step t301 (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 (t299 t300))
% 26.08/26.30 (step t302 (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 (t301))
% 26.08/26.30 (step t303 (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 (t302))
% 26.08/26.30 (step t304 (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 (t291 t303))
% 26.08/26.30 (step t305 (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)
% 26.08/26.30 (step t306 (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 (t305))
% 26.08/26.30 (step t307 (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)
% 26.08/26.30 (anchor :step t308)
% 26.08/26.30 (assume t308.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 26.08/26.30 (step t308.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)))
% 26.08/26.30 (step t308.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 (t308.t1))
% 26.08/26.30 (step t308.t3 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t308.t2 t308.a0))
% 26.08/26.30 (step t308 (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 (t308.a0))
% 26.08/26.30 (step t309 (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 (t307 t308))
% 26.08/26.30 (step t310 (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)
% 26.08/26.30 (step t311 (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 (t309 t310))
% 26.08/26.30 (step t312 (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 (t311))
% 26.08/26.30 (step t313 (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 (t312))
% 26.08/26.30 (step t314 (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)
% 26.08/26.30 (anchor :step t315 :args ((U $$unsorted) (:= U U)))
% 26.08/26.30 (step t315.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t315.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t315.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 26.08/26.30 (step t315.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 (t315.t2 t315.t3))
% 26.08/26.30 (step t315 (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)
% 26.08/26.30 (step t316 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t314 t315 a72))
% 26.08/26.30 (step t317 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t313 t316))
% 26.08/26.30 (step t318 (cl (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule resolution :premises (t306 a188 t317))
% 26.08/26.30 (step t319 (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)
% 26.08/26.30 (step t320 (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 (t319))
% 26.08/26.30 (step t321 (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 (t320))
% 26.08/26.30 (step t322 (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)
% 26.08/26.30 (step t323 (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 (t322))
% 26.08/26.30 (step t324 (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)
% 26.08/26.30 (anchor :step t325)
% 26.08/26.30 (assume t325.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 26.08/26.30 (step t325.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)))
% 26.08/26.30 (step t325.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 (t325.t1))
% 26.08/26.30 (step t325.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule resolution :premises (t325.t2 t325.a0))
% 26.08/26.30 (step t325 (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 (t325.a0))
% 26.08/26.30 (step t326 (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 (t324 t325))
% 26.08/26.30 (step t327 (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)
% 26.08/26.30 (step t328 (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 (t326 t327))
% 26.08/26.30 (step t329 (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 (t328))
% 26.08/26.30 (step t330 (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 (t329))
% 26.08/26.30 (step t331 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.frontsegP tptp.sk4 tptp.sk4))) :rule resolution :premises (t330 a60))
% 26.08/26.30 (step t332 (cl (tptp.frontsegP tptp.sk4 tptp.sk4)) :rule resolution :premises (t323 a188 t331))
% 26.08/26.30 (step t333 (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)
% 26.08/26.30 (anchor :step t334)
% 26.08/26.30 (assume t334.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))))))
% 26.08/26.30 (step t334.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)))
% 26.08/26.30 (step t334.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 (t334.t1))
% 26.08/26.30 (step t334.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 (t334.t2 t334.a0))
% 26.08/26.30 (step t334 (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 (t334.a0))
% 26.08/26.30 (step t335 (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 (t333 t334))
% 26.08/26.30 (step t336 (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)
% 26.08/26.30 (step t337 (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 (t335 t336))
% 26.08/26.30 (step t338 (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 (t337))
% 26.08/26.30 (step t339 (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 (t338))
% 26.08/26.30 (step t340 (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 (t339 t225))
% 26.08/26.30 (step t341 (cl (= tptp.sk4 (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t321 a188 t332 t340))
% 26.08/26.30 (step t342 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule resolution :premises (t304 t318 t341))
% 26.08/26.30 (step t343 (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)
% 26.08/26.30 (step t344 (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)
% 26.08/26.30 (step t345 (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)
% 26.08/26.30 (step t346 (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 (t345))
% 26.08/26.30 (step t347 (cl (= (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))))) :rule refl)
% 26.08/26.30 (step t348 (cl (= (= (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.nil) (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4)))) :rule all_simplify)
% 26.08/26.30 (step t349 (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 (t346 t347 t263 t237 t348))
% 26.08/26.30 (step t350 (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 (t344 t349))
% 26.08/26.30 (step t351 (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)
% 26.08/26.30 (anchor :step t352)
% 26.08/26.30 (assume t352.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))))
% 26.08/26.30 (step t352.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)))
% 26.08/26.30 (step t352.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 (t352.t1))
% 26.08/26.30 (step t352.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 (t352.t2 t352.a0))
% 26.08/26.30 (step t352 (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 (t352.a0))
% 26.08/26.30 (step t353 (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 (t351 t352))
% 26.08/26.30 (step t354 (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)
% 26.08/26.30 (step t355 (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 (t353 t354))
% 26.08/26.30 (step t356 (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 (t355))
% 26.08/26.30 (step t357 (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 (t343 t350 t356))
% 26.08/26.30 (step t358 (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 (t357))
% 26.08/26.30 (step t359 (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 (t358 a149))
% 26.08/26.30 (step t360 (cl (= tptp.nil (tptp.skaf45 tptp.sk4 tptp.sk4))) :rule resolution :premises (t282 a7 a188 t290 t342 t359))
% 26.08/26.30 (step t361 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) :rule or_pos)
% 26.08/26.30 (step t362 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule reordering :premises (t361))
% 26.08/26.30 (step t363 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) :rule implies_neg1)
% 26.08/26.30 (anchor :step t364)
% 26.08/26.30 (assume t364.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 26.08/26.30 (step t364.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule forall_inst :args ((:= U tptp.sk3) (:= V (tptp.skaf45 tptp.sk4 tptp.sk4)) (:= W tptp.sk4)))
% 26.08/26.30 (step t364.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule or :premises (t364.t1))
% 26.08/26.30 (step t364.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule resolution :premises (t364.t2 t364.a0))
% 26.08/26.30 (step t364 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule subproof :discharge (t364.a0))
% 26.08/26.30 (step t365 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule resolution :premises (t363 t364))
% 26.08/26.30 (step t366 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule implies_neg2)
% 26.08/26.30 (step t367 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule resolution :premises (t365 t366))
% 26.08/26.30 (step t368 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))))) :rule contraction :premises (t367))
% 26.08/26.30 (step t369 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule implies :premises (t368))
% 26.08/26.30 (step t370 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3))))) :rule resolution :premises (t369 a148))
% 26.08/26.30 (step t371 (cl (= (tptp.app (tptp.app tptp.sk4 (tptp.skaf45 tptp.sk4 tptp.sk4)) tptp.sk3) (tptp.app tptp.sk4 (tptp.app (tptp.skaf45 tptp.sk4 tptp.sk4) tptp.sk3)))) :rule resolution :premises (t362 a187 a188 t290 t370))
% 26.08/26.30 (step t372 (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)
% 26.08/26.30 (step t373 (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 (t372))
% 26.08/26.30 (step t374 (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)
% 26.08/26.30 (anchor :step t375)
% 26.08/26.30 (assume t375.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 26.08/26.30 (step t375.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)))
% 26.08/26.30 (step t375.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 (t375.t1))
% 26.08/26.30 (step t375.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t375.t2 t375.a0))
% 26.08/26.30 (step t375 (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 (t375.a0))
% 26.08/26.30 (step t376 (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 (t374 t375))
% 26.08/26.30 (step t377 (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)
% 26.08/26.30 (step t378 (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 (t376 t377))
% 26.08/26.30 (step t379 (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 (t378))
% 26.08/26.30 (step t380 (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 (t379))
% 26.08/26.30 (step t381 (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)
% 26.08/26.30 (anchor :step t382 :args ((U $$unsorted) (:= U U)))
% 26.08/26.30 (step t382.t1 (cl (= U U)) :rule refl)
% 26.08/26.30 (step t382.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.08/26.30 (step t382.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 26.08/26.30 (step t382.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 (t382.t2 t382.t3))
% 26.08/26.30 (step t382 (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)
% 26.08/26.30 (step t383 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t381 t382 a73))
% 26.08/26.30 (step t384 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t380 t383))
% 26.08/26.30 (step t385 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t373 a187 t384))
% 26.08/26.30 (step t386 (cl) :rule resolution :premises (t81 t280 t191 t360 t371 t341 t385 t146 a2))
% 26.08/26.30
% 26.08/26.30 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.jyysZhR0FY/cvc5---1.0.5_22103.smt2
% 26.08/26.31 % cvc5---1.0.5 exiting
% 26.14/26.31 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------