TSTP Solution File: SWC090-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC090-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n016.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:19 EDT 2024
% Result : Unsatisfiable 1.02s 1.23s
% Output : Proof 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.17 % Problem : SWC090-1 : TPTP v8.2.0. Released v2.4.0.
% 0.17/0.18 % Command : do_cvc5 %s %d
% 0.18/0.40 % Computer : n016.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Sun May 26 15:16:09 EDT 2024
% 0.18/0.40 % CPUTime :
% 0.41/0.61 %----Proving TF0_NAR, FOF, or CNF
% 0.41/0.62 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.02/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.0GfcwEzO8N/cvc5---1.0.5_3601.smt2
% 1.02/1.23 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.0GfcwEzO8N/cvc5---1.0.5_3601.smt2
% 1.06/1.26 (assume a0 (tptp.equalelemsP tptp.nil))
% 1.06/1.26 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 1.06/1.26 (assume a2 (tptp.strictorderedP tptp.nil))
% 1.06/1.26 (assume a3 (tptp.totalorderedP tptp.nil))
% 1.06/1.26 (assume a4 (tptp.strictorderP tptp.nil))
% 1.06/1.26 (assume a5 (tptp.totalorderP tptp.nil))
% 1.06/1.26 (assume a6 (tptp.cyclefreeP tptp.nil))
% 1.06/1.26 (assume a7 (tptp.ssList tptp.nil))
% 1.06/1.26 (assume a8 (tptp.ssItem tptp.skac3))
% 1.06/1.26 (assume a9 (tptp.ssItem tptp.skac2))
% 1.06/1.26 (assume a10 (not (tptp.singletonP tptp.nil)))
% 1.06/1.26 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 1.06/1.26 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 1.06/1.26 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 1.06/1.26 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 1.06/1.26 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 1.06/1.26 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 1.06/1.26 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 1.06/1.26 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 1.06/1.26 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 1.06/1.26 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 1.06/1.26 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 1.06/1.26 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 1.06/1.26 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 1.06/1.26 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 1.06/1.26 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 1.06/1.26 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 1.06/1.26 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 1.06/1.26 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 1.06/1.26 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 1.06/1.26 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 1.06/1.26 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 1.06/1.26 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 1.06/1.26 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 1.06/1.26 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 1.06/1.26 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 1.06/1.26 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 1.06/1.26 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 1.06/1.26 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 1.06/1.26 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 1.06/1.26 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 1.06/1.26 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 1.06/1.26 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 1.06/1.26 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 1.06/1.26 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 1.06/1.26 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 1.06/1.26 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 1.06/1.26 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 1.06/1.26 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 1.06/1.26 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 1.06/1.26 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 1.06/1.26 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 1.06/1.26 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 1.06/1.26 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 1.06/1.26 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 1.06/1.26 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 1.06/1.26 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.06/1.26 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 1.06/1.26 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 1.06/1.26 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 1.06/1.26 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 1.06/1.26 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 1.06/1.26 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 1.06/1.26 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 1.06/1.26 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 1.06/1.26 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 1.06/1.26 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 1.06/1.26 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 1.06/1.26 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.06/1.26 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.06/1.26 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.06/1.26 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.06/1.26 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 1.06/1.26 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.06/1.26 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 1.06/1.26 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.06/1.26 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 1.06/1.26 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.06/1.26 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.06/1.26 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.06/1.26 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 1.06/1.26 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 1.06/1.26 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 1.06/1.26 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 1.06/1.26 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 1.06/1.26 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.06/1.26 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.06/1.26 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.06/1.26 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.06/1.26 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 1.06/1.26 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 1.06/1.26 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.06/1.26 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.06/1.26 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 1.06/1.26 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 1.06/1.26 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 1.06/1.26 (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))))
% 1.06/1.26 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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))))
% 1.06/1.26 (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)))))
% 1.06/1.26 (assume a185 (tptp.ssList tptp.sk1))
% 1.06/1.26 (assume a186 (tptp.ssList tptp.sk2))
% 1.06/1.26 (assume a187 (tptp.ssList tptp.sk3))
% 1.06/1.26 (assume a188 (tptp.ssList tptp.sk4))
% 1.06/1.26 (assume a189 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume a190 (= tptp.sk1 tptp.sk3))
% 1.06/1.26 (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 1.06/1.26 (assume a192 (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)))))
% 1.06/1.26 (assume a193 (tptp.ssList tptp.sk5))
% 1.06/1.26 (assume a194 (tptp.ssList tptp.sk6))
% 1.06/1.26 (assume a195 (= (tptp.app tptp.sk5 tptp.sk6) tptp.sk4))
% 1.06/1.26 (assume a196 (= (tptp.app tptp.sk6 tptp.sk5) tptp.sk3))
% 1.06/1.26 (step t1 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule equiv_pos2)
% 1.06/1.26 (step t2 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 1.06/1.26 (step t3 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 1.06/1.26 (step t4 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))))) :rule refl)
% 1.06/1.26 (step t5 (cl (= (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))))) :rule refl)
% 1.06/1.26 (step t6 (cl (= (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule refl)
% 1.06/1.26 (step t7 (cl (= (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule refl)
% 1.06/1.26 (step t8 (cl (= (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule refl)
% 1.06/1.26 (step t9 (cl (= (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule refl)
% 1.06/1.26 (step t10 (cl (= (not (= tptp.nil tptp.sk6)) (not (= tptp.nil tptp.sk6)))) :rule refl)
% 1.06/1.26 (step t11 (cl (= (= (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2)) true) (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule equiv_simplify)
% 1.06/1.26 (step t12 (cl (not (= (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2)) true)) (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule equiv1 :premises (t11))
% 1.06/1.26 (step t13 (cl (= (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2)) (= (tptp.segmentP tptp.sk1 tptp.sk2) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))))) :rule all_simplify)
% 1.06/1.26 (step t14 (cl (= (tptp.segmentP tptp.sk1 tptp.sk2) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule refl)
% 1.06/1.26 (step t15 (cl (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule all_simplify)
% 1.06/1.26 (step t16 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk2) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= (tptp.segmentP tptp.sk1 tptp.sk2) (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule cong :premises (t14 t15))
% 1.06/1.26 (step t17 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk2) (tptp.segmentP tptp.sk1 tptp.sk2)) true)) :rule all_simplify)
% 1.06/1.26 (step t18 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk2) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) true)) :rule trans :premises (t16 t17))
% 1.06/1.26 (step t19 (cl (= (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2)) true)) :rule trans :premises (t13 t18))
% 1.06/1.26 (step t20 (cl (= (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule resolution :premises (t12 t19))
% 1.06/1.26 (step t21 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule cong :premises (t2 t3 t4 t5 t6 t7 t8 t9 t10 t20))
% 1.06/1.26 (step t22 (cl (not (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))))) (not (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule equiv_pos2)
% 1.06/1.26 (step t23 (cl (= (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule refl)
% 1.06/1.26 (step t24 (cl (= (= (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule equiv_simplify)
% 1.06/1.26 (step t25 (cl (= (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (not (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule equiv2 :premises (t24))
% 1.06/1.26 (step t26 (cl (not (not (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule not_not)
% 1.06/1.26 (step t27 (cl (= (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t25 t26))
% 1.06/1.26 (step t28 (cl (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t29)
% 1.06/1.26 (assume t29.a0 (not (tptp.segmentP tptp.sk1 tptp.sk2)))
% 1.06/1.26 (assume t29.a1 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume t29.a2 (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))
% 1.06/1.26 (assume t29.a3 (= tptp.nil tptp.sk6))
% 1.06/1.26 (assume t29.a4 (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))
% 1.06/1.26 (assume t29.a5 (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))
% 1.06/1.26 (assume t29.a6 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 1.06/1.26 (assume t29.a7 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)))
% 1.06/1.26 (assume t29.a8 (= tptp.sk1 tptp.sk3))
% 1.06/1.26 (assume t29.a9 (tptp.segmentP tptp.sk1 tptp.sk1))
% 1.06/1.26 (step t29.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 1.06/1.26 (step t29.t2 (cl (= (= true false) false)) :rule all_simplify)
% 1.06/1.26 (step t29.t3 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk1) true) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule equiv_simplify)
% 1.06/1.26 (step t29.t4 (cl (= (tptp.segmentP tptp.sk1 tptp.sk1) true) (not (tptp.segmentP tptp.sk1 tptp.sk1))) :rule equiv2 :premises (t29.t3))
% 1.06/1.26 (step t29.t5 (cl (= (tptp.segmentP tptp.sk1 tptp.sk1) true)) :rule resolution :premises (t29.t4 t29.a9))
% 1.06/1.26 (step t29.t6 (cl (= true (tptp.segmentP tptp.sk1 tptp.sk1))) :rule symm :premises (t29.t5))
% 1.06/1.26 (step t29.t7 (cl (= tptp.sk1 tptp.sk1)) :rule refl)
% 1.06/1.26 (step t29.t8 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t29.a8))
% 1.06/1.26 (step t29.t9 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t29.t8))
% 1.06/1.26 (step t29.t10 (cl (= (tptp.app tptp.sk6 tptp.sk5) tptp.sk3)) :rule symm :premises (t29.a7))
% 1.06/1.26 (step t29.t11 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule symm :premises (t29.t10))
% 1.06/1.26 (step t29.t12 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 1.06/1.26 (step t29.t13 (cl (= (tptp.app tptp.sk6 tptp.sk5) (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule cong :premises (t29.a6 t29.t12))
% 1.06/1.26 (step t29.t14 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t29.a6))
% 1.06/1.26 (step t29.t15 (cl (= tptp.sk6 tptp.nil)) :rule symm :premises (t29.a3))
% 1.06/1.26 (step t29.t16 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.nil)) :rule trans :premises (t29.t14 t29.t15))
% 1.06/1.26 (step t29.t17 (cl (= (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) (tptp.app tptp.nil tptp.sk5))) :rule cong :premises (t29.t16 t29.t12))
% 1.06/1.26 (step t29.t18 (cl (= (tptp.app tptp.nil tptp.sk5) tptp.sk5)) :rule symm :premises (t29.a5))
% 1.06/1.26 (step t29.t19 (cl (= (tptp.app tptp.sk5 tptp.nil) tptp.sk5)) :rule symm :premises (t29.a4))
% 1.06/1.26 (step t29.t20 (cl (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) :rule symm :premises (t29.t19))
% 1.06/1.26 (step t29.t21 (cl (= tptp.nil tptp.sk6)) :rule symm :premises (t29.t15))
% 1.06/1.26 (step t29.t22 (cl (= (tptp.app tptp.sk5 tptp.nil) (tptp.app tptp.sk5 tptp.sk6))) :rule cong :premises (t29.t12 t29.t21))
% 1.06/1.26 (step t29.t23 (cl (= (tptp.app tptp.sk5 tptp.sk6) tptp.sk4)) :rule symm :premises (t29.a2))
% 1.06/1.26 (step t29.t24 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t29.a1))
% 1.06/1.26 (step t29.t25 (cl (= tptp.sk1 tptp.sk2)) :rule trans :premises (t29.t9 t29.t11 t29.t13 t29.t17 t29.t18 t29.t20 t29.t22 t29.t23 t29.t24))
% 1.06/1.26 (step t29.t26 (cl (= (tptp.segmentP tptp.sk1 tptp.sk1) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule cong :premises (t29.t7 t29.t25))
% 1.06/1.26 (step t29.t27 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk2) false) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule equiv_simplify)
% 1.06/1.26 (step t29.t28 (cl (= (tptp.segmentP tptp.sk1 tptp.sk2) false) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule equiv2 :premises (t29.t27))
% 1.06/1.26 (step t29.t29 (cl (not (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (tptp.segmentP tptp.sk1 tptp.sk2)) :rule not_not)
% 1.06/1.26 (step t29.t30 (cl (= (tptp.segmentP tptp.sk1 tptp.sk2) false) (tptp.segmentP tptp.sk1 tptp.sk2)) :rule resolution :premises (t29.t28 t29.t29))
% 1.06/1.26 (step t29.t31 (cl (= (tptp.segmentP tptp.sk1 tptp.sk2) false)) :rule resolution :premises (t29.t30 t29.a0))
% 1.06/1.26 (step t29.t32 (cl (= true false)) :rule trans :premises (t29.t6 t29.t26 t29.t31))
% 1.06/1.26 (step t29.t33 (cl false) :rule resolution :premises (t29.t1 t29.t2 t29.t32))
% 1.06/1.26 (step t29 (cl (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk1)) false) :rule subproof :discharge (t29.a0 t29.a1 t29.a2 t29.a3 t29.a4 t29.a5 t29.a6 t29.a7 t29.a8 t29.a9))
% 1.06/1.26 (step t30 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (tptp.segmentP tptp.sk1 tptp.sk2))) :rule and_pos)
% 1.06/1.26 (step t31 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.06/1.26 (step t32 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t33 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.nil tptp.sk6)) :rule and_pos)
% 1.06/1.26 (step t34 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) :rule and_pos)
% 1.06/1.26 (step t35 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) :rule and_pos)
% 1.06/1.26 (step t36 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t37 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule and_pos)
% 1.06/1.26 (step t38 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.06/1.26 (step t39 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule and_pos)
% 1.06/1.26 (step t40 (cl false (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t29 t30 t31 t32 t33 t34 t35 t36 t37 t38 t39))
% 1.06/1.26 (step t41 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) false) :rule reordering :premises (t40))
% 1.06/1.26 (step t42 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) false) :rule contraction :premises (t41))
% 1.06/1.26 (step t43 (cl (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) false) :rule resolution :premises (t28 t42))
% 1.06/1.26 (step t44 (cl (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (not false)) :rule implies_neg2)
% 1.06/1.26 (step t45 (cl (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false)) :rule resolution :premises (t43 t44))
% 1.06/1.26 (step t46 (cl (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false)) :rule contraction :premises (t45))
% 1.06/1.26 (step t47 (cl (= (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule implies_simplify)
% 1.06/1.26 (step t48 (cl (not (=> (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false)) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule equiv1 :premises (t47))
% 1.06/1.26 (step t49 (cl (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t46 t48))
% 1.06/1.26 (step t50 (cl (= (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) false)) :rule resolution :premises (t27 t49))
% 1.06/1.26 (step t51 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) false))) :rule cong :premises (t23 t50))
% 1.06/1.26 (step t52 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) false) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))))) :rule all_simplify)
% 1.06/1.26 (step t53 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))))) :rule trans :premises (t51 t52))
% 1.06/1.26 (step t54 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t55)
% 1.06/1.26 (assume t55.a0 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume t55.a1 (= tptp.sk1 tptp.sk3))
% 1.06/1.26 (assume t55.a2 (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))
% 1.06/1.26 (assume t55.a3 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)))
% 1.06/1.26 (assume t55.a4 (tptp.segmentP tptp.sk1 tptp.sk1))
% 1.06/1.26 (assume t55.a5 (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))
% 1.06/1.26 (assume t55.a6 (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))
% 1.06/1.26 (assume t55.a7 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 1.06/1.26 (assume t55.a8 (= tptp.nil tptp.sk6))
% 1.06/1.26 (assume t55.a9 (not (tptp.segmentP tptp.sk1 tptp.sk2)))
% 1.06/1.26 (step t55.t1 (cl (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk1))) :rule and_neg)
% 1.06/1.26 (step t55.t2 (cl (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t55.t1 t55.a9 t55.a0 t55.a2 t55.a8 t55.a5 t55.a6 t55.a7 t55.a3 t55.a1 t55.a4))
% 1.06/1.26 (step t55 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t55.a0 t55.a1 t55.a2 t55.a3 t55.a4 t55.a5 t55.a6 t55.a7 t55.a8 t55.a9))
% 1.06/1.26 (step t56 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.06/1.26 (step t57 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.06/1.26 (step t58 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t59 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule and_pos)
% 1.06/1.26 (step t60 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule and_pos)
% 1.06/1.26 (step t61 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) :rule and_pos)
% 1.06/1.26 (step t62 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) :rule and_pos)
% 1.06/1.26 (step t63 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t64 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (= tptp.nil tptp.sk6)) :rule and_pos)
% 1.06/1.26 (step t65 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (tptp.segmentP tptp.sk1 tptp.sk2))) :rule and_pos)
% 1.06/1.26 (step t66 (cl (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule resolution :premises (t55 t56 t57 t58 t59 t60 t61 t62 t63 t64 t65))
% 1.06/1.26 (step t67 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule reordering :premises (t66))
% 1.06/1.26 (step t68 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule contraction :premises (t67))
% 1.06/1.26 (step t69 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t54 t68))
% 1.06/1.26 (step t70 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 1.06/1.26 (step t71 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t69 t70))
% 1.06/1.26 (step t72 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))) (and (not (tptp.segmentP tptp.sk1 tptp.sk2)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.nil tptp.sk6) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t71))
% 1.06/1.26 (step t73 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule resolution :premises (t22 t53 t72))
% 1.06/1.26 (step t74 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule not_and :premises (t73))
% 1.06/1.26 (step t75 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 1.06/1.26 (step t76 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 1.06/1.26 (step t77 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))))) :rule or_neg)
% 1.06/1.26 (step t78 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))))) :rule or_neg)
% 1.06/1.26 (step t79 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule or_neg)
% 1.06/1.26 (step t80 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule or_neg)
% 1.06/1.26 (step t81 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule or_neg)
% 1.06/1.26 (step t82 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 1.06/1.26 (step t83 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (= tptp.nil tptp.sk6)))) :rule or_neg)
% 1.06/1.26 (step t84 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (not (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule or_neg)
% 1.06/1.26 (step t85 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule resolution :premises (t74 t75 t76 t77 t78 t79 t80 t81 t82 t83 t84))
% 1.06/1.26 (step t86 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule contraction :premises (t85))
% 1.06/1.26 (step t87 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk2))) :rule resolution :premises (t1 t21 t86))
% 1.06/1.26 (step t88 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk2)) :rule or :premises (t87))
% 1.06/1.26 (step t89 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk2) (not (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6))) :rule reordering :premises (t88))
% 1.06/1.26 (step t90 (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)
% 1.06/1.26 (step t91 (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 (t90))
% 1.06/1.26 (step t92 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))) :rule or_pos)
% 1.06/1.26 (step t93 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))))) :rule reordering :premises (t92))
% 1.06/1.26 (step t94 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule and_neg)
% 1.06/1.26 (step t95 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t96)
% 1.06/1.26 (assume t96.a0 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume t96.a1 (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))
% 1.06/1.26 (assume t96.a2 (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))
% 1.06/1.26 (assume t96.a3 (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))
% 1.06/1.26 (step t96.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6)) (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t96.t2)
% 1.06/1.26 (assume t96.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))
% 1.06/1.26 (assume t96.t2.a1 (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))
% 1.06/1.26 (assume t96.t2.a2 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume t96.t2.a3 (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))
% 1.06/1.26 (step t96.t2.t1 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk6) true) (tptp.segmentP tptp.sk2 tptp.sk6))) :rule equiv_simplify)
% 1.06/1.26 (step t96.t2.t2 (cl (not (= (tptp.segmentP tptp.sk2 tptp.sk6) true)) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule equiv1 :premises (t96.t2.t1))
% 1.06/1.26 (step t96.t2.t3 (cl (= (tptp.app tptp.sk2 tptp.nil) tptp.sk2)) :rule symm :premises (t96.t2.a3))
% 1.06/1.26 (step t96.t2.t4 (cl (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule symm :premises (t96.t2.t3))
% 1.06/1.26 (step t96.t2.t5 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t96.t2.a2))
% 1.06/1.26 (step t96.t2.t6 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t96.t2.t5))
% 1.06/1.26 (step t96.t2.t7 (cl (= (tptp.app tptp.sk5 tptp.sk6) tptp.sk4)) :rule symm :premises (t96.t2.a1))
% 1.06/1.26 (step t96.t2.t8 (cl (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule symm :premises (t96.t2.t7))
% 1.06/1.26 (step t96.t2.t9 (cl (= tptp.sk2 (tptp.app tptp.sk5 tptp.sk6))) :rule trans :premises (t96.t2.t6 t96.t2.t8))
% 1.06/1.26 (step t96.t2.t10 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.06/1.26 (step t96.t2.t11 (cl (= (tptp.app tptp.sk2 tptp.nil) (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule cong :premises (t96.t2.t9 t96.t2.t10))
% 1.06/1.26 (step t96.t2.t12 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule trans :premises (t96.t2.t4 t96.t2.t11))
% 1.06/1.26 (step t96.t2.t13 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 1.06/1.26 (step t96.t2.t14 (cl (= (tptp.segmentP tptp.sk2 tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule cong :premises (t96.t2.t12 t96.t2.t13))
% 1.06/1.26 (step t96.t2.t15 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) true) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule equiv_simplify)
% 1.06/1.26 (step t96.t2.t16 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule equiv2 :premises (t96.t2.t15))
% 1.06/1.26 (step t96.t2.t17 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) true)) :rule resolution :premises (t96.t2.t16 t96.t2.a0))
% 1.06/1.26 (step t96.t2.t18 (cl (= (tptp.segmentP tptp.sk2 tptp.sk6) true)) :rule trans :premises (t96.t2.t14 t96.t2.t17))
% 1.06/1.26 (step t96.t2.t19 (cl (tptp.segmentP tptp.sk2 tptp.sk6)) :rule resolution :premises (t96.t2.t2 t96.t2.t18))
% 1.06/1.26 (step t96.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule subproof :discharge (t96.t2.a0 t96.t2.a1 t96.t2.a2 t96.t2.a3))
% 1.06/1.26 (step t96.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) :rule and_pos)
% 1.06/1.26 (step t96.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t96.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.06/1.26 (step t96.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule and_pos)
% 1.06/1.26 (step t96.t7 (cl (tptp.segmentP tptp.sk2 tptp.sk6) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule resolution :premises (t96.t2 t96.t3 t96.t4 t96.t5 t96.t6))
% 1.06/1.26 (step t96.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule reordering :premises (t96.t7))
% 1.06/1.26 (step t96.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule contraction :premises (t96.t8))
% 1.06/1.26 (step t96.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule resolution :premises (t96.t1 t96.t9))
% 1.06/1.26 (step t96.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk2 tptp.sk6))) :rule implies_neg2)
% 1.06/1.26 (step t96.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6))) :rule resolution :premises (t96.t10 t96.t11))
% 1.06/1.26 (step t96.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.segmentP tptp.sk2 tptp.sk6))) :rule contraction :premises (t96.t12))
% 1.06/1.26 (step t96.t14 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule implies :premises (t96.t13))
% 1.06/1.26 (step t96.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule and_neg)
% 1.06/1.26 (step t96.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule resolution :premises (t96.t15 t96.a3 t96.a1 t96.a0 t96.a2))
% 1.06/1.26 (step t96.t17 (cl (tptp.segmentP tptp.sk2 tptp.sk6)) :rule resolution :premises (t96.t14 t96.t16))
% 1.06/1.26 (step t96 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule subproof :discharge (t96.a0 t96.a1 t96.a2 t96.a3))
% 1.06/1.26 (step t97 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.06/1.26 (step t98 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t99 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule and_pos)
% 1.06/1.26 (step t100 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) :rule and_pos)
% 1.06/1.26 (step t101 (cl (tptp.segmentP tptp.sk2 tptp.sk6) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)))) :rule resolution :premises (t96 t97 t98 t99 t100))
% 1.06/1.26 (step t102 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule reordering :premises (t101))
% 1.06/1.26 (step t103 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule contraction :premises (t102))
% 1.06/1.26 (step t104 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule resolution :premises (t95 t103))
% 1.06/1.26 (step t105 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk2 tptp.sk6))) :rule implies_neg2)
% 1.06/1.26 (step t106 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6))) :rule resolution :premises (t104 t105))
% 1.06/1.26 (step t107 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6))) :rule contraction :premises (t106))
% 1.06/1.26 (step t108 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule implies :premises (t107))
% 1.06/1.26 (step t109 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk2 tptp.sk6)) :rule resolution :premises (t94 t108))
% 1.06/1.26 (step t110 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.segmentP tptp.sk2 tptp.sk6) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule reordering :premises (t109))
% 1.06/1.26 (step t111 (cl (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule symm :premises (a195))
% 1.06/1.26 (step t112 (cl (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule or_pos)
% 1.06/1.26 (step t113 (cl (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule reordering :premises (t112))
% 1.06/1.26 (step t114 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t115)
% 1.06/1.26 (assume t115.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 1.06/1.26 (step t115.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk2)))
% 1.06/1.26 (step t115.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule or :premises (t115.t1))
% 1.06/1.26 (step t115.t3 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule resolution :premises (t115.t2 t115.a0))
% 1.06/1.26 (step t115 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule subproof :discharge (t115.a0))
% 1.06/1.26 (step t116 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule resolution :premises (t114 t115))
% 1.06/1.26 (step t117 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule implies_neg2)
% 1.06/1.26 (step t118 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule resolution :premises (t116 t117))
% 1.06/1.26 (step t119 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule contraction :premises (t118))
% 1.06/1.26 (step t120 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule implies :premises (t119))
% 1.06/1.26 (step t121 (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)
% 1.06/1.26 (anchor :step t122 :args ((U $$unsorted) (:= U U)))
% 1.06/1.26 (step t122.t1 (cl (= U U)) :rule refl)
% 1.06/1.26 (step t122.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.06/1.26 (step t122.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 1.06/1.26 (step t122.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 (t122.t2 t122.t3))
% 1.06/1.26 (step t122 (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)
% 1.06/1.26 (step t123 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t121 t122 a72))
% 1.06/1.26 (step t124 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule resolution :premises (t120 t123))
% 1.06/1.26 (step t125 (cl (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule resolution :premises (t113 a186 t124))
% 1.06/1.26 (step t126 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) :rule or_pos)
% 1.06/1.26 (step t127 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)))) :rule reordering :premises (t126))
% 1.06/1.26 (step t128 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule and_neg)
% 1.06/1.26 (step t129 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t130)
% 1.06/1.26 (assume t130.a0 (tptp.ssList tptp.sk2))
% 1.06/1.26 (assume t130.a1 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume t130.a2 (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))
% 1.06/1.26 (assume t130.a3 (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))
% 1.06/1.26 (step t130.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t130.t2)
% 1.06/1.26 (assume t130.t2.a0 (tptp.ssList tptp.sk2))
% 1.06/1.26 (assume t130.t2.a1 (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))
% 1.06/1.26 (assume t130.t2.a2 (= tptp.sk2 tptp.sk4))
% 1.06/1.26 (assume t130.t2.a3 (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))
% 1.06/1.26 (step t130.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)) true) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule equiv_simplify)
% 1.06/1.26 (step t130.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)) true)) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule equiv1 :premises (t130.t2.t1))
% 1.06/1.26 (step t130.t2.t3 (cl (= (tptp.app tptp.sk5 tptp.sk6) tptp.sk4)) :rule symm :premises (t130.t2.a3))
% 1.06/1.26 (step t130.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t130.t2.a2))
% 1.06/1.26 (step t130.t2.t5 (cl (= (tptp.app tptp.sk5 tptp.sk6) tptp.sk2)) :rule trans :premises (t130.t2.t3 t130.t2.t4))
% 1.06/1.26 (step t130.t2.t6 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.06/1.26 (step t130.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) (tptp.app tptp.sk2 tptp.nil))) :rule cong :premises (t130.t2.t5 t130.t2.t6))
% 1.06/1.26 (step t130.t2.t8 (cl (= (tptp.app tptp.sk2 tptp.nil) tptp.sk2)) :rule symm :premises (t130.t2.a1))
% 1.06/1.26 (step t130.t2.t9 (cl (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule symm :premises (t130.t2.t8))
% 1.06/1.26 (step t130.t2.t10 (cl (= (tptp.app tptp.sk2 tptp.nil) tptp.sk2)) :rule symm :premises (t130.t2.t9))
% 1.06/1.26 (step t130.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk2)) :rule trans :premises (t130.t2.t7 t130.t2.t10))
% 1.06/1.26 (step t130.t2.t12 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)) (tptp.ssList tptp.sk2))) :rule cong :premises (t130.t2.t11))
% 1.06/1.26 (step t130.t2.t13 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 1.06/1.26 (step t130.t2.t14 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t130.t2.t13))
% 1.06/1.26 (step t130.t2.t15 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t130.t2.t14 t130.t2.a0))
% 1.06/1.26 (step t130.t2.t16 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)) true)) :rule trans :premises (t130.t2.t12 t130.t2.t15))
% 1.06/1.26 (step t130.t2.t17 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule resolution :premises (t130.t2.t2 t130.t2.t16))
% 1.06/1.26 (step t130.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule subproof :discharge (t130.t2.a0 t130.t2.a1 t130.t2.a2 t130.t2.a3))
% 1.06/1.26 (step t130.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 1.06/1.26 (step t130.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule and_pos)
% 1.06/1.26 (step t130.t5 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.06/1.26 (step t130.t6 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t130.t7 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))))) :rule resolution :premises (t130.t2 t130.t3 t130.t4 t130.t5 t130.t6))
% 1.06/1.26 (step t130.t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule reordering :premises (t130.t7))
% 1.06/1.26 (step t130.t9 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule contraction :premises (t130.t8))
% 1.06/1.26 (step t130.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule resolution :premises (t130.t1 t130.t9))
% 1.06/1.26 (step t130.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule implies_neg2)
% 1.06/1.26 (step t130.t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule resolution :premises (t130.t10 t130.t11))
% 1.06/1.26 (step t130.t13 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule contraction :premises (t130.t12))
% 1.06/1.26 (step t130.t14 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule implies :premises (t130.t13))
% 1.06/1.26 (step t130.t15 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) :rule and_neg)
% 1.06/1.26 (step t130.t16 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)))) :rule resolution :premises (t130.t15 t130.a0 t130.a3 t130.a1 t130.a2))
% 1.06/1.26 (step t130.t17 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule resolution :premises (t130.t14 t130.t16))
% 1.06/1.26 (step t130 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule subproof :discharge (t130.a0 t130.a1 t130.a2 t130.a3))
% 1.06/1.26 (step t131 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 1.06/1.26 (step t132 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.06/1.26 (step t133 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t134 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) :rule and_pos)
% 1.06/1.26 (step t135 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))))) :rule resolution :premises (t130 t131 t132 t133 t134))
% 1.06/1.26 (step t136 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule reordering :premises (t135))
% 1.06/1.26 (step t137 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule contraction :premises (t136))
% 1.06/1.26 (step t138 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule resolution :premises (t129 t137))
% 1.06/1.26 (step t139 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule implies_neg2)
% 1.06/1.26 (step t140 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule resolution :premises (t138 t139))
% 1.06/1.26 (step t141 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil)))) :rule contraction :premises (t140))
% 1.06/1.26 (step t142 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6)) (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule implies :premises (t141))
% 1.06/1.26 (step t143 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) (not (= tptp.sk2 (tptp.app tptp.sk2 tptp.nil))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule resolution :premises (t128 t142))
% 1.06/1.26 (step t144 (cl (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule symm :premises (a195))
% 1.06/1.26 (step t145 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) :rule resolution :premises (t143 a186 a189 t144 t125))
% 1.06/1.26 (step t146 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (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)
% 1.06/1.26 (anchor :step t147)
% 1.06/1.26 (assume t147.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))))
% 1.06/1.26 (step t147.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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk6) (:= W tptp.nil)))
% 1.06/1.26 (step t147.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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule or :premises (t147.t1))
% 1.06/1.26 (step t147.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t147.t2 t147.a0))
% 1.06/1.26 (step t147 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule subproof :discharge (t147.a0))
% 1.06/1.26 (step t148 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t146 t147))
% 1.06/1.26 (step t149 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 1.06/1.26 (step t150 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) (=> (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)))) :rule resolution :premises (t148 t149))
% 1.06/1.26 (step t151 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)))) :rule contraction :premises (t150))
% 1.06/1.26 (step t152 (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.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule implies :premises (t151))
% 1.06/1.26 (step t153 (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)
% 1.06/1.26 (anchor :step t154 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 1.06/1.26 (step t154.t1 (cl (= U U)) :rule refl)
% 1.06/1.26 (step t154.t2 (cl (= V V)) :rule refl)
% 1.06/1.26 (step t154.t3 (cl (= W W)) :rule refl)
% 1.06/1.26 (step t154.t4 (cl (= X X)) :rule refl)
% 1.06/1.26 (step t154.t5 (cl (= (= (tptp.app (tptp.app U V) W) X) (= X (tptp.app (tptp.app U V) W)))) :rule all_simplify)
% 1.06/1.26 (step t154.t6 (cl (= (not (= (tptp.app (tptp.app U V) W) X)) (not (= X (tptp.app (tptp.app U V) W))))) :rule cong :premises (t154.t5))
% 1.06/1.26 (step t154.t7 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 1.06/1.26 (step t154.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.06/1.26 (step t154.t9 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.06/1.26 (step t154.t10 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 1.06/1.26 (step t154.t11 (cl (= (tptp.segmentP X V) (tptp.segmentP X V))) :rule refl)
% 1.06/1.26 (step t154.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 (t154.t6 t154.t7 t154.t8 t154.t9 t154.t10 t154.t11))
% 1.06/1.26 (step t154 (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)
% 1.06/1.26 (step t155 (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)
% 1.06/1.26 (anchor :step t156 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 1.06/1.26 (step t156.t1 (cl (= U U)) :rule refl)
% 1.06/1.26 (step t156.t2 (cl (= V V)) :rule refl)
% 1.06/1.26 (step t156.t3 (cl (= W W)) :rule refl)
% 1.06/1.26 (step t156.t4 (cl (= (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W)) true)) :rule all_simplify)
% 1.06/1.26 (step t156.t5 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not true))) :rule cong :premises (t156.t4))
% 1.06/1.26 (step t156.t6 (cl (= (not true) false)) :rule all_simplify)
% 1.06/1.26 (step t156.t7 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) false)) :rule trans :premises (t156.t5 t156.t6))
% 1.06/1.26 (step t156.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 1.06/1.26 (step t156.t9 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.06/1.26 (step t156.t10 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.06/1.26 (step t156.t11 (cl (= (not (tptp.ssList (tptp.app (tptp.app U V) W))) (not (tptp.ssList (tptp.app (tptp.app U V) W))))) :rule refl)
% 1.06/1.26 (step t156.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app U V) W) V) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) :rule refl)
% 1.06/1.26 (step t156.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 (t156.t7 t156.t8 t156.t9 t156.t10 t156.t11 t156.t12))
% 1.06/1.26 (step t156.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)
% 1.06/1.26 (step t156.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 (t156.t13 t156.t14))
% 1.06/1.26 (step t156 (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)
% 1.06/1.26 (step t157 (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 (t155 t156))
% 1.06/1.26 (step t158 (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 (t154 t157))
% 1.06/1.26 (step t159 (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 (t153 t158 a172))
% 1.06/1.26 (step t160 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t152 t159))
% 1.06/1.26 (step t161 (cl (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk6) tptp.nil) tptp.sk6)) :rule resolution :premises (t127 a7 a193 a194 t145 t160))
% 1.06/1.26 (step t162 (cl (tptp.segmentP tptp.sk2 tptp.sk6)) :rule resolution :premises (t110 a189 t111 t125 t161))
% 1.06/1.26 (step t163 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule and_neg)
% 1.06/1.26 (step t164 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t165)
% 1.06/1.26 (assume t165.a0 (= tptp.sk1 tptp.sk3))
% 1.06/1.26 (assume t165.a1 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)))
% 1.06/1.26 (assume t165.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 1.06/1.26 (assume t165.a3 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))
% 1.06/1.26 (step t165.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 1.06/1.26 (anchor :step t165.t2)
% 1.06/1.26 (assume t165.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))
% 1.06/1.26 (assume t165.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 1.06/1.26 (assume t165.t2.a2 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)))
% 1.06/1.26 (assume t165.t2.a3 (= tptp.sk1 tptp.sk3))
% 1.06/1.26 (step t165.t2.t1 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk6) true) (tptp.segmentP tptp.sk1 tptp.sk6))) :rule equiv_simplify)
% 1.06/1.26 (step t165.t2.t2 (cl (not (= (tptp.segmentP tptp.sk1 tptp.sk6) true)) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule equiv1 :premises (t165.t2.t1))
% 1.06/1.26 (step t165.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t165.t2.a3))
% 1.06/1.26 (step t165.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t165.t2.t3))
% 1.06/1.26 (step t165.t2.t5 (cl (= (tptp.app tptp.sk6 tptp.sk5) tptp.sk3)) :rule symm :premises (t165.t2.a2))
% 1.06/1.26 (step t165.t2.t6 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule symm :premises (t165.t2.t5))
% 1.06/1.26 (step t165.t2.t7 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t165.t2.a1))
% 1.06/1.26 (step t165.t2.t8 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t165.t2.t7))
% 1.06/1.26 (step t165.t2.t9 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 1.06/1.26 (step t165.t2.t10 (cl (= (tptp.app tptp.sk6 tptp.sk5) (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule cong :premises (t165.t2.t8 t165.t2.t9))
% 1.06/1.26 (step t165.t2.t11 (cl (= tptp.sk1 (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule trans :premises (t165.t2.t4 t165.t2.t6 t165.t2.t10))
% 1.06/1.26 (step t165.t2.t12 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 1.06/1.26 (step t165.t2.t13 (cl (= (tptp.segmentP tptp.sk1 tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule cong :premises (t165.t2.t11 t165.t2.t12))
% 1.06/1.26 (step t165.t2.t14 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule equiv_simplify)
% 1.06/1.26 (step t165.t2.t15 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule equiv2 :premises (t165.t2.t14))
% 1.06/1.26 (step t165.t2.t16 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) true)) :rule resolution :premises (t165.t2.t15 t165.t2.a0))
% 1.06/1.26 (step t165.t2.t17 (cl (= (tptp.segmentP tptp.sk1 tptp.sk6) true)) :rule trans :premises (t165.t2.t13 t165.t2.t16))
% 1.06/1.26 (step t165.t2.t18 (cl (tptp.segmentP tptp.sk1 tptp.sk6)) :rule resolution :premises (t165.t2.t2 t165.t2.t17))
% 1.06/1.26 (step t165.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule subproof :discharge (t165.t2.a0 t165.t2.a1 t165.t2.a2 t165.t2.a3))
% 1.06/1.26 (step t165.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) :rule and_pos)
% 1.06/1.26 (step t165.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t165.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule and_pos)
% 1.06/1.26 (step t165.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.06/1.26 (step t165.t7 (cl (tptp.segmentP tptp.sk1 tptp.sk6) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t165.t2 t165.t3 t165.t4 t165.t5 t165.t6))
% 1.06/1.26 (step t165.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule reordering :premises (t165.t7))
% 1.06/1.26 (step t165.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule contraction :premises (t165.t8))
% 1.06/1.26 (step t165.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule resolution :premises (t165.t1 t165.t9))
% 1.06/1.26 (step t165.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))) :rule implies_neg2)
% 1.06/1.26 (step t165.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6))) :rule resolution :premises (t165.t10 t165.t11))
% 1.06/1.26 (step t165.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk6))) :rule contraction :premises (t165.t12))
% 1.06/1.26 (step t165.t14 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule implies :premises (t165.t13))
% 1.06/1.26 (step t165.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 1.06/1.26 (step t165.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t165.t15 t165.a3 t165.a2 t165.a1 t165.a0))
% 1.06/1.26 (step t165.t17 (cl (tptp.segmentP tptp.sk1 tptp.sk6)) :rule resolution :premises (t165.t14 t165.t16))
% 1.06/1.26 (step t165 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule subproof :discharge (t165.a0 t165.a1 t165.a2 t165.a3))
% 1.06/1.26 (step t166 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.06/1.26 (step t167 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule and_pos)
% 1.06/1.26 (step t168 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 1.06/1.26 (step t169 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) :rule and_pos)
% 1.06/1.26 (step t170 (cl (tptp.segmentP tptp.sk1 tptp.sk6) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)))) :rule resolution :premises (t165 t166 t167 t168 t169))
% 1.06/1.26 (step t171 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule reordering :premises (t170))
% 1.06/1.26 (step t172 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule contraction :premises (t171))
% 1.06/1.26 (step t173 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule resolution :premises (t164 t172))
% 1.06/1.26 (step t174 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))) :rule implies_neg2)
% 1.06/1.26 (step t175 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6))) :rule resolution :premises (t173 t174))
% 1.06/1.26 (step t176 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6))) :rule contraction :premises (t175))
% 1.06/1.26 (step t177 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule implies :premises (t176))
% 1.06/1.26 (step t178 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) (tptp.segmentP tptp.sk1 tptp.sk6)) :rule resolution :premises (t163 t177))
% 1.06/1.26 (step t179 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (tptp.segmentP tptp.sk1 tptp.sk6) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule reordering :premises (t178))
% 1.06/1.26 (step t180 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule symm :premises (a196))
% 1.06/1.26 (step t181 (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)
% 1.06/1.26 (step t182 (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 (t181))
% 1.06/1.26 (step t183 (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)
% 1.06/1.26 (anchor :step t184)
% 1.06/1.26 (assume t184.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 1.06/1.26 (step t184.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)))
% 1.06/1.26 (step t184.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 (t184.t1))
% 1.06/1.26 (step t184.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t184.t2 t184.a0))
% 1.06/1.26 (step t184 (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 (t184.a0))
% 1.06/1.26 (step t185 (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 (t183 t184))
% 1.06/1.26 (step t186 (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)
% 1.06/1.26 (step t187 (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 (t185 t186))
% 1.06/1.26 (step t188 (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 (t187))
% 1.06/1.26 (step t189 (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 (t188))
% 1.06/1.26 (step t190 (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)
% 1.06/1.27 (anchor :step t191 :args ((U $$unsorted) (:= U U)))
% 1.06/1.27 (step t191.t1 (cl (= U U)) :rule refl)
% 1.06/1.27 (step t191.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.06/1.27 (step t191.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 1.06/1.27 (step t191.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 (t191.t2 t191.t3))
% 1.06/1.27 (step t191 (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)
% 1.06/1.27 (step t192 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t190 t191 a73))
% 1.06/1.27 (step t193 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t189 t192))
% 1.06/1.27 (step t194 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule resolution :premises (t182 a194 t193))
% 1.06/1.27 (step t195 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) :rule or_pos)
% 1.06/1.27 (step t196 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)))) :rule reordering :premises (t195))
% 1.06/1.27 (step t197 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 1.06/1.27 (step t198 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 1.06/1.27 (anchor :step t199)
% 1.06/1.27 (assume t199.a0 (tptp.ssList tptp.sk1))
% 1.06/1.27 (assume t199.a1 (= tptp.sk1 tptp.sk3))
% 1.06/1.27 (assume t199.a2 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)))
% 1.06/1.27 (assume t199.a3 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 1.06/1.27 (step t199.t1 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 1.06/1.27 (anchor :step t199.t2)
% 1.06/1.27 (assume t199.t2.a0 (tptp.ssList tptp.sk1))
% 1.06/1.27 (assume t199.t2.a1 (= tptp.sk1 tptp.sk3))
% 1.06/1.27 (assume t199.t2.a2 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)))
% 1.06/1.27 (assume t199.t2.a3 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 1.06/1.27 (step t199.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)) true) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule equiv_simplify)
% 1.06/1.27 (step t199.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)) true)) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule equiv1 :premises (t199.t2.t1))
% 1.06/1.27 (step t199.t2.t3 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t199.t2.a3))
% 1.06/1.27 (step t199.t2.t4 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 1.06/1.27 (step t199.t2.t5 (cl (= (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) (tptp.app tptp.sk6 tptp.sk5))) :rule cong :premises (t199.t2.t3 t199.t2.t4))
% 1.06/1.27 (step t199.t2.t6 (cl (= (tptp.app tptp.sk6 tptp.sk5) tptp.sk3)) :rule symm :premises (t199.t2.a2))
% 1.06/1.27 (step t199.t2.t7 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule symm :premises (t199.t2.t6))
% 1.06/1.27 (step t199.t2.t8 (cl (= (tptp.app tptp.sk6 tptp.sk5) tptp.sk3)) :rule symm :premises (t199.t2.t7))
% 1.06/1.27 (step t199.t2.t9 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t199.t2.a1))
% 1.06/1.27 (step t199.t2.t10 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t199.t2.t9))
% 1.06/1.27 (step t199.t2.t11 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t199.t2.t10))
% 1.06/1.27 (step t199.t2.t12 (cl (= (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk1)) :rule trans :premises (t199.t2.t5 t199.t2.t8 t199.t2.t11))
% 1.06/1.27 (step t199.t2.t13 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)) (tptp.ssList tptp.sk1))) :rule cong :premises (t199.t2.t12))
% 1.06/1.27 (step t199.t2.t14 (cl (= (= (tptp.ssList tptp.sk1) true) (tptp.ssList tptp.sk1))) :rule equiv_simplify)
% 1.06/1.27 (step t199.t2.t15 (cl (= (tptp.ssList tptp.sk1) true) (not (tptp.ssList tptp.sk1))) :rule equiv2 :premises (t199.t2.t14))
% 1.06/1.27 (step t199.t2.t16 (cl (= (tptp.ssList tptp.sk1) true)) :rule resolution :premises (t199.t2.t15 t199.t2.a0))
% 1.06/1.27 (step t199.t2.t17 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)) true)) :rule trans :premises (t199.t2.t13 t199.t2.t16))
% 1.06/1.27 (step t199.t2.t18 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule resolution :premises (t199.t2.t2 t199.t2.t17))
% 1.06/1.27 (step t199.t2 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule subproof :discharge (t199.t2.a0 t199.t2.a1 t199.t2.a2 t199.t2.a3))
% 1.06/1.27 (step t199.t3 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList tptp.sk1)) :rule and_pos)
% 1.06/1.27 (step t199.t4 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.06/1.27 (step t199.t5 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule and_pos)
% 1.06/1.27 (step t199.t6 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 1.06/1.27 (step t199.t7 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t199.t2 t199.t3 t199.t4 t199.t5 t199.t6))
% 1.06/1.27 (step t199.t8 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule reordering :premises (t199.t7))
% 1.06/1.27 (step t199.t9 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule contraction :premises (t199.t8))
% 1.06/1.27 (step t199.t10 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule resolution :premises (t199.t1 t199.t9))
% 1.06/1.27 (step t199.t11 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule implies_neg2)
% 1.06/1.27 (step t199.t12 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule resolution :premises (t199.t10 t199.t11))
% 1.06/1.27 (step t199.t13 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule contraction :premises (t199.t12))
% 1.06/1.27 (step t199.t14 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule implies :premises (t199.t13))
% 1.06/1.27 (step t199.t15 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 1.06/1.27 (step t199.t16 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t199.t15 t199.a0 t199.a1 t199.a2 t199.a3))
% 1.06/1.27 (step t199.t17 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule resolution :premises (t199.t14 t199.t16))
% 1.06/1.27 (step t199 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule subproof :discharge (t199.a0 t199.a1 t199.a2 t199.a3))
% 1.06/1.27 (step t200 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList tptp.sk1)) :rule and_pos)
% 1.06/1.27 (step t201 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.06/1.27 (step t202 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule and_pos)
% 1.06/1.27 (step t203 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 1.06/1.27 (step t204 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t199 t200 t201 t202 t203))
% 1.06/1.27 (step t205 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule reordering :premises (t204))
% 1.06/1.27 (step t206 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule contraction :premises (t205))
% 1.06/1.27 (step t207 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule resolution :premises (t198 t206))
% 1.06/1.27 (step t208 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule implies_neg2)
% 1.06/1.27 (step t209 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule resolution :premises (t207 t208))
% 1.06/1.27 (step t210 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5)))) :rule contraction :premises (t209))
% 1.06/1.27 (step t211 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule implies :premises (t210))
% 1.06/1.27 (step t212 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule resolution :premises (t197 t211))
% 1.06/1.27 (step t213 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule symm :premises (a196))
% 1.06/1.27 (step t214 (cl (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) :rule resolution :premises (t212 a185 a190 t213 t194))
% 1.06/1.27 (step t215 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (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)
% 1.06/1.27 (anchor :step t216)
% 1.06/1.27 (assume t216.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))))
% 1.06/1.27 (step t216.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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk6) (:= W tptp.sk5)))
% 1.06/1.27 (step t216.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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule or :premises (t216.t1))
% 1.06/1.27 (step t216.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule resolution :premises (t216.t2 t216.a0))
% 1.06/1.27 (step t216 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule subproof :discharge (t216.a0))
% 1.06/1.27 (step t217 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule resolution :premises (t215 t216))
% 1.06/1.27 (step t218 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)))) :rule implies_neg2)
% 1.06/1.27 (step t219 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) (=> (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)))) :rule resolution :premises (t217 t218))
% 1.06/1.27 (step t220 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)))) :rule contraction :premises (t219))
% 1.06/1.27 (step t221 (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.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule implies :premises (t220))
% 1.06/1.27 (step t222 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6))) :rule resolution :premises (t221 t159))
% 1.06/1.27 (step t223 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) tptp.sk5) tptp.sk6)) :rule resolution :premises (t196 a7 a193 a194 t214 t222))
% 1.06/1.27 (step t224 (cl (tptp.segmentP tptp.sk1 tptp.sk6)) :rule resolution :premises (t179 a190 t180 t194 t223))
% 1.06/1.27 (step t225 (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) (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 implies_neg1)
% 1.06/1.27 (anchor :step t226)
% 1.06/1.27 (assume t226.a0 (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)))))
% 1.06/1.27 (step t226.t1 (cl (or (not (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 (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6)))
% 1.06/1.27 (step t226.t2 (cl (not (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 (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) :rule or :premises (t226.t1))
% 1.06/1.27 (step t226.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) :rule resolution :premises (t226.t2 t226.a0))
% 1.06/1.27 (step t226 (cl (not (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 (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) :rule subproof :discharge (t226.a0))
% 1.06/1.27 (step t227 (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) :rule resolution :premises (t225 t226))
% 1.06/1.27 (step t228 (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))))) :rule implies_neg2)
% 1.06/1.27 (step t229 (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) (=> (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 (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))))) :rule resolution :premises (t227 t228))
% 1.06/1.27 (step t230 (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6))))) :rule contraction :premises (t229))
% 1.06/1.27 (step t231 (cl (not (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 (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) :rule implies :premises (t230))
% 1.06/1.27 (step t232 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk6)) (not (tptp.segmentP tptp.sk1 tptp.sk6)))) :rule resolution :premises (t231 a192))
% 1.06/1.27 (step t233 (cl (not (tptp.neq tptp.sk6 tptp.nil))) :rule resolution :premises (t93 a194 t162 t224 t232))
% 1.06/1.27 (step t234 (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)
% 1.06/1.27 (anchor :step t235)
% 1.06/1.27 (assume t235.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 1.06/1.27 (step t235.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)))
% 1.06/1.27 (step t235.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 (t235.t1))
% 1.06/1.27 (step t235.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 (t235.t2 t235.a0))
% 1.06/1.27 (step t235 (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 (t235.a0))
% 1.06/1.27 (step t236 (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 (t234 t235))
% 1.06/1.27 (step t237 (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)
% 1.06/1.27 (step t238 (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 (t236 t237))
% 1.06/1.27 (step t239 (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 (t238))
% 1.06/1.27 (step t240 (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 (t239))
% 1.06/1.27 (step t241 (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)
% 1.06/1.27 (anchor :step t242 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.06/1.27 (step t242.t1 (cl (= U U)) :rule refl)
% 1.06/1.27 (step t242.t2 (cl (= V V)) :rule refl)
% 1.06/1.27 (step t242.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.06/1.27 (step t242.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.06/1.27 (step t242.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 1.06/1.27 (step t242.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 1.06/1.27 (step t242.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 (t242.t3 t242.t4 t242.t5 t242.t6))
% 1.06/1.27 (step t242 (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)
% 1.06/1.27 (step t243 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t241 t242 a99))
% 1.06/1.27 (step t244 (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 (t240 t243))
% 1.06/1.27 (step t245 (cl (= tptp.nil tptp.sk6)) :rule resolution :premises (t91 a7 a194 t233 t244))
% 1.06/1.27 (step t246 (cl (not (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2))) :rule or_pos)
% 1.06/1.27 (step t247 (cl (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)) (not (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule reordering :premises (t246))
% 1.06/1.27 (step t248 (cl (not (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2)) :rule or_pos)
% 1.06/1.27 (step t249 (cl (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2) (not (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2)))) :rule reordering :premises (t248))
% 1.06/1.27 (step t250 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 1.06/1.27 (anchor :step t251)
% 1.06/1.27 (assume t251.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.06/1.27 (step t251.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 1.06/1.27 (step t251.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) :rule or :premises (t251.t1))
% 1.06/1.27 (step t251.t3 (cl (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) :rule resolution :premises (t251.t2 t251.a0))
% 1.06/1.27 (step t251 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) :rule subproof :discharge (t251.a0))
% 1.06/1.27 (step t252 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) :rule resolution :premises (t250 t251))
% 1.06/1.27 (step t253 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2)))) :rule implies_neg2)
% 1.06/1.27 (step t254 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2)))) :rule resolution :premises (t252 t253))
% 1.06/1.27 (step t255 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2)))) :rule contraction :premises (t254))
% 1.06/1.27 (step t256 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) :rule implies :premises (t255))
% 1.06/1.27 (step t257 (cl (or (not (tptp.ssList tptp.sk2)) (tptp.segmentP tptp.sk2 tptp.sk2))) :rule resolution :premises (t256 a56))
% 1.06/1.27 (step t258 (cl (tptp.segmentP tptp.sk2 tptp.sk2)) :rule resolution :premises (t249 a186 t257))
% 1.06/1.27 (step t259 (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)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 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 implies_neg1)
% 1.06/1.27 (anchor :step t260)
% 1.06/1.27 (assume t260.a0 (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)))))
% 1.06/1.27 (step t260.t1 (cl (or (not (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 (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk2)))
% 1.06/1.27 (step t260.t2 (cl (not (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 (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule or :premises (t260.t1))
% 1.06/1.27 (step t260.t3 (cl (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule resolution :premises (t260.t2 t260.a0))
% 1.06/1.27 (step t260 (cl (not (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 (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t260.a0))
% 1.06/1.27 (step t261 (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)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule resolution :premises (t259 t260))
% 1.06/1.27 (step t262 (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)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) (not (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 1.06/1.27 (step t263 (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)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 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 (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule resolution :premises (t261 t262))
% 1.06/1.27 (step t264 (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)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2))))) :rule contraction :premises (t263))
% 1.06/1.27 (step t265 (cl (not (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 (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule implies :premises (t264))
% 1.06/1.27 (step t266 (cl (or (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk2)) (not (tptp.segmentP tptp.sk1 tptp.sk2)))) :rule resolution :premises (t265 a192))
% 1.06/1.27 (step t267 (cl (not (tptp.segmentP tptp.sk1 tptp.sk2))) :rule resolution :premises (t247 a186 a191 t258 t266))
% 1.06/1.27 (step t268 (cl (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) :rule or_pos)
% 1.06/1.27 (step t269 (cl (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule reordering :premises (t268))
% 1.06/1.27 (step t270 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 1.06/1.27 (anchor :step t271)
% 1.06/1.27 (assume t271.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 1.06/1.27 (step t271.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule forall_inst :args ((:= U tptp.sk5)))
% 1.06/1.27 (step t271.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) :rule or :premises (t271.t1))
% 1.06/1.27 (step t271.t3 (cl (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) :rule resolution :premises (t271.t2 t271.a0))
% 1.06/1.27 (step t271 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) :rule subproof :discharge (t271.a0))
% 1.06/1.27 (step t272 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) :rule resolution :premises (t270 t271))
% 1.06/1.27 (step t273 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule implies_neg2)
% 1.06/1.27 (step t274 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule resolution :premises (t272 t273))
% 1.06/1.27 (step t275 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))))) :rule contraction :premises (t274))
% 1.06/1.27 (step t276 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) :rule implies :premises (t275))
% 1.06/1.27 (step t277 (cl (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.nil tptp.sk5)))) :rule resolution :premises (t276 t192))
% 1.06/1.27 (step t278 (cl (= tptp.sk5 (tptp.app tptp.nil tptp.sk5))) :rule resolution :premises (t269 a193 t277))
% 1.06/1.27 (step t279 (cl (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) :rule or_pos)
% 1.06/1.27 (step t280 (cl (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)) (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule reordering :premises (t279))
% 1.06/1.27 (step t281 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 1.06/1.27 (anchor :step t282)
% 1.06/1.27 (assume t282.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 1.06/1.27 (step t282.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5)))
% 1.06/1.27 (step t282.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) :rule or :premises (t282.t1))
% 1.06/1.27 (step t282.t3 (cl (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) :rule resolution :premises (t282.t2 t282.a0))
% 1.06/1.27 (step t282 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) :rule subproof :discharge (t282.a0))
% 1.06/1.27 (step t283 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) :rule resolution :premises (t281 t282))
% 1.06/1.27 (step t284 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.06/1.27 (step t285 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule resolution :premises (t283 t284))
% 1.06/1.27 (step t286 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))))) :rule contraction :premises (t285))
% 1.06/1.27 (step t287 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) :rule implies :premises (t286))
% 1.06/1.27 (step t288 (cl (or (not (tptp.ssList tptp.sk5)) (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil)))) :rule resolution :premises (t287 t123))
% 1.06/1.27 (step t289 (cl (= tptp.sk5 (tptp.app tptp.sk5 tptp.nil))) :rule resolution :premises (t280 a193 t288))
% 1.06/1.27 (step t290 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule or_pos)
% 1.06/1.27 (step t291 (cl (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule reordering :premises (t290))
% 1.06/1.27 (step t292 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 1.06/1.27 (anchor :step t293)
% 1.06/1.27 (assume t293.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.06/1.27 (step t293.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.06/1.27 (step t293.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule or :premises (t293.t1))
% 1.06/1.27 (step t293.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t293.t2 t293.a0))
% 1.06/1.27 (step t293 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t293.a0))
% 1.06/1.27 (step t294 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t292 t293))
% 1.06/1.27 (step t295 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 1.06/1.27 (step t296 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t294 t295))
% 1.06/1.27 (step t297 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t296))
% 1.06/1.27 (step t298 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule implies :premises (t297))
% 1.06/1.27 (step t299 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t298 a56))
% 1.06/1.27 (step t300 (cl (tptp.segmentP tptp.sk1 tptp.sk1)) :rule resolution :premises (t291 a185 t299))
% 1.06/1.27 (step t301 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk5))) :rule symm :premises (a196))
% 1.06/1.27 (step t302 (cl (= tptp.sk4 (tptp.app tptp.sk5 tptp.sk6))) :rule symm :premises (a195))
% 1.06/1.27 (step t303 (cl) :rule resolution :premises (t89 t245 t267 t194 t278 t289 t300 t301 t302 a190 a189))
% 1.06/1.27
% 1.06/1.27 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.0GfcwEzO8N/cvc5---1.0.5_3601.smt2
% 1.06/1.27 % cvc5---1.0.5 exiting
% 1.06/1.27 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------