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