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