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