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