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