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