TSTP Solution File: SWC001-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC001-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 17:59:48 EDT 2024
% Result : Unsatisfiable 0.71s 0.89s
% Output : Proof 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC001-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.15 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 26 14:46:39 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.71/0.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.oi6ilNtV7j/cvc5---1.0.5_24076.smt2
% 0.71/0.89 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.oi6ilNtV7j/cvc5---1.0.5_24076.smt2
% 0.71/0.90 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.71/0.90 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.71/0.90 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.71/0.90 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.71/0.90 (assume a4 (tptp.strictorderP tptp.nil))
% 0.71/0.90 (assume a5 (tptp.totalorderP tptp.nil))
% 0.71/0.90 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.71/0.90 (assume a7 (tptp.ssList tptp.nil))
% 0.71/0.90 (assume a8 (tptp.ssItem tptp.skac3))
% 0.71/0.90 (assume a9 (tptp.ssItem tptp.skac2))
% 0.71/0.90 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.71/0.90 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.71/0.90 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.71/0.90 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.71/0.90 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.71/0.90 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.71/0.90 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.71/0.90 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.71/0.90 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.71/0.90 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.71/0.90 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.71/0.90 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.71/0.90 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.71/0.90 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.71/0.90 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.71/0.90 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.71/0.90 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.71/0.90 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.71/0.90 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.71/0.90 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.71/0.90 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.71/0.90 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.71/0.90 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.71/0.90 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.71/0.90 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.71/0.90 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.71/0.90 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.71/0.90 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.71/0.90 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.71/0.90 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.71/0.90 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.71/0.90 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.71/0.90 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.71/0.90 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.71/0.90 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.71/0.90 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.71/0.90 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.71/0.90 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.71/0.90 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.71/0.90 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.71/0.90 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.71/0.90 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.71/0.90 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.71/0.90 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.71/0.90 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.71/0.90 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.71/0.90 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.71/0.90 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.71/0.90 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.71/0.90 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.71/0.90 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.71/0.90 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.71/0.90 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.71/0.90 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.71/0.90 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.71/0.91 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.71/0.91 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.71/0.91 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.71/0.91 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.71/0.91 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.71/0.91 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.71/0.91 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.71/0.91 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.71/0.91 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.71/0.91 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.71/0.91 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.71/0.91 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.71/0.91 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.71/0.91 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.71/0.91 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.71/0.91 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.71/0.91 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.71/0.91 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.71/0.91 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.71/0.91 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.71/0.91 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.71/0.91 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.71/0.91 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.71/0.91 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.71/0.91 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.71/0.91 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.71/0.91 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.71/0.91 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.71/0.91 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.71/0.91 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.71/0.91 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.71/0.91 (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.71/0.91 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (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.71/0.91 (assume a185 (tptp.ssList tptp.sk1))
% 0.71/0.91 (assume a186 (tptp.ssList tptp.sk2))
% 0.71/0.91 (assume a187 (tptp.ssList tptp.sk3))
% 0.71/0.91 (assume a188 (tptp.ssList tptp.sk4))
% 0.71/0.91 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.71/0.91 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (assume a191 (tptp.duplicatefreeP tptp.sk3))
% 0.71/0.91 (assume a192 (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))))
% 0.71/0.91 (assume a193 (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))))
% 0.71/0.91 (assume a194 (or (tptp.ssItem tptp.sk5) (not (tptp.duplicatefreeP tptp.sk1))))
% 0.71/0.91 (assume a195 (or (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5) (not (tptp.duplicatefreeP tptp.sk1))))
% 0.71/0.91 (assume a196 (or (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.duplicatefreeP tptp.sk1))))
% 0.71/0.91 (step t1 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A))))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t2)
% 0.71/0.91 (assume t2.a0 (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))))
% 0.71/0.91 (step t2.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5)))
% 0.71/0.91 (step t2.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule or :premises (t2.t1))
% 0.71/0.91 (step t2.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.71/0.91 (step t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule subproof :discharge (t2.a0))
% 0.71/0.91 (step t3 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t1 t2))
% 0.71/0.91 (step t4 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule implies_neg2)
% 0.71/0.91 (step t5 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t3 t4))
% 0.71/0.91 (step t6 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule contraction :premises (t5))
% 0.71/0.91 (step t7 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk4 A) (not (tptp.memberP tptp.sk3 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) :rule implies :premises (t6))
% 0.71/0.91 (step t8 (cl (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule or_pos)
% 0.71/0.91 (step t9 (cl (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule reordering :premises (t8))
% 0.71/0.91 (step t10 (cl (tptp.ssItem tptp.sk5) (not (tptp.duplicatefreeP tptp.sk1))) :rule or :premises (a194))
% 0.71/0.91 (step t11 (cl (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.duplicatefreeP tptp.sk3))) :rule and_neg)
% 0.71/0.91 (step t12 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t13)
% 0.71/0.91 (assume t13.a0 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (assume t13.a1 (tptp.duplicatefreeP tptp.sk3))
% 0.71/0.91 (step t13.t1 (cl (=> (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t13.t2)
% 0.71/0.91 (assume t13.t2.a0 (tptp.duplicatefreeP tptp.sk3))
% 0.71/0.91 (assume t13.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (step t13.t2.t1 (cl (= (= (tptp.duplicatefreeP tptp.sk1) true) (tptp.duplicatefreeP tptp.sk1))) :rule equiv_simplify)
% 0.71/0.91 (step t13.t2.t2 (cl (not (= (tptp.duplicatefreeP tptp.sk1) true)) (tptp.duplicatefreeP tptp.sk1)) :rule equiv1 :premises (t13.t2.t1))
% 0.71/0.91 (step t13.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t13.t2.a1))
% 0.71/0.91 (step t13.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t13.t2.t3))
% 0.71/0.91 (step t13.t2.t5 (cl (= (tptp.duplicatefreeP tptp.sk1) (tptp.duplicatefreeP tptp.sk3))) :rule cong :premises (t13.t2.t4))
% 0.71/0.91 (step t13.t2.t6 (cl (= (= (tptp.duplicatefreeP tptp.sk3) true) (tptp.duplicatefreeP tptp.sk3))) :rule equiv_simplify)
% 0.71/0.91 (step t13.t2.t7 (cl (= (tptp.duplicatefreeP tptp.sk3) true) (not (tptp.duplicatefreeP tptp.sk3))) :rule equiv2 :premises (t13.t2.t6))
% 0.71/0.91 (step t13.t2.t8 (cl (= (tptp.duplicatefreeP tptp.sk3) true)) :rule resolution :premises (t13.t2.t7 t13.t2.a0))
% 0.71/0.91 (step t13.t2.t9 (cl (= (tptp.duplicatefreeP tptp.sk1) true)) :rule trans :premises (t13.t2.t5 t13.t2.t8))
% 0.71/0.91 (step t13.t2.t10 (cl (tptp.duplicatefreeP tptp.sk1)) :rule resolution :premises (t13.t2.t2 t13.t2.t9))
% 0.71/0.91 (step t13.t2 (cl (not (tptp.duplicatefreeP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) :rule subproof :discharge (t13.t2.a0 t13.t2.a1))
% 0.71/0.91 (step t13.t3 (cl (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.duplicatefreeP tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t13.t4 (cl (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t13.t5 (cl (tptp.duplicatefreeP tptp.sk1) (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t13.t2 t13.t3 t13.t4))
% 0.71/0.91 (step t13.t6 (cl (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.duplicatefreeP tptp.sk1)) :rule reordering :premises (t13.t5))
% 0.71/0.91 (step t13.t7 (cl (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.duplicatefreeP tptp.sk1)) :rule contraction :premises (t13.t6))
% 0.71/0.91 (step t13.t8 (cl (=> (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (tptp.duplicatefreeP tptp.sk1)) :rule resolution :premises (t13.t1 t13.t7))
% 0.71/0.91 (step t13.t9 (cl (=> (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (not (tptp.duplicatefreeP tptp.sk1))) :rule implies_neg2)
% 0.71/0.91 (step t13.t10 (cl (=> (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (=> (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1))) :rule resolution :premises (t13.t8 t13.t9))
% 0.71/0.91 (step t13.t11 (cl (=> (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.duplicatefreeP tptp.sk1))) :rule contraction :premises (t13.t10))
% 0.71/0.91 (step t13.t12 (cl (not (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.duplicatefreeP tptp.sk1)) :rule implies :premises (t13.t11))
% 0.71/0.91 (step t13.t13 (cl (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3)) (not (tptp.duplicatefreeP tptp.sk3)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.71/0.91 (step t13.t14 (cl (and (tptp.duplicatefreeP tptp.sk3) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t13.t13 t13.a1 t13.a0))
% 0.71/0.91 (step t13.t15 (cl (tptp.duplicatefreeP tptp.sk1)) :rule resolution :premises (t13.t12 t13.t14))
% 0.71/0.91 (step t13 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) :rule subproof :discharge (t13.a0 t13.a1))
% 0.71/0.91 (step t14 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t15 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (tptp.duplicatefreeP tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t16 (cl (tptp.duplicatefreeP tptp.sk1) (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)))) :rule resolution :premises (t13 t14 t15))
% 0.71/0.91 (step t17 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (tptp.duplicatefreeP tptp.sk1)) :rule reordering :premises (t16))
% 0.71/0.91 (step t18 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (tptp.duplicatefreeP tptp.sk1)) :rule contraction :premises (t17))
% 0.71/0.91 (step t19 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (tptp.duplicatefreeP tptp.sk1)) :rule resolution :premises (t12 t18))
% 0.71/0.91 (step t20 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (not (tptp.duplicatefreeP tptp.sk1))) :rule implies_neg2)
% 0.71/0.91 (step t21 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1))) :rule resolution :premises (t19 t20))
% 0.71/0.91 (step t22 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1))) :rule contraction :premises (t21))
% 0.71/0.91 (step t23 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.duplicatefreeP tptp.sk3))) (tptp.duplicatefreeP tptp.sk1)) :rule implies :premises (t22))
% 0.71/0.91 (step t24 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.duplicatefreeP tptp.sk3)) (tptp.duplicatefreeP tptp.sk1)) :rule resolution :premises (t11 t23))
% 0.71/0.91 (step t25 (cl (tptp.duplicatefreeP tptp.sk1) (not (= tptp.sk1 tptp.sk3)) (not (tptp.duplicatefreeP tptp.sk3))) :rule reordering :premises (t24))
% 0.71/0.91 (step t26 (cl (tptp.duplicatefreeP tptp.sk1)) :rule resolution :premises (t25 a190 a191))
% 0.71/0.91 (step t27 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t10 t26))
% 0.71/0.91 (step t28 (cl (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.duplicatefreeP tptp.sk1))) :rule or :premises (a196))
% 0.71/0.91 (step t29 (cl (not (tptp.duplicatefreeP tptp.sk1)) (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule reordering :premises (t28))
% 0.71/0.91 (step t30 (cl (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule and_neg)
% 0.71/0.91 (step t31 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t32)
% 0.71/0.91 (assume t32.a0 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (assume t32.a1 (tptp.memberP tptp.sk3 tptp.sk5))
% 0.71/0.91 (step t32.t1 (cl (=> (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5)) (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t32.t2)
% 0.71/0.91 (assume t32.t2.a0 (tptp.memberP tptp.sk3 tptp.sk5))
% 0.71/0.91 (assume t32.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (step t32.t2.t1 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk5) true) (tptp.memberP tptp.sk1 tptp.sk5))) :rule equiv_simplify)
% 0.71/0.91 (step t32.t2.t2 (cl (not (= (tptp.memberP tptp.sk1 tptp.sk5) true)) (tptp.memberP tptp.sk1 tptp.sk5)) :rule equiv1 :premises (t32.t2.t1))
% 0.71/0.91 (step t32.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t32.t2.a1))
% 0.71/0.91 (step t32.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t32.t2.t3))
% 0.71/0.91 (step t32.t2.t5 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.71/0.91 (step t32.t2.t6 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk3 tptp.sk5))) :rule cong :premises (t32.t2.t4 t32.t2.t5))
% 0.71/0.91 (step t32.t2.t7 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) true) (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv_simplify)
% 0.71/0.91 (step t32.t2.t8 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) true) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv2 :premises (t32.t2.t7))
% 0.71/0.91 (step t32.t2.t9 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) true)) :rule resolution :premises (t32.t2.t8 t32.t2.a0))
% 0.71/0.91 (step t32.t2.t10 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) true)) :rule trans :premises (t32.t2.t6 t32.t2.t9))
% 0.71/0.91 (step t32.t2.t11 (cl (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t32.t2.t2 t32.t2.t10))
% 0.71/0.91 (step t32.t2 (cl (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5)) :rule subproof :discharge (t32.t2.a0 t32.t2.a1))
% 0.71/0.91 (step t32.t3 (cl (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule and_pos)
% 0.71/0.91 (step t32.t4 (cl (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t32.t5 (cl (tptp.memberP tptp.sk1 tptp.sk5) (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t32.t2 t32.t3 t32.t4))
% 0.71/0.91 (step t32.t6 (cl (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule reordering :premises (t32.t5))
% 0.71/0.91 (step t32.t7 (cl (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule contraction :premises (t32.t6))
% 0.71/0.91 (step t32.t8 (cl (=> (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t32.t1 t32.t7))
% 0.71/0.91 (step t32.t9 (cl (=> (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule implies_neg2)
% 0.71/0.91 (step t32.t10 (cl (=> (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5)) (=> (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5))) :rule resolution :premises (t32.t8 t32.t9))
% 0.71/0.91 (step t32.t11 (cl (=> (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5))) :rule contraction :premises (t32.t10))
% 0.71/0.91 (step t32.t12 (cl (not (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule implies :premises (t32.t11))
% 0.71/0.91 (step t32.t13 (cl (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.71/0.91 (step t32.t14 (cl (and (tptp.memberP tptp.sk3 tptp.sk5) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t32.t13 t32.a1 t32.a0))
% 0.71/0.91 (step t32.t15 (cl (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t32.t12 t32.t14))
% 0.71/0.91 (step t32 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) :rule subproof :discharge (t32.a0 t32.a1))
% 0.71/0.91 (step t33 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t34 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule and_pos)
% 0.71/0.91 (step t35 (cl (tptp.memberP tptp.sk1 tptp.sk5) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)))) :rule resolution :premises (t32 t33 t34))
% 0.71/0.91 (step t36 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule reordering :premises (t35))
% 0.71/0.91 (step t37 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule contraction :premises (t36))
% 0.71/0.91 (step t38 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t31 t37))
% 0.71/0.91 (step t39 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule implies_neg2)
% 0.71/0.91 (step t40 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5))) :rule resolution :premises (t38 t39))
% 0.71/0.91 (step t41 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5))) :rule contraction :premises (t40))
% 0.71/0.91 (step t42 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk3 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule implies :premises (t41))
% 0.71/0.91 (step t43 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t30 t42))
% 0.71/0.91 (step t44 (cl (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule reordering :premises (t43))
% 0.71/0.91 (step t45 (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.71/0.91 (step t46 (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.71/0.91 (anchor :step t47)
% 0.71/0.91 (assume t47.a0 (= tptp.sk2 tptp.sk4))
% 0.71/0.91 (assume t47.a1 (tptp.memberP tptp.sk4 tptp.sk5))
% 0.71/0.91 (step t47.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.71/0.91 (anchor :step t47.t2)
% 0.71/0.91 (assume t47.t2.a0 (tptp.memberP tptp.sk4 tptp.sk5))
% 0.71/0.91 (assume t47.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.71/0.91 (step t47.t2.t1 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk5) true) (tptp.memberP tptp.sk2 tptp.sk5))) :rule equiv_simplify)
% 0.71/0.91 (step t47.t2.t2 (cl (not (= (tptp.memberP tptp.sk2 tptp.sk5) true)) (tptp.memberP tptp.sk2 tptp.sk5)) :rule equiv1 :premises (t47.t2.t1))
% 0.71/0.91 (step t47.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t47.t2.a1))
% 0.71/0.91 (step t47.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t47.t2.t3))
% 0.71/0.91 (step t47.t2.t5 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.71/0.91 (step t47.t2.t6 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t47.t2.t4 t47.t2.t5))
% 0.71/0.91 (step t47.t2.t7 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) true) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv_simplify)
% 0.71/0.91 (step t47.t2.t8 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv2 :premises (t47.t2.t7))
% 0.71/0.91 (step t47.t2.t9 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true)) :rule resolution :premises (t47.t2.t8 t47.t2.a0))
% 0.71/0.91 (step t47.t2.t10 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) true)) :rule trans :premises (t47.t2.t6 t47.t2.t9))
% 0.71/0.91 (step t47.t2.t11 (cl (tptp.memberP tptp.sk2 tptp.sk5)) :rule resolution :premises (t47.t2.t2 t47.t2.t10))
% 0.71/0.91 (step t47.t2 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk5)) :rule subproof :discharge (t47.t2.a0 t47.t2.a1))
% 0.71/0.91 (step t47.t3 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule and_pos)
% 0.71/0.91 (step t47.t4 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.71/0.91 (step t47.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 (t47.t2 t47.t3 t47.t4))
% 0.71/0.91 (step t47.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 (t47.t5))
% 0.71/0.91 (step t47.t7 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk2 tptp.sk5)) :rule contraction :premises (t47.t6))
% 0.71/0.91 (step t47.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 (t47.t1 t47.t7))
% 0.71/0.91 (step t47.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.71/0.91 (step t47.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 (t47.t8 t47.t9))
% 0.71/0.91 (step t47.t11 (cl (=> (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk5))) :rule contraction :premises (t47.t10))
% 0.71/0.91 (step t47.t12 (cl (not (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk2 tptp.sk5)) :rule implies :premises (t47.t11))
% 0.71/0.91 (step t47.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.71/0.91 (step t47.t14 (cl (and (tptp.memberP tptp.sk4 tptp.sk5) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t47.t13 t47.a1 t47.a0))
% 0.71/0.91 (step t47.t15 (cl (tptp.memberP tptp.sk2 tptp.sk5)) :rule resolution :premises (t47.t12 t47.t14))
% 0.71/0.91 (step t47 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk2 tptp.sk5)) :rule subproof :discharge (t47.a0 t47.a1))
% 0.71/0.91 (step t48 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.71/0.91 (step t49 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule and_pos)
% 0.71/0.91 (step t50 (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 (t47 t48 t49))
% 0.71/0.91 (step t51 (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 (t50))
% 0.71/0.91 (step t52 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk2 tptp.sk5)) :rule contraction :premises (t51))
% 0.71/0.91 (step t53 (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 (t46 t52))
% 0.71/0.91 (step t54 (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.71/0.91 (step t55 (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 (t53 t54))
% 0.71/0.91 (step t56 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk2 tptp.sk5))) :rule contraction :premises (t55))
% 0.71/0.91 (step t57 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk2 tptp.sk5)) :rule implies :premises (t56))
% 0.71/0.91 (step t58 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk2 tptp.sk5)) :rule resolution :premises (t45 t57))
% 0.71/0.91 (step t59 (cl (tptp.memberP tptp.sk2 tptp.sk5) (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule reordering :premises (t58))
% 0.71/0.91 (step t60 (cl (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule or_pos)
% 0.71/0.91 (step t61 (cl (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule reordering :premises (t60))
% 0.71/0.91 (step t62 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A))))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t63)
% 0.71/0.91 (assume t63.a0 (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))))
% 0.71/0.91 (step t63.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5)))
% 0.71/0.91 (step t63.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule or :premises (t63.t1))
% 0.71/0.91 (step t63.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule resolution :premises (t63.t2 t63.a0))
% 0.71/0.91 (step t63 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule subproof :discharge (t63.a0))
% 0.71/0.91 (step t64 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule resolution :premises (t62 t63))
% 0.71/0.91 (step t65 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule implies_neg2)
% 0.71/0.91 (step t66 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule resolution :premises (t64 t65))
% 0.71/0.91 (step t67 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule contraction :premises (t66))
% 0.71/0.91 (step t68 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssItem A)) (tptp.memberP tptp.sk3 A) (not (tptp.memberP tptp.sk4 A))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule implies :premises (t67))
% 0.71/0.91 (step t69 (cl (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule resolution :premises (t68 a193))
% 0.71/0.91 (step t70 (cl (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t29 t26 t44 a190 t59 a189 t61 t69 t27))
% 0.71/0.91 (step t71 (cl (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule contraction :premises (t70))
% 0.71/0.91 (step t72 (cl (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule and_neg)
% 0.71/0.91 (step t73 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t74)
% 0.71/0.91 (assume t74.a0 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (assume t74.a1 (tptp.memberP tptp.sk1 tptp.sk5))
% 0.71/0.91 (step t74.t1 (cl (=> (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5)) (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t74.t2)
% 0.71/0.91 (assume t74.t2.a0 (tptp.memberP tptp.sk1 tptp.sk5))
% 0.71/0.91 (assume t74.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.71/0.91 (step t74.t2.t1 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk5) true) (tptp.memberP tptp.sk3 tptp.sk5))) :rule equiv_simplify)
% 0.71/0.91 (step t74.t2.t2 (cl (not (= (tptp.memberP tptp.sk3 tptp.sk5) true)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule equiv1 :premises (t74.t2.t1))
% 0.71/0.91 (step t74.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t74.t2.a1))
% 0.71/0.91 (step t74.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t74.t2.t3))
% 0.71/0.91 (step t74.t2.t5 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t74.t2.t4))
% 0.71/0.91 (step t74.t2.t6 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.71/0.91 (step t74.t2.t7 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5))) :rule cong :premises (t74.t2.t5 t74.t2.t6))
% 0.71/0.91 (step t74.t2.t8 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk5) true) (tptp.memberP tptp.sk1 tptp.sk5))) :rule equiv_simplify)
% 0.71/0.91 (step t74.t2.t9 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) true) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule equiv2 :premises (t74.t2.t8))
% 0.71/0.91 (step t74.t2.t10 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) true)) :rule resolution :premises (t74.t2.t9 t74.t2.a0))
% 0.71/0.91 (step t74.t2.t11 (cl (= (tptp.memberP tptp.sk3 tptp.sk5) true)) :rule trans :premises (t74.t2.t7 t74.t2.t10))
% 0.71/0.91 (step t74.t2.t12 (cl (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t74.t2.t2 t74.t2.t11))
% 0.71/0.91 (step t74.t2 (cl (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule subproof :discharge (t74.t2.a0 t74.t2.a1))
% 0.71/0.91 (step t74.t3 (cl (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule and_pos)
% 0.71/0.91 (step t74.t4 (cl (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t74.t5 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t74.t2 t74.t3 t74.t4))
% 0.71/0.91 (step t74.t6 (cl (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule reordering :premises (t74.t5))
% 0.71/0.91 (step t74.t7 (cl (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule contraction :premises (t74.t6))
% 0.71/0.91 (step t74.t8 (cl (=> (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t74.t1 t74.t7))
% 0.71/0.91 (step t74.t9 (cl (=> (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule implies_neg2)
% 0.71/0.91 (step t74.t10 (cl (=> (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5)) (=> (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t74.t8 t74.t9))
% 0.71/0.91 (step t74.t11 (cl (=> (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5))) :rule contraction :premises (t74.t10))
% 0.71/0.91 (step t74.t12 (cl (not (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule implies :premises (t74.t11))
% 0.71/0.91 (step t74.t13 (cl (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.71/0.91 (step t74.t14 (cl (and (tptp.memberP tptp.sk1 tptp.sk5) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t74.t13 t74.a1 t74.a0))
% 0.71/0.91 (step t74.t15 (cl (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t74.t12 t74.t14))
% 0.71/0.91 (step t74 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule subproof :discharge (t74.a0 t74.a1))
% 0.71/0.91 (step t75 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.71/0.91 (step t76 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule and_pos)
% 0.71/0.91 (step t77 (cl (tptp.memberP tptp.sk3 tptp.sk5) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)))) :rule resolution :premises (t74 t75 t76))
% 0.71/0.91 (step t78 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule reordering :premises (t77))
% 0.71/0.91 (step t79 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule contraction :premises (t78))
% 0.71/0.91 (step t80 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t73 t79))
% 0.71/0.91 (step t81 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) (not (tptp.memberP tptp.sk3 tptp.sk5))) :rule implies_neg2)
% 0.71/0.91 (step t82 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5))) :rule resolution :premises (t80 t81))
% 0.71/0.91 (step t83 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5))) :rule contraction :premises (t82))
% 0.71/0.91 (step t84 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk3 tptp.sk5)) :rule implies :premises (t83))
% 0.71/0.91 (step t85 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk5)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t72 t84))
% 0.71/0.91 (step t86 (cl (not (tptp.memberP tptp.sk1 tptp.sk5)) (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk3 tptp.sk5)) :rule reordering :premises (t85))
% 0.71/0.91 (step t87 (cl (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5) (not (tptp.duplicatefreeP tptp.sk1))) :rule or :premises (a195))
% 0.71/0.91 (step t88 (cl (not (tptp.duplicatefreeP tptp.sk1)) (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5)) :rule reordering :premises (t87))
% 0.71/0.91 (step t89 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk2 tptp.sk5))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5)))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule equiv_pos2)
% 0.71/0.91 (step t90 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.71/0.91 (step t91 (cl (= (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) true) (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv_simplify)
% 0.71/0.91 (step t92 (cl (not (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) true)) (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv1 :premises (t91))
% 0.71/0.91 (step t93 (cl (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) (= (tptp.memberP tptp.sk4 tptp.sk5) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))))) :rule all_simplify)
% 0.71/0.91 (step t94 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule refl)
% 0.71/0.91 (step t95 (cl (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule all_simplify)
% 0.71/0.91 (step t96 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)))) :rule cong :premises (t94 t95))
% 0.71/0.91 (step t97 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5)) true)) :rule all_simplify)
% 0.71/0.91 (step t98 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) true)) :rule trans :premises (t96 t97))
% 0.71/0.91 (step t99 (cl (= (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) true)) :rule trans :premises (t93 t98))
% 0.71/0.91 (step t100 (cl (= (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t92 t99))
% 0.71/0.91 (step t101 (cl (= (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule refl)
% 0.71/0.91 (step t102 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk2 tptp.sk5))))) :rule cong :premises (t90 t100 t101))
% 0.71/0.91 (step t103 (cl (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule and_neg)
% 0.71/0.91 (step t104 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t105)
% 0.71/0.91 (assume t105.a0 (= tptp.sk2 tptp.sk4))
% 0.71/0.91 (assume t105.a1 (not (tptp.memberP tptp.sk4 tptp.sk5)))
% 0.71/0.91 (step t105.t1 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5))) (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.71/0.91 (anchor :step t105.t2)
% 0.71/0.91 (assume t105.t2.a0 (not (tptp.memberP tptp.sk4 tptp.sk5)))
% 0.71/0.91 (assume t105.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.71/0.91 (step t105.t2.t1 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk5) false) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule equiv_simplify)
% 0.71/0.91 (step t105.t2.t2 (cl (not (= (tptp.memberP tptp.sk2 tptp.sk5) false)) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule equiv1 :premises (t105.t2.t1))
% 0.71/0.91 (step t105.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t105.t2.a1))
% 0.71/0.91 (step t105.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t105.t2.t3))
% 0.71/0.91 (step t105.t2.t5 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.71/0.91 (step t105.t2.t6 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) (tptp.memberP tptp.sk4 tptp.sk5))) :rule cong :premises (t105.t2.t4 t105.t2.t5))
% 0.71/0.91 (step t105.t2.t7 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) false) (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv_simplify)
% 0.71/0.91 (step t105.t2.t8 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false) (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) :rule equiv2 :premises (t105.t2.t7))
% 0.71/0.91 (step t105.t2.t9 (cl (not (not (not (tptp.memberP tptp.sk4 tptp.sk5)))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule not_not)
% 0.71/0.91 (step t105.t2.t10 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false) (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t105.t2.t8 t105.t2.t9))
% 0.71/0.91 (step t105.t2.t11 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) false)) :rule resolution :premises (t105.t2.t10 t105.t2.a0))
% 0.71/0.91 (step t105.t2.t12 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) false)) :rule trans :premises (t105.t2.t6 t105.t2.t11))
% 0.71/0.91 (step t105.t2.t13 (cl (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule resolution :premises (t105.t2.t2 t105.t2.t12))
% 0.71/0.91 (step t105.t2 (cl (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule subproof :discharge (t105.t2.a0 t105.t2.a1))
% 0.71/0.91 (step t105.t3 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_pos)
% 0.71/0.91 (step t105.t4 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.71/0.91 (step t105.t5 (cl (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t105.t2 t105.t3 t105.t4))
% 0.71/0.91 (step t105.t6 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule reordering :premises (t105.t5))
% 0.71/0.91 (step t105.t7 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule contraction :premises (t105.t6))
% 0.71/0.91 (step t105.t8 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule resolution :premises (t105.t1 t105.t7))
% 0.71/0.91 (step t105.t9 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule implies_neg2)
% 0.71/0.91 (step t105.t10 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule resolution :premises (t105.t8 t105.t9))
% 0.71/0.91 (step t105.t11 (cl (=> (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule contraction :premises (t105.t10))
% 0.71/0.91 (step t105.t12 (cl (not (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule implies :premises (t105.t11))
% 0.71/0.91 (step t105.t13 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.71/0.91 (step t105.t14 (cl (and (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t105.t13 t105.a1 t105.a0))
% 0.71/0.91 (step t105.t15 (cl (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule resolution :premises (t105.t12 t105.t14))
% 0.71/0.91 (step t105 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule subproof :discharge (t105.a0 t105.a1))
% 0.71/0.91 (step t106 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.71/0.91 (step t107 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule and_pos)
% 0.71/0.91 (step t108 (cl (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule resolution :premises (t105 t106 t107))
% 0.71/0.91 (step t109 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule reordering :premises (t108))
% 0.71/0.91 (step t110 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule contraction :premises (t109))
% 0.71/0.91 (step t111 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule resolution :premises (t104 t110))
% 0.71/0.91 (step t112 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule implies_neg2)
% 0.71/0.91 (step t113 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule resolution :premises (t111 t112))
% 0.71/0.91 (step t114 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule contraction :premises (t113))
% 0.71/0.91 (step t115 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk4 tptp.sk5)))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule implies :premises (t114))
% 0.71/0.91 (step t116 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule resolution :premises (t103 t115))
% 0.71/0.91 (step t117 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.71/0.91 (step t118 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (not (not (tptp.memberP tptp.sk4 tptp.sk5))))) :rule or_neg)
% 0.71/0.91 (step t119 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (not (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule or_neg)
% 0.71/0.91 (step t120 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule resolution :premises (t116 t117 t118 t119))
% 0.71/0.91 (step t121 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk4 tptp.sk5))) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule contraction :premises (t120))
% 0.71/0.91 (step t122 (cl (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk2 tptp.sk5)))) :rule resolution :premises (t89 t102 t121))
% 0.71/0.91 (step t123 (cl (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule or :premises (t122))
% 0.71/0.91 (step t124 (cl (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule reordering :premises (t123))
% 0.71/0.91 (step t125 (cl (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule resolution :premises (t124 a189 t71))
% 0.71/0.91 (step t126 (cl (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t88 t26 t125))
% 0.71/0.91 (step t127 (cl (tptp.memberP tptp.sk3 tptp.sk5)) :rule resolution :premises (t86 t126 a190))
% 0.71/0.91 (step t128 (cl (not (or (not (tptp.ssItem tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.memberP tptp.sk3 tptp.sk5))))) :rule resolution :premises (t9 t27 t71 t127))
% 0.71/0.91 (step t129 (cl) :rule resolution :premises (t7 t128 a192))
% 0.71/0.91
% 0.71/0.91 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.oi6ilNtV7j/cvc5---1.0.5_24076.smt2
% 0.71/0.91 % cvc5---1.0.5 exiting
% 0.71/0.91 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------