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