TSTP Solution File: SWC061-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC061-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n022.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:09 EDT 2024
% Result : Unsatisfiable 25.65s 26.08s
% Output : Proof 25.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SWC061-1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.13 % Command : do_cvc5 %s %d
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 26 16:19:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.18/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.54/10.77 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.56/15.80 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.60/20.83 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.60/25.89 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 25.65/26.08 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.C73z4n3aDS/cvc5---1.0.5_21490.smt2
% 25.65/26.08 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.C73z4n3aDS/cvc5---1.0.5_21490.smt2
% 25.65/26.13 (assume a0 (tptp.equalelemsP tptp.nil))
% 25.65/26.13 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 25.65/26.13 (assume a2 (tptp.strictorderedP tptp.nil))
% 25.65/26.13 (assume a3 (tptp.totalorderedP tptp.nil))
% 25.65/26.13 (assume a4 (tptp.strictorderP tptp.nil))
% 25.65/26.13 (assume a5 (tptp.totalorderP tptp.nil))
% 25.65/26.13 (assume a6 (tptp.cyclefreeP tptp.nil))
% 25.65/26.13 (assume a7 (tptp.ssList tptp.nil))
% 25.65/26.13 (assume a8 (tptp.ssItem tptp.skac3))
% 25.65/26.13 (assume a9 (tptp.ssItem tptp.skac2))
% 25.65/26.13 (assume a10 (not (tptp.singletonP tptp.nil)))
% 25.65/26.13 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 25.65/26.13 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 25.65/26.13 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 25.65/26.13 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 25.65/26.13 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 25.65/26.13 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 25.65/26.13 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 25.65/26.13 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 25.65/26.13 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 25.65/26.13 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 25.65/26.13 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 25.65/26.13 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 25.65/26.13 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 25.65/26.13 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 25.65/26.13 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 25.65/26.13 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 25.65/26.13 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 25.65/26.13 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 25.65/26.13 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 25.65/26.13 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 25.65/26.13 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 25.65/26.13 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 25.65/26.13 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 25.65/26.13 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 25.65/26.13 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 25.65/26.13 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 25.65/26.13 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 25.65/26.13 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 25.65/26.13 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 25.65/26.13 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 25.65/26.13 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 25.65/26.13 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 25.65/26.13 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 25.65/26.13 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 25.65/26.13 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 25.65/26.13 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 25.65/26.13 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 25.65/26.13 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 25.65/26.13 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 25.65/26.13 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 25.65/26.13 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 25.65/26.13 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 25.65/26.13 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 25.65/26.13 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 25.65/26.13 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 25.65/26.13 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.65/26.13 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 25.65/26.13 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 25.65/26.13 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 25.65/26.13 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 25.65/26.13 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 25.65/26.13 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 25.65/26.13 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 25.65/26.13 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 25.65/26.13 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 25.65/26.13 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 25.65/26.13 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 25.65/26.13 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 25.65/26.13 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 25.65/26.13 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 25.65/26.13 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 25.65/26.13 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 25.65/26.13 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/26.13 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 25.65/26.13 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/26.13 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 25.65/26.13 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/26.13 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 25.65/26.13 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 25.65/26.13 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 25.65/26.13 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 25.65/26.13 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 25.65/26.13 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 25.65/26.13 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 25.65/26.13 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 25.65/26.13 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 25.65/26.13 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 25.65/26.13 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 25.65/26.13 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 25.65/26.13 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 25.65/26.13 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.65/26.13 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.65/26.13 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 25.65/26.13 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 25.65/26.13 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 25.65/26.13 (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))))
% 25.65/26.13 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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))))
% 25.65/26.13 (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)))))
% 25.65/26.13 (assume a185 (tptp.ssList tptp.sk1))
% 25.65/26.13 (assume a186 (tptp.ssList tptp.sk2))
% 25.65/26.13 (assume a187 (tptp.ssList tptp.sk3))
% 25.65/26.13 (assume a188 (tptp.ssList tptp.sk4))
% 25.65/26.13 (assume a189 (= tptp.sk2 tptp.sk4))
% 25.65/26.13 (assume a190 (= tptp.sk1 tptp.sk3))
% 25.65/26.13 (assume a191 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 25.65/26.13 (assume a192 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/26.13 (assume a193 (or (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/26.13 (assume a194 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/26.13 (assume a195 (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/26.13 (assume a196 (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))
% 25.65/26.13 (assume a197 (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 25.65/26.13 (assume a198 (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)))
% 25.65/26.13 (assume a199 (forall ((A $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 25.65/26.13 (step t1 (cl (not (= (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule equiv_pos2)
% 25.65/26.13 (step t2 (cl (= (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule refl)
% 25.65/26.13 (step t3 (cl (= (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule refl)
% 25.65/26.13 (step t4 (cl (= (not (= tptp.nil tptp.sk6)) (not (= tptp.nil tptp.sk6)))) :rule refl)
% 25.65/26.13 (step t5 (cl (= (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule refl)
% 25.65/26.13 (step t6 (cl (= (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule refl)
% 25.65/26.13 (step t7 (cl (= (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule refl)
% 25.65/26.13 (step t8 (cl (= (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true) (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv_simplify)
% 25.65/26.13 (step t9 (cl (not (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule equiv1 :premises (t8))
% 25.65/26.13 (step t10 (cl (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule all_simplify)
% 25.65/26.13 (step t11 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule refl)
% 25.65/26.13 (step t12 (cl (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule all_simplify)
% 25.65/26.13 (step t13 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule cong :premises (t11 t12))
% 25.65/26.13 (step t14 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) :rule all_simplify)
% 25.65/26.13 (step t15 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) true)) :rule trans :premises (t13 t14))
% 25.65/26.13 (step t16 (cl (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) :rule trans :premises (t10 t15))
% 25.65/26.13 (step t17 (cl (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t9 t16))
% 25.65/26.13 (step t18 (cl (= (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule cong :premises (t2 t3 t4 t5 t6 t7 t17))
% 25.65/26.13 (step t19 (cl (not (= (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) (not (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule equiv_pos2)
% 25.65/26.13 (step t20 (cl (= (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule refl)
% 25.65/26.13 (step t21 (cl (= (= (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))))) :rule equiv_simplify)
% 25.65/26.13 (step t22 (cl (= (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (not (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))))) :rule equiv2 :premises (t21))
% 25.65/26.13 (step t23 (cl (not (not (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule not_not)
% 25.65/26.13 (step t24 (cl (= (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t22 t23))
% 25.65/26.13 (step t25 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t26)
% 25.65/26.13 (assume t26.a0 (not (tptp.segmentP tptp.sk3 tptp.sk4)))
% 25.65/26.13 (assume t26.a1 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (assume t26.a2 (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))
% 25.65/26.13 (assume t26.a3 (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))
% 25.65/26.13 (assume t26.a4 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.13 (assume t26.a5 (= tptp.nil tptp.sk6))
% 25.65/26.13 (assume t26.a6 (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))
% 25.65/26.13 (step t26.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 25.65/26.13 (step t26.t2 (cl (= (= true false) false)) :rule all_simplify)
% 25.65/26.13 (step t26.t3 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 25.65/26.13 (step t26.t4 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv2 :premises (t26.t3))
% 25.65/26.13 (step t26.t5 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) true)) :rule resolution :premises (t26.t4 t26.a6))
% 25.65/26.13 (step t26.t6 (cl (= true (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t26.t5))
% 25.65/26.13 (step t26.t7 (cl (= (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule symm :premises (t26.a3))
% 25.65/26.13 (step t26.t8 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule symm :premises (t26.t7))
% 25.65/26.13 (step t26.t9 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 25.65/26.13 (step t26.t10 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t26.a2))
% 25.65/26.13 (step t26.t11 (cl (= (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t26.t9 t26.t10))
% 25.65/26.13 (step t26.t12 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3)) :rule symm :premises (t26.a1))
% 25.65/26.13 (step t26.t13 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) tptp.sk3)) :rule trans :premises (t26.t8 t26.t11 t26.t12))
% 25.65/26.13 (step t26.t14 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule symm :premises (t26.t10))
% 25.65/26.13 (step t26.t15 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 25.65/26.13 (step t26.t16 (cl (= tptp.sk6 tptp.nil)) :rule symm :premises (t26.a5))
% 25.65/26.13 (step t26.t17 (cl (= tptp.nil tptp.sk6)) :rule symm :premises (t26.t16))
% 25.65/26.13 (step t26.t18 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule cong :premises (t26.t15 t26.t17))
% 25.65/26.13 (step t26.t19 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t26.a4))
% 25.65/26.13 (step t26.t20 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk4)) :rule trans :premises (t26.t14 t26.t18 t26.t19))
% 25.65/26.13 (step t26.t21 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule cong :premises (t26.t13 t26.t20))
% 25.65/26.13 (step t26.t22 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv_simplify)
% 25.65/26.13 (step t26.t23 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv2 :premises (t26.t22))
% 25.65/26.13 (step t26.t24 (cl (not (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule not_not)
% 25.65/26.13 (step t26.t25 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t26.t23 t26.t24))
% 25.65/26.13 (step t26.t26 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false)) :rule resolution :premises (t26.t25 t26.a0))
% 25.65/26.13 (step t26.t27 (cl (= true false)) :rule trans :premises (t26.t6 t26.t21 t26.t26))
% 25.65/26.13 (step t26.t28 (cl false) :rule resolution :premises (t26.t1 t26.t2 t26.t27))
% 25.65/26.13 (step t26 (cl (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) :rule subproof :discharge (t26.a0 t26.a1 t26.a2 t26.a3 t26.a4 t26.a5 t26.a6))
% 25.65/26.13 (step t27 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule and_pos)
% 25.65/26.13 (step t28 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t29 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t30 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t31 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.13 (step t32 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk6)) :rule and_pos)
% 25.65/26.13 (step t33 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t34 (cl false (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t26 t27 t28 t29 t30 t31 t32 t33))
% 25.65/26.13 (step t35 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) false) :rule reordering :premises (t34))
% 25.65/26.13 (step t36 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) false) :rule contraction :premises (t35))
% 25.65/26.13 (step t37 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) false) :rule resolution :premises (t25 t36))
% 25.65/26.13 (step t38 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (not false)) :rule implies_neg2)
% 25.65/26.13 (step t39 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false)) :rule resolution :premises (t37 t38))
% 25.65/26.13 (step t40 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false)) :rule contraction :premises (t39))
% 25.65/26.13 (step t41 (cl (= (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_simplify)
% 25.65/26.13 (step t42 (cl (not (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false)) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule equiv1 :premises (t41))
% 25.65/26.13 (step t43 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t40 t42))
% 25.65/26.13 (step t44 (cl (= (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) false)) :rule resolution :premises (t24 t43))
% 25.65/26.13 (step t45 (cl (= (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false))) :rule cong :premises (t20 t44))
% 25.65/26.13 (step t46 (cl (= (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule all_simplify)
% 25.65/26.13 (step t47 (cl (= (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule trans :premises (t45 t46))
% 25.65/26.13 (step t48 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t49)
% 25.65/26.13 (assume t49.a0 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.13 (assume t49.a1 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (assume t49.a2 (= tptp.nil tptp.sk6))
% 25.65/26.13 (assume t49.a3 (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))
% 25.65/26.13 (assume t49.a4 (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))
% 25.65/26.13 (assume t49.a5 (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))
% 25.65/26.13 (assume t49.a6 (not (tptp.segmentP tptp.sk3 tptp.sk4)))
% 25.65/26.13 (step t49.t1 (cl (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 25.65/26.13 (step t49.t2 (cl (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t49.t1 t49.a6 t49.a1 t49.a3 t49.a4 t49.a0 t49.a2 t49.a5))
% 25.65/26.13 (step t49 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t49.a0 t49.a1 t49.a2 t49.a3 t49.a4 t49.a5 t49.a6))
% 25.65/26.13 (step t50 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.13 (step t51 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t52 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.nil tptp.sk6)) :rule and_pos)
% 25.65/26.13 (step t53 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t54 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t55 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t56 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule and_pos)
% 25.65/26.13 (step t57 (cl (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t49 t50 t51 t52 t53 t54 t55 t56))
% 25.65/26.13 (step t58 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t57))
% 25.65/26.13 (step t59 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t58))
% 25.65/26.13 (step t60 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t48 t59))
% 25.65/26.13 (step t61 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t62 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t60 t61))
% 25.65/26.13 (step t63 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t62))
% 25.65/26.13 (step t64 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk6) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t19 t47 t63))
% 25.65/26.13 (step t65 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule not_and :premises (t64))
% 25.65/26.13 (step t66 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule or_neg)
% 25.65/26.13 (step t67 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule or_neg)
% 25.65/26.13 (step t68 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (= tptp.nil tptp.sk6)))) :rule or_neg)
% 25.65/26.13 (step t69 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule or_neg)
% 25.65/26.13 (step t70 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule or_neg)
% 25.65/26.13 (step t71 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule or_neg)
% 25.65/26.13 (step t72 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (not (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule or_neg)
% 25.65/26.13 (step t73 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t65 t66 t67 t68 t69 t70 t71 t72))
% 25.65/26.13 (step t74 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule contraction :premises (t73))
% 25.65/26.13 (step t75 (cl (or (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t1 t18 t74))
% 25.65/26.13 (step t76 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule or :premises (t75))
% 25.65/26.13 (step t77 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.nil tptp.sk6)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t76))
% 25.65/26.13 (step t78 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)) :rule or_pos)
% 25.65/26.13 (step t79 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.neq tptp.sk6 tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule reordering :premises (t78))
% 25.65/26.13 (step t80 (cl (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a193))
% 25.65/26.13 (step t81 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t80))
% 25.65/26.13 (step t82 (cl (not (= (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil)))) (not (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_pos2)
% 25.65/26.13 (step t83 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.13 (step t84 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 25.65/26.13 (step t85 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t84 a190 a189))
% 25.65/26.13 (step t86 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t85))
% 25.65/26.13 (step t87 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk4))) :rule cong :premises (t83 t86))
% 25.65/26.13 (step t88 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t86 t83))
% 25.65/26.13 (step t89 (cl (= (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil)))) :rule cong :premises (t87 t88))
% 25.65/26.13 (step t90 (cl (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t82 t89 a196))
% 25.65/26.13 (step t91 (cl (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil)) :rule or :premises (t90))
% 25.65/26.13 (step t92 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a191))
% 25.65/26.13 (step t93 (cl (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule and_neg)
% 25.65/26.13 (step t94 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t95)
% 25.65/26.13 (assume t95.a0 (= tptp.nil tptp.sk3))
% 25.65/26.13 (assume t95.a1 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (step t95.t1 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t95.t2)
% 25.65/26.13 (assume t95.t2.a0 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (assume t95.t2.a1 (= tptp.nil tptp.sk3))
% 25.65/26.13 (step t95.t2.t1 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t95.t2.a1))
% 25.65/26.13 (step t95.t2.t2 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t95.t2.t1))
% 25.65/26.13 (step t95.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3)) :rule symm :premises (t95.t2.a0))
% 25.65/26.13 (step t95.t2.t4 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t95.t2.t3))
% 25.65/26.13 (step t95.t2.t5 (cl (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule trans :premises (t95.t2.t2 t95.t2.t4))
% 25.65/26.13 (step t95.t2 (cl (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t95.t2.a0 t95.t2.a1))
% 25.65/26.13 (step t95.t3 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t95.t4 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 25.65/26.13 (step t95.t5 (cl (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t95.t2 t95.t3 t95.t4))
% 25.65/26.13 (step t95.t6 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t95.t5))
% 25.65/26.13 (step t95.t7 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t95.t6))
% 25.65/26.13 (step t95.t8 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t95.t1 t95.t7))
% 25.65/26.13 (step t95.t9 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t95.t10 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t95.t8 t95.t9))
% 25.65/26.13 (step t95.t11 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t95.t10))
% 25.65/26.13 (step t95.t12 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t95.t11))
% 25.65/26.13 (step t95.t13 (cl (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 25.65/26.13 (step t95.t14 (cl (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t95.t13 t95.a1 t95.a0))
% 25.65/26.13 (step t95.t15 (cl (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t95.t12 t95.t14))
% 25.65/26.13 (step t95 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t95.a0 t95.a1))
% 25.65/26.13 (step t96 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 25.65/26.13 (step t97 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t98 (cl (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t95 t96 t97))
% 25.65/26.13 (step t99 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t98))
% 25.65/26.13 (step t100 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t99))
% 25.65/26.13 (step t101 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t94 t100))
% 25.65/26.13 (step t102 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t103 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t101 t102))
% 25.65/26.13 (step t104 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t103))
% 25.65/26.13 (step t105 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t104))
% 25.65/26.13 (step t106 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t93 t105))
% 25.65/26.13 (step t107 (cl (not (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 25.65/26.13 (step t108 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t107))
% 25.65/26.13 (step t109 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t110)
% 25.65/26.13 (assume t110.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 25.65/26.13 (step t110.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (step t110.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t110.t1))
% 25.65/26.13 (step t110.t3 (cl (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t110.t2 t110.a0))
% 25.65/26.13 (step t110 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t110.a0))
% 25.65/26.13 (step t111 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t109 t110))
% 25.65/26.13 (step t112 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t113 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t111 t112))
% 25.65/26.13 (step t114 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t113))
% 25.65/26.13 (step t115 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t114))
% 25.65/26.13 (step t116 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule equiv_pos2)
% 25.65/26.13 (anchor :step t117 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.65/26.13 (step t117.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t117.t2 (cl (= V V)) :rule refl)
% 25.65/26.13 (step t117.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 25.65/26.13 (step t117.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t117.t3))
% 25.65/26.13 (step t117.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.13 (step t117.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.13 (step t117.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 25.65/26.13 (step t117.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule cong :premises (t117.t4 t117.t5 t117.t6 t117.t7))
% 25.65/26.13 (step t117 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) :rule bind)
% 25.65/26.13 (step t118 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule resolution :premises (t116 t117 a118))
% 25.65/26.13 (step t119 (cl (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t115 t118))
% 25.65/26.13 (step t120 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 25.65/26.13 (step t121 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t120))
% 25.65/26.13 (step t122 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t123)
% 25.65/26.13 (assume t123.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.65/26.13 (step t123.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 25.65/26.13 (step t123.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t123.t1))
% 25.65/26.13 (step t123.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t123.t2 t123.a0))
% 25.65/26.13 (step t123 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t123.a0))
% 25.65/26.13 (step t124 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t122 t123))
% 25.65/26.13 (step t125 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t126 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t124 t125))
% 25.65/26.13 (step t127 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t126))
% 25.65/26.13 (step t128 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t127))
% 25.65/26.13 (step t129 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 25.65/26.13 (anchor :step t130 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.65/26.13 (step t130.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t130.t2 (cl (= V V)) :rule refl)
% 25.65/26.13 (step t130.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 25.65/26.13 (step t130.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t130.t3))
% 25.65/26.13 (step t130.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 25.65/26.13 (step t130.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.13 (step t130.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t130.t4 t130.t5 t130.t6))
% 25.65/26.13 (step t130 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 25.65/26.13 (step t131 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t129 t130 a97))
% 25.65/26.13 (step t132 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t128 t131))
% 25.65/26.13 (step t133 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 25.65/26.13 (step t134 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t133))
% 25.65/26.13 (step t135 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t136)
% 25.65/26.13 (assume t136.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 25.65/26.13 (step t136.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 25.65/26.13 (step t136.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t136.t1))
% 25.65/26.13 (step t136.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t136.t2 t136.a0))
% 25.65/26.13 (step t136 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t136.a0))
% 25.65/26.13 (step t137 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t135 t136))
% 25.65/26.13 (step t138 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t139 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t137 t138))
% 25.65/26.13 (step t140 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t139))
% 25.65/26.13 (step t141 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t140))
% 25.65/26.13 (step t142 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t141 a85))
% 25.65/26.13 (step t143 (cl (not (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 25.65/26.13 (step t144 (cl (= (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule all_simplify)
% 25.65/26.13 (step t145 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 25.65/26.13 (step t146 (cl (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t144 t145))
% 25.65/26.13 (step t147 (cl (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t143 t146 a195))
% 25.65/26.13 (step t148 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t147))
% 25.65/26.13 (step t149 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t148))
% 25.65/26.13 (step t150 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t106 t108 t119 t121 t132 a7 t134 t142 a7 t149 t81))
% 25.65/26.13 (step t151 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t150))
% 25.65/26.13 (step t152 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 25.65/26.13 (step t153 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t151 t152))
% 25.65/26.13 (step t154 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t153))
% 25.65/26.13 (step t155 (cl (not (= (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil)))) (not (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_pos2)
% 25.65/26.13 (step t156 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.13 (step t157 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t85))
% 25.65/26.13 (step t158 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t156 t157))
% 25.65/26.13 (step t159 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk3)))) :rule cong :premises (t158))
% 25.65/26.13 (step t160 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t85))
% 25.65/26.13 (step t161 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t160 t156))
% 25.65/26.13 (step t162 (cl (= (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil)))) :rule cong :premises (t159 t161))
% 25.65/26.13 (step t163 (cl (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t155 t162 a198))
% 25.65/26.13 (step t164 (cl (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil)) :rule or :premises (t163))
% 25.65/26.13 (step t165 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t164))
% 25.65/26.13 (step t166 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t154 t165))
% 25.65/26.13 (step t167 (cl (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t166))
% 25.65/26.13 (step t168 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t92 t167))
% 25.65/26.13 (step t169 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t91 t168))
% 25.65/26.13 (step t170 (cl (tptp.ssList tptp.sk6)) :rule resolution :premises (t81 t169))
% 25.65/26.13 (step t171 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))) :rule or_pos)
% 25.65/26.13 (step t172 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule reordering :premises (t171))
% 25.65/26.13 (step t173 (cl (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule and_neg)
% 25.65/26.13 (step t174 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t175)
% 25.65/26.13 (assume t175.a0 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.13 (assume t175.a1 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 25.65/26.13 (assume t175.a2 (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))
% 25.65/26.13 (step t175.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6)) (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t175.t2)
% 25.65/26.13 (assume t175.t2.a0 (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))
% 25.65/26.13 (assume t175.t2.a1 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.13 (assume t175.t2.a2 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 25.65/26.13 (step t175.t2.t1 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk6) true) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule equiv_simplify)
% 25.65/26.13 (step t175.t2.t2 (cl (not (= (tptp.segmentP tptp.sk4 tptp.sk6) true)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule equiv1 :premises (t175.t2.t1))
% 25.65/26.13 (step t175.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t175.t2.a1))
% 25.65/26.13 (step t175.t2.t4 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t175.t2.t3))
% 25.65/26.13 (step t175.t2.t5 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.13 (step t175.t2.t6 (cl (= (tptp.app tptp.sk4 tptp.nil) (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule cong :premises (t175.t2.t4 t175.t2.t5))
% 25.65/26.13 (step t175.t2.t7 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule trans :premises (t175.t2.a2 t175.t2.t6))
% 25.65/26.13 (step t175.t2.t8 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 25.65/26.13 (step t175.t2.t9 (cl (= (tptp.segmentP tptp.sk4 tptp.sk6) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule cong :premises (t175.t2.t7 t175.t2.t8))
% 25.65/26.13 (step t175.t2.t10 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) true) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule equiv_simplify)
% 25.65/26.13 (step t175.t2.t11 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) true) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule equiv2 :premises (t175.t2.t10))
% 25.65/26.13 (step t175.t2.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) true)) :rule resolution :premises (t175.t2.t11 t175.t2.a0))
% 25.65/26.13 (step t175.t2.t13 (cl (= (tptp.segmentP tptp.sk4 tptp.sk6) true)) :rule trans :premises (t175.t2.t9 t175.t2.t12))
% 25.65/26.13 (step t175.t2.t14 (cl (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t175.t2.t2 t175.t2.t13))
% 25.65/26.13 (step t175.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule subproof :discharge (t175.t2.a0 t175.t2.a1 t175.t2.a2))
% 25.65/26.13 (step t175.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule and_pos)
% 25.65/26.13 (step t175.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.13 (step t175.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t175.t6 (cl (tptp.segmentP tptp.sk4 tptp.sk6) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t175.t2 t175.t3 t175.t4 t175.t5))
% 25.65/26.13 (step t175.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule reordering :premises (t175.t6))
% 25.65/26.13 (step t175.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule contraction :premises (t175.t7))
% 25.65/26.13 (step t175.t9 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t175.t1 t175.t8))
% 25.65/26.13 (step t175.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk4 tptp.sk6))) :rule implies_neg2)
% 25.65/26.13 (step t175.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6)) (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule resolution :premises (t175.t9 t175.t10))
% 25.65/26.13 (step t175.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule contraction :premises (t175.t11))
% 25.65/26.13 (step t175.t13 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule implies :premises (t175.t12))
% 25.65/26.13 (step t175.t14 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule and_neg)
% 25.65/26.13 (step t175.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t175.t14 t175.a2 t175.a0 t175.a1))
% 25.65/26.13 (step t175.t16 (cl (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t175.t13 t175.t15))
% 25.65/26.13 (step t175 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule subproof :discharge (t175.a0 t175.a1 t175.a2))
% 25.65/26.13 (step t176 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.13 (step t177 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t178 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule and_pos)
% 25.65/26.13 (step t179 (cl (tptp.segmentP tptp.sk4 tptp.sk6) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule resolution :premises (t175 t176 t177 t178))
% 25.65/26.13 (step t180 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule reordering :premises (t179))
% 25.65/26.13 (step t181 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule contraction :premises (t180))
% 25.65/26.13 (step t182 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t174 t181))
% 25.65/26.13 (step t183 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk4 tptp.sk6))) :rule implies_neg2)
% 25.65/26.13 (step t184 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule resolution :premises (t182 t183))
% 25.65/26.13 (step t185 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule contraction :premises (t184))
% 25.65/26.13 (step t186 (cl (not (and (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule implies :premises (t185))
% 25.65/26.13 (step t187 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t173 t186))
% 25.65/26.13 (step t188 (cl (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule reordering :premises (t187))
% 25.65/26.13 (step t189 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 25.65/26.13 (step t190 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 25.65/26.13 (step t191 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t190 t145))
% 25.65/26.13 (step t192 (cl (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t189 t191 a194))
% 25.65/26.13 (step t193 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t192))
% 25.65/26.13 (step t194 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t193))
% 25.65/26.13 (step t195 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t194 t169))
% 25.65/26.13 (step t196 (cl (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule or_pos)
% 25.65/26.13 (step t197 (cl (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule reordering :premises (t196))
% 25.65/26.13 (step t198 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t199)
% 25.65/26.13 (assume t199.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 25.65/26.13 (step t199.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk4)))
% 25.65/26.13 (step t199.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule or :premises (t199.t1))
% 25.65/26.13 (step t199.t3 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t199.t2 t199.a0))
% 25.65/26.13 (step t199 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule subproof :discharge (t199.a0))
% 25.65/26.13 (step t200 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t198 t199))
% 25.65/26.13 (step t201 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t202 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t200 t201))
% 25.65/26.13 (step t203 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule contraction :premises (t202))
% 25.65/26.13 (step t204 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies :premises (t203))
% 25.65/26.13 (step t205 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule equiv_pos2)
% 25.65/26.13 (anchor :step t206 :args ((U $$unsorted) (:= U U)))
% 25.65/26.13 (step t206.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t206.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.13 (step t206.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 25.65/26.13 (step t206.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule cong :premises (t206.t2 t206.t3))
% 25.65/26.13 (step t206 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) :rule bind)
% 25.65/26.13 (step t207 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t205 t206 a72))
% 25.65/26.13 (step t208 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t204 t207))
% 25.65/26.13 (step t209 (cl (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule resolution :premises (t197 a188 t208))
% 25.65/26.13 (step t210 (cl (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule or_pos)
% 25.65/26.13 (step t211 (cl (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule contraction :premises (t210))
% 25.65/26.13 (step t212 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule reordering :premises (t211))
% 25.65/26.13 (step t213 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 25.65/26.13 (step t214 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t213 t169))
% 25.65/26.13 (step t215 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t134 a7 t214 t142))
% 25.65/26.13 (step t216 (cl (not (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)) :rule or_pos)
% 25.65/26.13 (step t217 (cl (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6) (not (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule reordering :premises (t216))
% 25.65/26.13 (step t218 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t219)
% 25.65/26.13 (assume t219.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.65/26.13 (step t219.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk6)))
% 25.65/26.13 (step t219.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule or :premises (t219.t1))
% 25.65/26.13 (step t219.t3 (cl (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule resolution :premises (t219.t2 t219.a0))
% 25.65/26.13 (step t219 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule subproof :discharge (t219.a0))
% 25.65/26.13 (step t220 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule resolution :premises (t218 t219))
% 25.65/26.13 (step t221 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 25.65/26.13 (step t222 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule resolution :premises (t220 t221))
% 25.65/26.13 (step t223 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule contraction :premises (t222))
% 25.65/26.13 (step t224 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule implies :premises (t223))
% 25.65/26.13 (step t225 (cl (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule resolution :premises (t224 a56))
% 25.65/26.13 (step t226 (cl (tptp.segmentP tptp.sk6 tptp.sk6)) :rule resolution :premises (t217 t170 t225))
% 25.65/26.13 (step t227 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (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)
% 25.65/26.13 (anchor :step t228)
% 25.65/26.13 (assume t228.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))))
% 25.65/26.13 (step t228.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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk6) (:= W tptp.nil) (:= X (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (step t228.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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule or :premises (t228.t1))
% 25.65/26.13 (step t228.t3 (cl (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t228.t2 t228.a0))
% 25.65/26.13 (step t228 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule subproof :discharge (t228.a0))
% 25.65/26.13 (step t229 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t227 t228))
% 25.65/26.13 (step t230 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 25.65/26.13 (step t231 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (=> (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule resolution :premises (t229 t230))
% 25.65/26.13 (step t232 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule contraction :premises (t231))
% 25.65/26.13 (step t233 (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.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule implies :premises (t232))
% 25.65/26.13 (step t234 (cl (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t233 a171))
% 25.65/26.13 (step t235 (cl (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule resolution :premises (t212 a7 t170 t215 t226 t234))
% 25.65/26.13 (step t236 (cl (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t188 t195 t209 t235))
% 25.65/26.13 (step t237 (cl (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_neg)
% 25.65/26.13 (step t238 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t239)
% 25.65/26.13 (assume t239.a0 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (assume t239.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 25.65/26.13 (assume t239.a2 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))
% 25.65/26.13 (step t239.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t239.t2)
% 25.65/26.13 (assume t239.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))
% 25.65/26.13 (assume t239.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 25.65/26.13 (assume t239.t2.a2 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (step t239.t2.t1 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk6) true) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule equiv_simplify)
% 25.65/26.13 (step t239.t2.t2 (cl (not (= (tptp.segmentP tptp.sk3 tptp.sk6) true)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule equiv1 :premises (t239.t2.t1))
% 25.65/26.13 (step t239.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3)) :rule symm :premises (t239.t2.a2))
% 25.65/26.13 (step t239.t2.t4 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t239.t2.t3))
% 25.65/26.13 (step t239.t2.t5 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t239.t2.a1))
% 25.65/26.13 (step t239.t2.t6 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t239.t2.t5))
% 25.65/26.13 (step t239.t2.t7 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 25.65/26.13 (step t239.t2.t8 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t239.t2.t6 t239.t2.t7))
% 25.65/26.13 (step t239.t2.t9 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule trans :premises (t239.t2.t4 t239.t2.t8))
% 25.65/26.13 (step t239.t2.t10 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 25.65/26.13 (step t239.t2.t11 (cl (= (tptp.segmentP tptp.sk3 tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule cong :premises (t239.t2.t9 t239.t2.t10))
% 25.65/26.13 (step t239.t2.t12 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule equiv_simplify)
% 25.65/26.13 (step t239.t2.t13 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule equiv2 :premises (t239.t2.t12))
% 25.65/26.13 (step t239.t2.t14 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) true)) :rule resolution :premises (t239.t2.t13 t239.t2.a0))
% 25.65/26.13 (step t239.t2.t15 (cl (= (tptp.segmentP tptp.sk3 tptp.sk6) true)) :rule trans :premises (t239.t2.t11 t239.t2.t14))
% 25.65/26.13 (step t239.t2.t16 (cl (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t239.t2.t2 t239.t2.t15))
% 25.65/26.13 (step t239.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule subproof :discharge (t239.t2.a0 t239.t2.a1 t239.t2.a2))
% 25.65/26.13 (step t239.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule and_pos)
% 25.65/26.13 (step t239.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 25.65/26.13 (step t239.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t239.t6 (cl (tptp.segmentP tptp.sk3 tptp.sk6) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t239.t2 t239.t3 t239.t4 t239.t5))
% 25.65/26.13 (step t239.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule reordering :premises (t239.t6))
% 25.65/26.13 (step t239.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule contraction :premises (t239.t7))
% 25.65/26.13 (step t239.t9 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t239.t1 t239.t8))
% 25.65/26.13 (step t239.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))) :rule implies_neg2)
% 25.65/26.13 (step t239.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule resolution :premises (t239.t9 t239.t10))
% 25.65/26.13 (step t239.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule contraction :premises (t239.t11))
% 25.65/26.13 (step t239.t13 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule implies :premises (t239.t12))
% 25.65/26.13 (step t239.t14 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule and_neg)
% 25.65/26.13 (step t239.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t239.t14 t239.a2 t239.a1 t239.a0))
% 25.65/26.13 (step t239.t16 (cl (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t239.t13 t239.t15))
% 25.65/26.13 (step t239 (cl (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule subproof :discharge (t239.a0 t239.a1 t239.a2))
% 25.65/26.13 (step t240 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t241 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 25.65/26.13 (step t242 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule and_pos)
% 25.65/26.13 (step t243 (cl (tptp.segmentP tptp.sk3 tptp.sk6) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t239 t240 t241 t242))
% 25.65/26.13 (step t244 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule reordering :premises (t243))
% 25.65/26.13 (step t245 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule contraction :premises (t244))
% 25.65/26.13 (step t246 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t238 t245))
% 25.65/26.13 (step t247 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))) :rule implies_neg2)
% 25.65/26.13 (step t248 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule resolution :premises (t246 t247))
% 25.65/26.13 (step t249 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule contraction :premises (t248))
% 25.65/26.13 (step t250 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule implies :premises (t249))
% 25.65/26.13 (step t251 (cl (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t237 t250))
% 25.65/26.13 (step t252 (cl (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk6) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule reordering :premises (t251))
% 25.65/26.13 (step t253 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t149 t169))
% 25.65/26.13 (step t254 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule or_pos)
% 25.65/26.13 (step t255 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule reordering :premises (t254))
% 25.65/26.13 (step t256 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t257)
% 25.65/26.13 (assume t257.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 25.65/26.13 (step t257.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 25.65/26.13 (step t257.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule or :premises (t257.t1))
% 25.65/26.13 (step t257.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t257.t2 t257.a0))
% 25.65/26.13 (step t257 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule subproof :discharge (t257.a0))
% 25.65/26.13 (step t258 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t256 t257))
% 25.65/26.13 (step t259 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule implies_neg2)
% 25.65/26.13 (step t260 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t258 t259))
% 25.65/26.13 (step t261 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule contraction :premises (t260))
% 25.65/26.13 (step t262 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies :premises (t261))
% 25.65/26.13 (step t263 (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)
% 25.65/26.13 (anchor :step t264 :args ((U $$unsorted) (:= U U)))
% 25.65/26.13 (step t264.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t264.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.13 (step t264.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 25.65/26.13 (step t264.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 (t264.t2 t264.t3))
% 25.65/26.13 (step t264 (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)
% 25.65/26.13 (step t265 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t263 t264 a73))
% 25.65/26.13 (step t266 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t262 t265))
% 25.65/26.13 (step t267 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule resolution :premises (t255 t170 t266))
% 25.65/26.13 (step t268 (cl (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule or_pos)
% 25.65/26.13 (step t269 (cl (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule contraction :premises (t268))
% 25.65/26.13 (step t270 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule reordering :premises (t269))
% 25.65/26.13 (step t271 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (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)
% 25.65/26.13 (anchor :step t272)
% 25.65/26.13 (assume t272.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))))
% 25.65/26.13 (step t272.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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk6) (:= W (tptp.cons tptp.sk5 tptp.nil)) (:= X tptp.nil)))
% 25.65/26.13 (step t272.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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule or :premises (t272.t1))
% 25.65/26.13 (step t272.t3 (cl (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t272.t2 t272.a0))
% 25.65/26.13 (step t272 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule subproof :discharge (t272.a0))
% 25.65/26.13 (step t273 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t271 t272))
% 25.65/26.13 (step t274 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies_neg2)
% 25.65/26.13 (step t275 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (=> (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t273 t274))
% 25.65/26.13 (step t276 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule contraction :premises (t275))
% 25.65/26.13 (step t277 (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.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule implies :premises (t276))
% 25.65/26.13 (step t278 (cl (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t277 a171))
% 25.65/26.13 (step t279 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule resolution :premises (t270 a7 t170 t215 t226 t278))
% 25.65/26.13 (step t280 (cl (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t252 t253 t267 t279))
% 25.65/26.13 (step t281 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t282)
% 25.65/26.13 (assume t282.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))
% 25.65/26.13 (step t282.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6)))
% 25.65/26.13 (step t282.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule or :premises (t282.t1))
% 25.65/26.13 (step t282.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule resolution :premises (t282.t2 t282.a0))
% 25.65/26.13 (step t282 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule subproof :discharge (t282.a0))
% 25.65/26.13 (step t283 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule resolution :premises (t281 t282))
% 25.65/26.13 (step t284 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule implies_neg2)
% 25.65/26.13 (step t285 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule resolution :premises (t283 t284))
% 25.65/26.13 (step t286 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule contraction :premises (t285))
% 25.65/26.13 (step t287 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule implies :premises (t286))
% 25.65/26.13 (step t288 (cl (not (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))))) (not (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))) :rule equiv_pos2)
% 25.65/26.13 (step t289 (cl (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))))) :rule all_simplify)
% 25.65/26.13 (step t290 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.13 (step t291 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t85))
% 25.65/26.13 (step t292 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk4))) :rule cong :premises (t290 t291))
% 25.65/26.13 (anchor :step t293 :args ((A $$unsorted) (:= A A)))
% 25.65/26.13 (step t293.t1 (cl (= A A)) :rule refl)
% 25.65/26.13 (step t293.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.65/26.13 (step t293.t3 (cl (= (not (tptp.neq A tptp.nil)) (not (tptp.neq A tptp.nil)))) :rule refl)
% 25.65/26.13 (step t293.t4 (cl (= A A)) :rule refl)
% 25.65/26.13 (step t293.t5 (cl (= (tptp.segmentP tptp.sk2 A) (tptp.segmentP tptp.sk4 A))) :rule cong :premises (t291 t293.t4))
% 25.65/26.13 (step t293.t6 (cl (= (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk4 A)))) :rule cong :premises (t293.t5))
% 25.65/26.13 (step t293.t7 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t85))
% 25.65/26.13 (step t293.t8 (cl (= (tptp.segmentP tptp.sk1 A) (tptp.segmentP tptp.sk3 A))) :rule cong :premises (t293.t7 t293.t4))
% 25.65/26.13 (step t293.t9 (cl (= (not (tptp.segmentP tptp.sk1 A)) (not (tptp.segmentP tptp.sk3 A)))) :rule cong :premises (t293.t8))
% 25.65/26.13 (step t293.t10 (cl (= (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule cong :premises (t293.t2 t293.t3 t293.t6 t293.t9))
% 25.65/26.13 (step t293 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))) :rule bind)
% 25.65/26.13 (step t294 (cl (= (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))))) :rule cong :premises (t292 t293))
% 25.65/26.13 (step t295 (cl (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))))) :rule trans :premises (t289 t294))
% 25.65/26.13 (step t296 (cl (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))) :rule resolution :premises (t288 t295 a197))
% 25.65/26.13 (step t297 (cl (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule or :premises (t296))
% 25.65/26.13 (step t298 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule resolution :premises (t297 t168))
% 25.65/26.13 (step t299 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule resolution :premises (t287 t298))
% 25.65/26.13 (step t300 (cl (not (tptp.neq tptp.sk6 tptp.nil))) :rule resolution :premises (t172 t170 t236 t280 t299))
% 25.65/26.13 (step t301 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t302)
% 25.65/26.13 (assume t302.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 25.65/26.13 (step t302.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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk6)))
% 25.65/26.13 (step t302.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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule or :premises (t302.t1))
% 25.65/26.13 (step t302.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule resolution :premises (t302.t2 t302.a0))
% 25.65/26.13 (step t302 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule subproof :discharge (t302.a0))
% 25.65/26.13 (step t303 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule resolution :premises (t301 t302))
% 25.65/26.13 (step t304 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule implies_neg2)
% 25.65/26.13 (step t305 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (=> (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule resolution :premises (t303 t304))
% 25.65/26.13 (step t306 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule contraction :premises (t305))
% 25.65/26.13 (step t307 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule implies :premises (t306))
% 25.65/26.13 (step t308 (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)
% 25.65/26.13 (anchor :step t309 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.65/26.13 (step t309.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t309.t2 (cl (= V V)) :rule refl)
% 25.65/26.13 (step t309.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.13 (step t309.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.13 (step t309.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 25.65/26.13 (step t309.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 25.65/26.13 (step t309.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 (t309.t3 t309.t4 t309.t5 t309.t6))
% 25.65/26.13 (step t309 (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)
% 25.65/26.13 (step t310 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t308 t309 a99))
% 25.65/26.13 (step t311 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule resolution :premises (t307 t310))
% 25.65/26.13 (step t312 (cl (= tptp.nil tptp.sk6)) :rule resolution :premises (t79 a7 t170 t300 t311))
% 25.65/26.13 (step t313 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 25.65/26.13 (step t314 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t313))
% 25.65/26.13 (step t315 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule and_neg)
% 25.65/26.13 (step t316 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t317)
% 25.65/26.13 (assume t317.a0 (tptp.ssList tptp.sk3))
% 25.65/26.13 (assume t317.a1 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (assume t317.a2 (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))
% 25.65/26.13 (assume t317.a3 (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))
% 25.65/26.13 (step t317.t1 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t317.t2)
% 25.65/26.13 (assume t317.t2.a0 (tptp.ssList tptp.sk3))
% 25.65/26.13 (assume t317.t2.a1 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.13 (assume t317.t2.a2 (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))
% 25.65/26.13 (assume t317.t2.a3 (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))
% 25.65/26.13 (step t317.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) true) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule equiv_simplify)
% 25.65/26.13 (step t317.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) true)) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule equiv1 :premises (t317.t2.t1))
% 25.65/26.13 (step t317.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule symm :premises (t317.t2.a3))
% 25.65/26.13 (step t317.t2.t4 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule symm :premises (t317.t2.t3))
% 25.65/26.13 (step t317.t2.t5 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 25.65/26.13 (step t317.t2.t6 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t317.t2.a2))
% 25.65/26.13 (step t317.t2.t7 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule symm :premises (t317.t2.t6))
% 25.65/26.13 (step t317.t2.t8 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t317.t2.t7))
% 25.65/26.13 (step t317.t2.t9 (cl (= (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t317.t2.t5 t317.t2.t8))
% 25.65/26.13 (step t317.t2.t10 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3)) :rule symm :premises (t317.t2.a1))
% 25.65/26.13 (step t317.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) tptp.sk3)) :rule trans :premises (t317.t2.t4 t317.t2.t9 t317.t2.t10))
% 25.65/26.13 (step t317.t2.t12 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) (tptp.ssList tptp.sk3))) :rule cong :premises (t317.t2.t11))
% 25.65/26.13 (step t317.t2.t13 (cl (= (= (tptp.ssList tptp.sk3) true) (tptp.ssList tptp.sk3))) :rule equiv_simplify)
% 25.65/26.13 (step t317.t2.t14 (cl (= (tptp.ssList tptp.sk3) true) (not (tptp.ssList tptp.sk3))) :rule equiv2 :premises (t317.t2.t13))
% 25.65/26.13 (step t317.t2.t15 (cl (= (tptp.ssList tptp.sk3) true)) :rule resolution :premises (t317.t2.t14 t317.t2.a0))
% 25.65/26.13 (step t317.t2.t16 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) true)) :rule trans :premises (t317.t2.t12 t317.t2.t15))
% 25.65/26.13 (step t317.t2.t17 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule resolution :premises (t317.t2.t2 t317.t2.t16))
% 25.65/26.13 (step t317.t2 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule subproof :discharge (t317.t2.a0 t317.t2.a1 t317.t2.a2 t317.t2.a3))
% 25.65/26.13 (step t317.t3 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList tptp.sk3)) :rule and_pos)
% 25.65/26.13 (step t317.t4 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t317.t5 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t317.t6 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t317.t7 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule resolution :premises (t317.t2 t317.t3 t317.t4 t317.t5 t317.t6))
% 25.65/26.13 (step t317.t8 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule reordering :premises (t317.t7))
% 25.65/26.13 (step t317.t9 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule contraction :premises (t317.t8))
% 25.65/26.13 (step t317.t10 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule resolution :premises (t317.t1 t317.t9))
% 25.65/26.13 (step t317.t11 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule implies_neg2)
% 25.65/26.13 (step t317.t12 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule resolution :premises (t317.t10 t317.t11))
% 25.65/26.13 (step t317.t13 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule contraction :premises (t317.t12))
% 25.65/26.13 (step t317.t14 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule implies :premises (t317.t13))
% 25.65/26.13 (step t317.t15 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule and_neg)
% 25.65/26.13 (step t317.t16 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule resolution :premises (t317.t15 t317.a0 t317.a1 t317.a2 t317.a3))
% 25.65/26.13 (step t317.t17 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule resolution :premises (t317.t14 t317.t16))
% 25.65/26.13 (step t317 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule subproof :discharge (t317.a0 t317.a1 t317.a2 t317.a3))
% 25.65/26.13 (step t318 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList tptp.sk3)) :rule and_pos)
% 25.65/26.13 (step t319 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t320 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule and_pos)
% 25.65/26.13 (step t321 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule and_pos)
% 25.65/26.13 (step t322 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule resolution :premises (t317 t318 t319 t320 t321))
% 25.65/26.13 (step t323 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule reordering :premises (t322))
% 25.65/26.13 (step t324 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule contraction :premises (t323))
% 25.65/26.13 (step t325 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule resolution :premises (t316 t324))
% 25.65/26.13 (step t326 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule implies_neg2)
% 25.65/26.13 (step t327 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule resolution :premises (t325 t326))
% 25.65/26.13 (step t328 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)))) :rule contraction :premises (t327))
% 25.65/26.13 (step t329 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule implies :premises (t328))
% 25.65/26.13 (step t330 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule resolution :premises (t315 t329))
% 25.65/26.13 (step t331 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) (not (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule reordering :premises (t330))
% 25.65/26.13 (step t332 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule or_pos)
% 25.65/26.13 (step t333 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule reordering :premises (t332))
% 25.65/26.13 (step t334 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule equiv_pos2)
% 25.65/26.13 (step t335 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))) :rule refl)
% 25.65/26.13 (step t336 (cl (= (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule refl)
% 25.65/26.13 (step t337 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 25.65/26.13 (step t338 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule all_simplify)
% 25.65/26.13 (step t339 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule cong :premises (t336 t337 t338))
% 25.65/26.13 (step t340 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule cong :premises (t335 t339))
% 25.65/26.13 (step t341 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t342)
% 25.65/26.13 (assume t342.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 25.65/26.13 (step t342.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 25.65/26.13 (step t342.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t342.t1))
% 25.65/26.13 (step t342.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t342.t2 t342.a0))
% 25.65/26.13 (step t342 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t342.a0))
% 25.65/26.13 (step t343 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t341 t342))
% 25.65/26.13 (step t344 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t345 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t343 t344))
% 25.65/26.13 (step t346 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t345))
% 25.65/26.13 (step t347 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule resolution :premises (t334 t340 t346))
% 25.65/26.13 (step t348 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule implies :premises (t347))
% 25.65/26.13 (step t349 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule resolution :premises (t348 a119))
% 25.65/26.13 (step t350 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule resolution :premises (t333 a7 t214 t349))
% 25.65/26.13 (step t351 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule or_pos)
% 25.65/26.13 (step t352 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule reordering :premises (t351))
% 25.65/26.13 (step t353 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t354)
% 25.65/26.13 (assume t354.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 25.65/26.13 (step t354.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule forall_inst :args ((:= U tptp.nil) (:= V (tptp.cons tptp.sk5 tptp.nil)) (:= W tptp.sk6)))
% 25.65/26.13 (step t354.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule or :premises (t354.t1))
% 25.65/26.13 (step t354.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule resolution :premises (t354.t2 t354.a0))
% 25.65/26.13 (step t354 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule subproof :discharge (t354.a0))
% 25.65/26.13 (step t355 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule resolution :premises (t353 t354))
% 25.65/26.13 (step t356 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule implies_neg2)
% 25.65/26.13 (step t357 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule resolution :premises (t355 t356))
% 25.65/26.13 (step t358 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))))) :rule contraction :premises (t357))
% 25.65/26.13 (step t359 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule implies :premises (t358))
% 25.65/26.13 (step t360 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule resolution :premises (t359 a148))
% 25.65/26.13 (step t361 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.app tptp.sk6 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule resolution :premises (t352 a7 t170 t215 t360))
% 25.65/26.13 (step t362 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) :rule resolution :premises (t331 a187 t253 t350 t361))
% 25.65/26.13 (step t363 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t364)
% 25.65/26.13 (assume t364.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))
% 25.65/26.13 (step t364.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil)) (:= W tptp.nil)))
% 25.65/26.13 (step t364.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t364.t1))
% 25.65/26.13 (step t364.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t364.t2 t364.a0))
% 25.65/26.13 (step t364 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t364.a0))
% 25.65/26.13 (step t365 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t363 t364))
% 25.65/26.13 (step t366 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.13 (step t367 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t365 t366))
% 25.65/26.13 (step t368 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t367))
% 25.65/26.13 (step t369 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t368))
% 25.65/26.13 (step t370 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule equiv_pos2)
% 25.65/26.13 (anchor :step t371 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 25.65/26.13 (step t371.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t371.t2 (cl (= V V)) :rule refl)
% 25.65/26.13 (step t371.t3 (cl (= W W)) :rule refl)
% 25.65/26.13 (step t371.t4 (cl (= X X)) :rule refl)
% 25.65/26.13 (step t371.t5 (cl (= (= (tptp.app (tptp.app U V) W) X) (= X (tptp.app (tptp.app U V) W)))) :rule all_simplify)
% 25.65/26.13 (step t371.t6 (cl (= (not (= (tptp.app (tptp.app U V) W) X)) (not (= X (tptp.app (tptp.app U V) W))))) :rule cong :premises (t371.t5))
% 25.65/26.13 (step t371.t7 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 25.65/26.13 (step t371.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.13 (step t371.t9 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.13 (step t371.t10 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 25.65/26.13 (step t371.t11 (cl (= (tptp.segmentP X V) (tptp.segmentP X V))) :rule refl)
% 25.65/26.13 (step t371.t12 (cl (= (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)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V)))) :rule cong :premises (t371.t6 t371.t7 t371.t8 t371.t9 t371.t10 t371.t11))
% 25.65/26.13 (step t371 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))) :rule bind)
% 25.65/26.13 (step t372 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule all_simplify)
% 25.65/26.13 (anchor :step t373 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 25.65/26.13 (step t373.t1 (cl (= U U)) :rule refl)
% 25.65/26.13 (step t373.t2 (cl (= V V)) :rule refl)
% 25.65/26.13 (step t373.t3 (cl (= W W)) :rule refl)
% 25.65/26.13 (step t373.t4 (cl (= (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W)) true)) :rule all_simplify)
% 25.65/26.13 (step t373.t5 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not true))) :rule cong :premises (t373.t4))
% 25.65/26.13 (step t373.t6 (cl (= (not true) false)) :rule all_simplify)
% 25.65/26.13 (step t373.t7 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) false)) :rule trans :premises (t373.t5 t373.t6))
% 25.65/26.13 (step t373.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 25.65/26.13 (step t373.t9 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.13 (step t373.t10 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.13 (step t373.t11 (cl (= (not (tptp.ssList (tptp.app (tptp.app U V) W))) (not (tptp.ssList (tptp.app (tptp.app U V) W))))) :rule refl)
% 25.65/26.13 (step t373.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app U V) W) V) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) :rule refl)
% 25.65/26.13 (step t373.t13 (cl (= (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule cong :premises (t373.t7 t373.t8 t373.t9 t373.t10 t373.t11 t373.t12))
% 25.65/26.13 (step t373.t14 (cl (= (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule all_simplify)
% 25.65/26.13 (step t373.t15 (cl (= (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule trans :premises (t373.t13 t373.t14))
% 25.65/26.13 (step t373 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule bind)
% 25.65/26.13 (step t374 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule trans :premises (t372 t373))
% 25.65/26.13 (step t375 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule trans :premises (t371 t374))
% 25.65/26.13 (step t376 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule resolution :premises (t370 t375 a172))
% 25.65/26.13 (step t377 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t369 t376))
% 25.65/26.13 (step t378 (cl (tptp.segmentP (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t314 a7 t170 t215 t362 t377))
% 25.65/26.13 (step t379 (cl (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule or_pos)
% 25.65/26.13 (step t380 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule reordering :premises (t379))
% 25.65/26.13 (step t381 (cl (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)) :rule or_pos)
% 25.65/26.13 (step t382 (cl (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule reordering :premises (t381))
% 25.65/26.13 (step t383 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t384)
% 25.65/26.13 (assume t384.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.65/26.13 (step t384.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 25.65/26.13 (step t384.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule or :premises (t384.t1))
% 25.65/26.13 (step t384.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t384.t2 t384.a0))
% 25.65/26.13 (step t384 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule subproof :discharge (t384.a0))
% 25.65/26.13 (step t385 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t383 t384))
% 25.65/26.13 (step t386 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule implies_neg2)
% 25.65/26.13 (step t387 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule resolution :premises (t385 t386))
% 25.65/26.13 (step t388 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule contraction :premises (t387))
% 25.65/26.13 (step t389 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule implies :premises (t388))
% 25.65/26.13 (step t390 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t389 a56))
% 25.65/26.13 (step t391 (cl (tptp.segmentP tptp.sk4 tptp.sk4)) :rule resolution :premises (t382 a188 t390))
% 25.65/26.13 (step t392 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule implies_neg1)
% 25.65/26.13 (anchor :step t393)
% 25.65/26.13 (assume t393.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))
% 25.65/26.13 (step t393.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule forall_inst :args ((:= A tptp.sk4)))
% 25.65/26.13 (step t393.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule or :premises (t393.t1))
% 25.65/26.13 (step t393.t3 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t393.t2 t393.a0))
% 25.65/26.13 (step t393 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule subproof :discharge (t393.a0))
% 25.65/26.13 (step t394 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t392 t393))
% 25.65/26.13 (step t395 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule implies_neg2)
% 25.65/26.13 (step t396 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t394 t395))
% 25.65/26.13 (step t397 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule contraction :premises (t396))
% 25.65/26.13 (step t398 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule implies :premises (t397))
% 25.65/26.13 (step t399 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t398 t298))
% 25.65/26.13 (step t400 (cl (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t380 t169 a188 t391 t399))
% 25.65/26.13 (step t401 (cl) :rule resolution :premises (t77 t312 t378 t361 t400 t350 t253 t195))
% 25.65/26.13
% 25.65/26.13 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.C73z4n3aDS/cvc5---1.0.5_21490.smt2
% 25.65/26.14 % cvc5---1.0.5 exiting
% 25.65/26.14 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------