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