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