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