TSTP Solution File: SWC408-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC408-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n010.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:59 EDT 2024
% Result : Unsatisfiable 0.46s 0.67s
% Output : Proof 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SWC408-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n010.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 14:42:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.46/0.67 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.2ydfygcOZh/cvc5---1.0.5_27663.smt2
% 0.46/0.67 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.2ydfygcOZh/cvc5---1.0.5_27663.smt2
% 0.46/0.68 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.46/0.68 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.46/0.68 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.46/0.68 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.46/0.68 (assume a4 (tptp.strictorderP tptp.nil))
% 0.46/0.68 (assume a5 (tptp.totalorderP tptp.nil))
% 0.46/0.68 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.46/0.68 (assume a7 (tptp.ssList tptp.nil))
% 0.46/0.68 (assume a8 (tptp.ssItem tptp.skac3))
% 0.46/0.68 (assume a9 (tptp.ssItem tptp.skac2))
% 0.46/0.68 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.46/0.68 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.46/0.68 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.46/0.68 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.46/0.68 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.46/0.68 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.46/0.68 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.46/0.68 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.46/0.68 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.46/0.68 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.46/0.68 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.46/0.68 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.46/0.68 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.46/0.68 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.46/0.68 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.46/0.68 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.46/0.68 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.46/0.68 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.46/0.68 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.46/0.68 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.46/0.68 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.46/0.68 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.46/0.68 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.46/0.68 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.46/0.68 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.46/0.68 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.46/0.68 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.46/0.68 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.46/0.68 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.46/0.68 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.46/0.68 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.46/0.68 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.46/0.68 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.46/0.68 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.46/0.68 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.46/0.68 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.46/0.68 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.46/0.68 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.46/0.68 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.46/0.68 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.46/0.68 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.46/0.68 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.46/0.68 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.46/0.68 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.46/0.68 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.46/0.68 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.46/0.68 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.46/0.68 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.46/0.68 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.46/0.68 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.46/0.68 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.46/0.68 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.46/0.68 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.46/0.68 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.46/0.68 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.46/0.68 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.46/0.68 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.46/0.68 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.46/0.68 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.46/0.68 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.46/0.68 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.46/0.68 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.46/0.68 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.46/0.68 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.46/0.68 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.46/0.68 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.46/0.68 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.46/0.68 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.46/0.68 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.46/0.68 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.46/0.68 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.46/0.68 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.46/0.68 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.46/0.68 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.46/0.68 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.46/0.68 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.46/0.68 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.46/0.68 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.46/0.68 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.46/0.68 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.46/0.68 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.46/0.68 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.46/0.68 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.46/0.68 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.46/0.68 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.46/0.68 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.46/0.68 (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.46/0.68 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (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.46/0.68 (assume a185 (tptp.ssList tptp.sk1))
% 0.46/0.68 (assume a186 (tptp.ssList tptp.sk2))
% 0.46/0.68 (assume a187 (tptp.ssList tptp.sk3))
% 0.46/0.68 (assume a188 (tptp.ssList tptp.sk4))
% 0.46/0.68 (assume a189 (= (tptp.app tptp.sk4 tptp.sk4) tptp.sk3))
% 0.46/0.68 (assume a190 (= tptp.sk2 tptp.sk4))
% 0.46/0.68 (assume a191 (= tptp.sk1 tptp.sk3))
% 0.46/0.68 (assume a192 (tptp.ssItem tptp.sk5))
% 0.46/0.68 (assume a193 (tptp.memberP tptp.sk2 tptp.sk5))
% 0.46/0.68 (assume a194 (not (tptp.memberP tptp.sk1 tptp.sk5)))
% 0.46/0.68 (step t1 (cl (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)) :rule or_pos)
% 0.46/0.68 (step t2 (cl (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)) :rule contraction :premises (t1))
% 0.46/0.68 (step t3 (cl (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule reordering :premises (t2))
% 0.46/0.68 (step t4 (cl (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule and_neg)
% 0.46/0.68 (step t5 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) :rule implies_neg1)
% 0.46/0.68 (anchor :step t6)
% 0.46/0.68 (assume t6.a0 (= tptp.sk2 tptp.sk4))
% 0.46/0.68 (assume t6.a1 (tptp.memberP tptp.sk2 tptp.sk5))
% 0.46/0.68 (step t6.t1 (cl (=> (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5)) (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.46/0.68 (anchor :step t6.t2)
% 0.46/0.68 (assume t6.t2.a0 (tptp.memberP tptp.sk2 tptp.sk5))
% 0.46/0.68 (assume t6.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.46/0.68 (step t6.t2.t1 (cl (= (= (tptp.memberP tptp.sk4 tptp.sk5) true) (tptp.memberP tptp.sk4 tptp.sk5))) :rule equiv_simplify)
% 0.46/0.68 (step t6.t2.t2 (cl (not (= (tptp.memberP tptp.sk4 tptp.sk5) true)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule equiv1 :premises (t6.t2.t1))
% 0.46/0.68 (step t6.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t6.t2.a1))
% 0.46/0.68 (step t6.t2.t4 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.46/0.68 (step t6.t2.t5 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) (tptp.memberP tptp.sk2 tptp.sk5))) :rule cong :premises (t6.t2.t3 t6.t2.t4))
% 0.46/0.68 (step t6.t2.t6 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk5) true) (tptp.memberP tptp.sk2 tptp.sk5))) :rule equiv_simplify)
% 0.46/0.68 (step t6.t2.t7 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) true) (not (tptp.memberP tptp.sk2 tptp.sk5))) :rule equiv2 :premises (t6.t2.t6))
% 0.46/0.68 (step t6.t2.t8 (cl (= (tptp.memberP tptp.sk2 tptp.sk5) true)) :rule resolution :premises (t6.t2.t7 t6.t2.a0))
% 0.46/0.68 (step t6.t2.t9 (cl (= (tptp.memberP tptp.sk4 tptp.sk5) true)) :rule trans :premises (t6.t2.t5 t6.t2.t8))
% 0.46/0.68 (step t6.t2.t10 (cl (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t6.t2.t2 t6.t2.t9))
% 0.46/0.68 (step t6.t2 (cl (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule subproof :discharge (t6.t2.a0 t6.t2.a1))
% 0.46/0.68 (step t6.t3 (cl (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk2 tptp.sk5)) :rule and_pos)
% 0.46/0.68 (step t6.t4 (cl (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.46/0.68 (step t6.t5 (cl (tptp.memberP tptp.sk4 tptp.sk5) (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t6.t2 t6.t3 t6.t4))
% 0.46/0.68 (step t6.t6 (cl (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule reordering :premises (t6.t5))
% 0.46/0.68 (step t6.t7 (cl (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule contraction :premises (t6.t6))
% 0.46/0.68 (step t6.t8 (cl (=> (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t6.t1 t6.t7))
% 0.46/0.68 (step t6.t9 (cl (=> (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule implies_neg2)
% 0.46/0.68 (step t6.t10 (cl (=> (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5)) (=> (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t6.t8 t6.t9))
% 0.46/0.68 (step t6.t11 (cl (=> (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk4 tptp.sk5))) :rule contraction :premises (t6.t10))
% 0.46/0.68 (step t6.t12 (cl (not (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule implies :premises (t6.t11))
% 0.46/0.68 (step t6.t13 (cl (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.46/0.68 (step t6.t14 (cl (and (tptp.memberP tptp.sk2 tptp.sk5) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t6.t13 t6.a1 t6.a0))
% 0.46/0.68 (step t6.t15 (cl (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t6.t12 t6.t14))
% 0.46/0.68 (step t6 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule subproof :discharge (t6.a0 t6.a1))
% 0.46/0.68 (step t7 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.46/0.68 (step t8 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (tptp.memberP tptp.sk2 tptp.sk5)) :rule and_pos)
% 0.46/0.68 (step t9 (cl (tptp.memberP tptp.sk4 tptp.sk5) (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)))) :rule resolution :premises (t6 t7 t8))
% 0.46/0.68 (step t10 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule reordering :premises (t9))
% 0.46/0.68 (step t11 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule contraction :premises (t10))
% 0.46/0.68 (step t12 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t5 t11))
% 0.46/0.68 (step t13 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5))) :rule implies_neg2)
% 0.46/0.68 (step t14 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5))) :rule resolution :premises (t12 t13))
% 0.46/0.68 (step t15 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5))) :rule contraction :premises (t14))
% 0.46/0.68 (step t16 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.memberP tptp.sk2 tptp.sk5))) (tptp.memberP tptp.sk4 tptp.sk5)) :rule implies :premises (t15))
% 0.46/0.68 (step t17 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.memberP tptp.sk2 tptp.sk5)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t4 t16))
% 0.46/0.68 (step t18 (cl (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t17 a190 a193))
% 0.46/0.68 (step t19 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (or (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) (or (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule equiv_pos2)
% 0.46/0.68 (step t20 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.46/0.68 (step t21 (cl (= (= (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) true) (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)))) :rule equiv_simplify)
% 0.46/0.68 (step t22 (cl (not (= (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) true)) (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5))) :rule equiv1 :premises (t21))
% 0.46/0.68 (step t23 (cl (= (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) (= (tptp.memberP tptp.sk1 tptp.sk5) (not (not (tptp.memberP tptp.sk1 tptp.sk5)))))) :rule all_simplify)
% 0.46/0.68 (step t24 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5))) :rule refl)
% 0.46/0.68 (step t25 (cl (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5))) :rule all_simplify)
% 0.46/0.68 (step t26 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk5) (not (not (tptp.memberP tptp.sk1 tptp.sk5)))) (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5)))) :rule cong :premises (t24 t25))
% 0.46/0.68 (step t27 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5)) true)) :rule all_simplify)
% 0.46/0.68 (step t28 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk5) (not (not (tptp.memberP tptp.sk1 tptp.sk5)))) true)) :rule trans :premises (t26 t27))
% 0.46/0.68 (step t29 (cl (= (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5)) true)) :rule trans :premises (t23 t28))
% 0.46/0.68 (step t30 (cl (= (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (tptp.memberP tptp.sk1 tptp.sk5))) :rule resolution :premises (t22 t29))
% 0.46/0.68 (step t31 (cl (= (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))))) :rule refl)
% 0.46/0.68 (step t32 (cl (= (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule refl)
% 0.46/0.68 (step t33 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (or (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))))) :rule cong :premises (t20 t30 t31 t32))
% 0.46/0.68 (step t34 (cl (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) :rule and_neg)
% 0.46/0.68 (step t35 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) :rule implies_neg1)
% 0.46/0.68 (anchor :step t36)
% 0.46/0.68 (assume t36.a0 (= tptp.sk1 tptp.sk3))
% 0.46/0.68 (assume t36.a1 (not (tptp.memberP tptp.sk1 tptp.sk5)))
% 0.46/0.68 (assume t36.a2 (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))
% 0.46/0.68 (step t36.t1 (cl (=> (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) :rule implies_neg1)
% 0.46/0.68 (anchor :step t36.t2)
% 0.46/0.68 (assume t36.t2.a0 (not (tptp.memberP tptp.sk1 tptp.sk5)))
% 0.46/0.68 (assume t36.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.46/0.68 (assume t36.t2.a2 (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))
% 0.46/0.68 (step t36.t2.t1 (cl (= (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5) false) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule equiv_simplify)
% 0.46/0.68 (step t36.t2.t2 (cl (not (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5) false)) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule equiv1 :premises (t36.t2.t1))
% 0.46/0.68 (step t36.t2.t3 (cl (= (tptp.app tptp.sk4 tptp.sk4) tptp.sk3)) :rule symm :premises (t36.t2.a2))
% 0.46/0.68 (step t36.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t36.t2.a1))
% 0.46/0.68 (step t36.t2.t5 (cl (= (tptp.app tptp.sk4 tptp.sk4) tptp.sk1)) :rule trans :premises (t36.t2.t3 t36.t2.t4))
% 0.46/0.68 (step t36.t2.t6 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.46/0.68 (step t36.t2.t7 (cl (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5) (tptp.memberP tptp.sk1 tptp.sk5))) :rule cong :premises (t36.t2.t5 t36.t2.t6))
% 0.46/0.68 (step t36.t2.t8 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk5) false) (not (tptp.memberP tptp.sk1 tptp.sk5)))) :rule equiv_simplify)
% 0.46/0.68 (step t36.t2.t9 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) false) (not (not (tptp.memberP tptp.sk1 tptp.sk5)))) :rule equiv2 :premises (t36.t2.t8))
% 0.46/0.68 (step t36.t2.t10 (cl (not (not (not (tptp.memberP tptp.sk1 tptp.sk5)))) (tptp.memberP tptp.sk1 tptp.sk5)) :rule not_not)
% 0.46/0.68 (step t36.t2.t11 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) false) (tptp.memberP tptp.sk1 tptp.sk5)) :rule resolution :premises (t36.t2.t9 t36.t2.t10))
% 0.46/0.68 (step t36.t2.t12 (cl (= (tptp.memberP tptp.sk1 tptp.sk5) false)) :rule resolution :premises (t36.t2.t11 t36.t2.a0))
% 0.46/0.68 (step t36.t2.t13 (cl (= (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5) false)) :rule trans :premises (t36.t2.t7 t36.t2.t12))
% 0.46/0.68 (step t36.t2.t14 (cl (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t36.t2.t2 t36.t2.t13))
% 0.46/0.68 (step t36.t2 (cl (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule subproof :discharge (t36.t2.a0 t36.t2.a1 t36.t2.a2))
% 0.46/0.68 (step t36.t3 (cl (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule and_pos)
% 0.46/0.68 (step t36.t4 (cl (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.46/0.68 (step t36.t5 (cl (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) :rule and_pos)
% 0.46/0.68 (step t36.t6 (cl (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)) (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))))) :rule resolution :premises (t36.t2 t36.t3 t36.t4 t36.t5))
% 0.46/0.68 (step t36.t7 (cl (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule reordering :premises (t36.t6))
% 0.46/0.68 (step t36.t8 (cl (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule contraction :premises (t36.t7))
% 0.46/0.68 (step t36.t9 (cl (=> (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t36.t1 t36.t8))
% 0.46/0.68 (step t36.t10 (cl (=> (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule implies_neg2)
% 0.46/0.68 (step t36.t11 (cl (=> (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (=> (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule resolution :premises (t36.t9 t36.t10))
% 0.46/0.68 (step t36.t12 (cl (=> (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule contraction :premises (t36.t11))
% 0.46/0.68 (step t36.t13 (cl (not (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule implies :premises (t36.t12))
% 0.46/0.68 (step t36.t14 (cl (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) :rule and_neg)
% 0.46/0.68 (step t36.t15 (cl (and (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) :rule resolution :premises (t36.t14 t36.a1 t36.a0 t36.a2))
% 0.46/0.68 (step t36.t16 (cl (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t36.t13 t36.t15))
% 0.46/0.68 (step t36 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule subproof :discharge (t36.a0 t36.a1 t36.a2))
% 0.46/0.68 (step t37 (cl (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.46/0.68 (step t38 (cl (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP tptp.sk1 tptp.sk5))) :rule and_pos)
% 0.46/0.68 (step t39 (cl (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) :rule and_pos)
% 0.46/0.68 (step t40 (cl (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)) (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))))) :rule resolution :premises (t36 t37 t38 t39))
% 0.46/0.68 (step t41 (cl (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule reordering :premises (t40))
% 0.46/0.68 (step t42 (cl (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule contraction :premises (t41))
% 0.46/0.68 (step t43 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t35 t42))
% 0.46/0.68 (step t44 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule implies_neg2)
% 0.46/0.68 (step t45 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (=> (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule resolution :premises (t43 t44))
% 0.46/0.68 (step t46 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule contraction :premises (t45))
% 0.46/0.68 (step t47 (cl (not (and (= tptp.sk1 tptp.sk3) (not (tptp.memberP tptp.sk1 tptp.sk5)) (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4)))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule implies :premises (t46))
% 0.46/0.68 (step t48 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t34 t47))
% 0.46/0.68 (step t49 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.46/0.68 (step t50 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (not (not (tptp.memberP tptp.sk1 tptp.sk5))))) :rule or_neg)
% 0.46/0.68 (step t51 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))))) :rule or_neg)
% 0.46/0.68 (step t52 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule or_neg)
% 0.46/0.68 (step t53 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule resolution :premises (t48 t49 t50 t51 t52))
% 0.46/0.68 (step t54 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.memberP tptp.sk1 tptp.sk5))) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule contraction :premises (t53))
% 0.46/0.68 (step t55 (cl (or (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule resolution :premises (t19 t33 t54))
% 0.46/0.68 (step t56 (cl (not (= tptp.sk1 tptp.sk3)) (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule or :premises (t55))
% 0.46/0.68 (step t57 (cl (tptp.memberP tptp.sk1 tptp.sk5) (not (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule reordering :premises (t56))
% 0.46/0.68 (step t58 (cl (= tptp.sk3 (tptp.app tptp.sk4 tptp.sk4))) :rule symm :premises (a189))
% 0.46/0.68 (step t59 (cl (not (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t57 a194 t58 a191))
% 0.46/0.68 (step t60 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V)))) :rule implies_neg1)
% 0.46/0.68 (anchor :step t61)
% 0.46/0.68 (assume t61.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.46/0.68 (step t61.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V)))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk5) (:= W tptp.sk4)))
% 0.46/0.68 (step t61.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V)))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule or :premises (t61.t1))
% 0.46/0.68 (step t61.t3 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t61.t2 t61.a0))
% 0.46/0.68 (step t61 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V)))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule subproof :discharge (t61.a0))
% 0.46/0.68 (step t62 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t60 t61))
% 0.46/0.68 (step t63 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule implies_neg2)
% 0.46/0.68 (step t64 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule resolution :premises (t62 t63))
% 0.46/0.68 (step t65 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5)))) :rule contraction :premises (t64))
% 0.46/0.68 (step t66 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V)))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule implies :premises (t65))
% 0.46/0.68 (step t67 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (tptp.memberP (tptp.app tptp.sk4 tptp.sk4) tptp.sk5))) :rule resolution :premises (t66 a139))
% 0.46/0.68 (step t68 (cl) :rule resolution :premises (t3 t18 t59 t67 a192 a188))
% 0.46/0.68
% 0.46/0.68 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.2ydfygcOZh/cvc5---1.0.5_27663.smt2
% 0.46/0.68 % cvc5---1.0.5 exiting
% 0.46/0.69 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------