TSTP Solution File: SWC218-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC218-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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:01 EDT 2024
% Result : Unsatisfiable 0.39s 0.68s
% Output : Proof 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC218-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.15 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 15:42:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.39/0.68 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.EBcVIDyrDn/cvc5---1.0.5_11500.smt2
% 0.39/0.68 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.EBcVIDyrDn/cvc5---1.0.5_11500.smt2
% 0.39/0.70 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.39/0.70 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.39/0.70 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.39/0.70 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.39/0.70 (assume a4 (tptp.strictorderP tptp.nil))
% 0.39/0.70 (assume a5 (tptp.totalorderP tptp.nil))
% 0.39/0.70 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.39/0.70 (assume a7 (tptp.ssList tptp.nil))
% 0.39/0.70 (assume a8 (tptp.ssItem tptp.skac3))
% 0.39/0.70 (assume a9 (tptp.ssItem tptp.skac2))
% 0.39/0.70 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.39/0.70 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.39/0.70 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.39/0.70 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.39/0.70 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.39/0.70 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.39/0.70 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.39/0.70 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.39/0.70 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.39/0.70 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.39/0.70 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.39/0.70 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.39/0.70 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.39/0.70 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.39/0.70 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.39/0.70 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.39/0.70 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.39/0.70 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.39/0.70 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.39/0.70 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.39/0.70 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.39/0.70 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.39/0.70 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.39/0.70 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.39/0.70 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.39/0.70 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.39/0.70 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.39/0.70 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.39/0.70 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.39/0.70 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.39/0.70 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.39/0.70 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.39/0.70 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.39/0.70 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.39/0.70 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.39/0.70 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.39/0.70 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.39/0.70 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.39/0.70 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.39/0.70 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.39/0.70 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.39/0.70 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.39/0.70 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.39/0.70 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.39/0.70 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.39/0.70 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.39/0.70 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.39/0.70 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.39/0.70 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.39/0.70 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.39/0.70 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.39/0.70 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.39/0.70 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.39/0.70 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.39/0.70 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.39/0.70 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.39/0.70 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.39/0.70 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.39/0.70 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.39/0.70 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.39/0.70 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.39/0.70 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.39/0.70 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.39/0.70 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.39/0.70 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.39/0.70 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.39/0.70 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.39/0.70 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.39/0.70 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.39/0.70 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.39/0.70 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.39/0.70 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.39/0.70 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.39/0.70 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.39/0.70 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.39/0.70 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.39/0.70 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.39/0.70 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.39/0.70 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.39/0.70 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.39/0.70 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.39/0.70 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.39/0.70 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.39/0.70 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.39/0.70 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.39/0.70 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.39/0.70 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 0.39/0.70 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.39/0.70 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 0.39/0.70 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 0.39/0.70 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 0.39/0.70 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 0.39/0.70 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.39/0.70 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.39/0.70 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.39/0.70 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 0.39/0.70 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 0.39/0.70 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.39/0.70 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.39/0.70 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 0.39/0.70 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.39/0.70 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.39/0.70 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.39/0.70 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 0.39/0.70 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.39/0.70 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.39/0.70 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.39/0.70 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 0.39/0.70 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 0.39/0.70 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.39/0.70 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.39/0.70 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.39/0.70 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.39/0.70 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.39/0.70 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 0.39/0.70 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 0.39/0.70 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.39/0.70 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 0.39/0.70 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 0.39/0.70 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 0.39/0.70 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 0.39/0.70 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 0.39/0.70 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 0.39/0.70 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.39/0.70 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 0.39/0.70 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 0.39/0.70 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 0.39/0.70 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 0.39/0.70 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 0.39/0.70 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 0.39/0.70 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.39/0.70 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 0.39/0.70 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 0.39/0.70 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 0.39/0.70 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 0.39/0.70 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 0.39/0.70 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 0.39/0.70 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 0.39/0.70 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.39/0.70 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 0.39/0.70 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 0.39/0.70 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 0.39/0.70 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.39/0.70 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.39/0.70 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 0.39/0.70 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 0.39/0.70 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 0.39/0.70 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 0.39/0.70 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 0.39/0.70 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 0.39/0.70 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 0.39/0.70 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 0.39/0.70 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 0.39/0.70 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 0.39/0.70 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 0.39/0.70 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.39/0.70 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 0.39/0.70 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 0.39/0.70 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 0.39/0.70 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 0.39/0.70 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 0.39/0.70 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 0.39/0.70 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 0.39/0.70 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 0.39/0.70 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 0.39/0.70 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 0.39/0.70 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 0.39/0.70 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 0.39/0.70 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 0.39/0.70 (assume a185 (tptp.ssList tptp.sk1))
% 0.39/0.70 (assume a186 (tptp.ssList tptp.sk2))
% 0.39/0.70 (assume a187 (tptp.ssList tptp.sk3))
% 0.39/0.70 (assume a188 (tptp.ssList tptp.sk4))
% 0.39/0.70 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.39/0.70 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.39/0.70 (assume a191 (tptp.ssList tptp.sk5))
% 0.39/0.70 (assume a192 (tptp.ssList tptp.sk6))
% 0.39/0.70 (assume a193 (= (tptp.app tptp.sk5 tptp.sk6) tptp.sk4))
% 0.39/0.70 (assume a194 (tptp.ssItem tptp.sk7))
% 0.39/0.70 (assume a195 (= (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6) tptp.sk3))
% 0.39/0.70 (assume a196 (not (tptp.neq tptp.sk1 tptp.nil)))
% 0.39/0.70 (step t1 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.nil tptp.sk1))) :rule and_neg)
% 0.39/0.70 (step t2 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t3)
% 0.39/0.70 (assume t3.a0 (= tptp.sk1 tptp.sk3))
% 0.39/0.70 (assume t3.a1 (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))
% 0.39/0.70 (assume t3.a2 (= tptp.nil tptp.sk1))
% 0.39/0.70 (step t3.t1 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t3.t2)
% 0.39/0.70 (assume t3.t2.a0 (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))
% 0.39/0.70 (assume t3.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.39/0.70 (assume t3.t2.a2 (= tptp.nil tptp.sk1))
% 0.39/0.70 (step t3.t2.t1 (cl (= tptp.sk1 tptp.nil)) :rule symm :premises (t3.t2.a2))
% 0.39/0.70 (step t3.t2.t2 (cl (= tptp.nil tptp.sk1)) :rule symm :premises (t3.t2.t1))
% 0.39/0.70 (step t3.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t3.t2.a1))
% 0.39/0.70 (step t3.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t3.t2.t3))
% 0.39/0.70 (step t3.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6) tptp.sk3)) :rule symm :premises (t3.t2.a0))
% 0.39/0.70 (step t3.t2.t6 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule symm :premises (t3.t2.t5))
% 0.39/0.70 (step t3.t2.t7 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule trans :premises (t3.t2.t2 t3.t2.t4 t3.t2.t6))
% 0.39/0.70 (step t3.t2 (cl (not (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule subproof :discharge (t3.t2.a0 t3.t2.a1 t3.t2.a2))
% 0.39/0.70 (step t3.t3 (cl (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule and_pos)
% 0.39/0.70 (step t3.t4 (cl (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.39/0.70 (step t3.t5 (cl (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) :rule and_pos)
% 0.39/0.70 (step t3.t6 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t3.t2 t3.t3 t3.t4 t3.t5))
% 0.39/0.70 (step t3.t7 (cl (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule reordering :premises (t3.t6))
% 0.39/0.70 (step t3.t8 (cl (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule contraction :premises (t3.t7))
% 0.39/0.70 (step t3.t9 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule resolution :premises (t3.t1 t3.t8))
% 0.39/0.70 (step t3.t10 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule implies_neg2)
% 0.39/0.70 (step t3.t11 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (=> (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t3.t9 t3.t10))
% 0.39/0.70 (step t3.t12 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule contraction :premises (t3.t11))
% 0.39/0.70 (step t3.t13 (cl (not (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule implies :premises (t3.t12))
% 0.39/0.70 (step t3.t14 (cl (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) :rule and_neg)
% 0.39/0.70 (step t3.t15 (cl (and (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) :rule resolution :premises (t3.t14 t3.a1 t3.a0 t3.a2))
% 0.39/0.70 (step t3.t16 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule resolution :premises (t3.t13 t3.t15))
% 0.39/0.70 (step t3 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule subproof :discharge (t3.a0 t3.a1 t3.a2))
% 0.39/0.70 (step t4 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.39/0.70 (step t5 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule and_pos)
% 0.39/0.70 (step t6 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) :rule and_pos)
% 0.39/0.70 (step t7 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t3 t4 t5 t6))
% 0.39/0.70 (step t8 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule reordering :premises (t7))
% 0.39/0.70 (step t9 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule contraction :premises (t8))
% 0.39/0.70 (step t10 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule resolution :premises (t2 t9))
% 0.39/0.70 (step t11 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule implies_neg2)
% 0.39/0.70 (step t12 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t10 t11))
% 0.39/0.70 (step t13 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule contraction :premises (t12))
% 0.39/0.70 (step t14 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (= tptp.nil tptp.sk1))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule implies :premises (t13))
% 0.39/0.70 (step t15 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (= tptp.nil tptp.sk1)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule resolution :premises (t1 t14))
% 0.39/0.70 (step t16 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t15))
% 0.39/0.70 (step t17 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) :rule or_pos)
% 0.39/0.70 (step t18 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule reordering :premises (t17))
% 0.39/0.70 (step t19 (cl (not (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) :rule or_pos)
% 0.39/0.70 (step t20 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))))) :rule reordering :premises (t19))
% 0.39/0.70 (step t21 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) :rule or_pos)
% 0.39/0.70 (step t22 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule reordering :premises (t21))
% 0.39/0.70 (step t23 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t24)
% 0.39/0.70 (assume t24.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.39/0.70 (step t24.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 0.39/0.70 (step t24.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule or :premises (t24.t1))
% 0.39/0.70 (step t24.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t24.t2 t24.a0))
% 0.39/0.70 (step t24 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule subproof :discharge (t24.a0))
% 0.39/0.70 (step t25 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t23 t24))
% 0.39/0.70 (step t26 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule implies_neg2)
% 0.39/0.70 (step t27 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t25 t26))
% 0.39/0.70 (step t28 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule contraction :premises (t27))
% 0.39/0.70 (step t29 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule implies :premises (t28))
% 0.39/0.70 (step t30 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t29 a85))
% 0.39/0.70 (step t31 (cl (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) :rule resolution :premises (t22 a7 a194 t30))
% 0.39/0.70 (step t32 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 0.39/0.70 (step t33 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t32))
% 0.39/0.70 (step t34 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t35)
% 0.39/0.70 (assume t35.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.39/0.70 (step t35.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 0.39/0.70 (step t35.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t35.t1))
% 0.39/0.70 (step t35.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t35.t2 t35.a0))
% 0.39/0.70 (step t35 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t35.a0))
% 0.39/0.70 (step t36 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t34 t35))
% 0.39/0.70 (step t37 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 0.39/0.70 (step t38 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t36 t37))
% 0.39/0.70 (step t39 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t38))
% 0.39/0.70 (step t40 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t39))
% 0.39/0.70 (step t41 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 0.39/0.70 (anchor :step t42 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.39/0.70 (step t42.t1 (cl (= U U)) :rule refl)
% 0.39/0.70 (step t42.t2 (cl (= V V)) :rule refl)
% 0.39/0.70 (step t42.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 0.39/0.70 (step t42.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t42.t3))
% 0.39/0.70 (step t42.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.39/0.70 (step t42.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.39/0.70 (step t42.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t42.t4 t42.t5 t42.t6))
% 0.39/0.70 (step t42 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 0.39/0.70 (step t43 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t41 t42 a97))
% 0.39/0.70 (step t44 (cl (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t40 t43))
% 0.39/0.70 (step t45 (cl (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t33 a7 a194 t44))
% 0.39/0.70 (step t46 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t47)
% 0.39/0.70 (assume t47.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.39/0.70 (step t47.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V (tptp.cons tptp.sk7 tptp.nil))))
% 0.39/0.70 (step t47.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule or :premises (t47.t1))
% 0.39/0.70 (step t47.t3 (cl (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t47.t2 t47.a0))
% 0.39/0.70 (step t47 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule subproof :discharge (t47.a0))
% 0.39/0.70 (step t48 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t46 t47))
% 0.39/0.70 (step t49 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))))) :rule implies_neg2)
% 0.39/0.70 (step t50 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t48 t49))
% 0.39/0.70 (step t51 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))))) :rule contraction :premises (t50))
% 0.39/0.70 (step t52 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule implies :premises (t51))
% 0.39/0.70 (step t53 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule equiv_pos2)
% 0.39/0.70 (anchor :step t54 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.39/0.70 (step t54.t1 (cl (= U U)) :rule refl)
% 0.39/0.70 (step t54.t2 (cl (= V V)) :rule refl)
% 0.39/0.70 (step t54.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 0.39/0.70 (step t54.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t54.t3))
% 0.39/0.70 (step t54.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.39/0.70 (step t54.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.39/0.70 (step t54.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 0.39/0.70 (step t54.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule cong :premises (t54.t4 t54.t5 t54.t6 t54.t7))
% 0.39/0.70 (step t54 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) :rule bind)
% 0.39/0.70 (step t55 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule resolution :premises (t53 t54 a118))
% 0.39/0.70 (step t56 (cl (or (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t52 t55))
% 0.39/0.70 (step t57 (cl (not (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t20 a191 t31 t45 t56))
% 0.39/0.70 (step t58 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) :rule or_pos)
% 0.39/0.70 (step t59 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))) (not (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule reordering :premises (t58))
% 0.39/0.70 (step t60 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t61)
% 0.39/0.70 (assume t61.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.39/0.70 (step t61.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk7 tptp.nil)) (:= V tptp.sk5)))
% 0.39/0.70 (step t61.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule or :premises (t61.t1))
% 0.39/0.70 (step t61.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t61.t2 t61.a0))
% 0.39/0.70 (step t61 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule subproof :discharge (t61.a0))
% 0.39/0.70 (step t62 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t60 t61))
% 0.39/0.70 (step t63 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule implies_neg2)
% 0.39/0.70 (step t64 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule resolution :premises (t62 t63))
% 0.39/0.70 (step t65 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule contraction :premises (t64))
% 0.39/0.70 (step t66 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule implies :premises (t65))
% 0.39/0.70 (step t67 (cl (or (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t66 a84))
% 0.39/0.70 (step t68 (cl (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t59 a191 t31 t67))
% 0.39/0.70 (step t69 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t70)
% 0.39/0.70 (assume t70.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.39/0.70 (step t70.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))) (:= V tptp.sk6)))
% 0.39/0.70 (step t70.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule or :premises (t70.t1))
% 0.39/0.70 (step t70.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t70.t2 t70.a0))
% 0.39/0.70 (step t70 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule subproof :discharge (t70.a0))
% 0.39/0.70 (step t71 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t69 t70))
% 0.39/0.70 (step t72 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule implies_neg2)
% 0.39/0.70 (step t73 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule resolution :premises (t71 t72))
% 0.39/0.70 (step t74 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))))) :rule contraction :premises (t73))
% 0.39/0.70 (step t75 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule implies :premises (t74))
% 0.39/0.70 (step t76 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 0.39/0.70 (anchor :step t77 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.39/0.70 (step t77.t1 (cl (= U U)) :rule refl)
% 0.39/0.70 (step t77.t2 (cl (= V V)) :rule refl)
% 0.39/0.70 (step t77.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 0.39/0.70 (step t77.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t77.t3))
% 0.39/0.70 (step t77.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.39/0.70 (step t77.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.39/0.70 (step t77.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 0.39/0.70 (step t77.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t77.t4 t77.t5 t77.t6 t77.t7))
% 0.39/0.70 (step t77 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 0.39/0.70 (step t78 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t76 t77 a117))
% 0.39/0.70 (step t79 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t75 t78))
% 0.39/0.70 (step t80 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t18 a192 t57 t68 t79))
% 0.39/0.70 (step t81 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)) :rule or_pos)
% 0.39/0.70 (step t82 (cl (tptp.neq tptp.sk1 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule reordering :premises (t81))
% 0.39/0.70 (step t83 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 0.39/0.70 (anchor :step t84)
% 0.39/0.70 (assume t84.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 0.39/0.70 (step t84.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk1)))
% 0.39/0.70 (step t84.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule or :premises (t84.t1))
% 0.39/0.70 (step t84.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t84.t2 t84.a0))
% 0.39/0.70 (step t84 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule subproof :discharge (t84.a0))
% 0.39/0.70 (step t85 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t83 t84))
% 0.39/0.70 (step t86 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 0.39/0.70 (step t87 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t85 t86))
% 0.39/0.70 (step t88 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule contraction :premises (t87))
% 0.39/0.70 (step t89 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule implies :premises (t88))
% 0.39/0.70 (step t90 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 0.39/0.70 (anchor :step t91 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.39/0.70 (step t91.t1 (cl (= U U)) :rule refl)
% 0.39/0.70 (step t91.t2 (cl (= V V)) :rule refl)
% 0.39/0.70 (step t91.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.39/0.70 (step t91.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.39/0.70 (step t91.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 0.39/0.70 (step t91.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 0.39/0.70 (step t91.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t91.t3 t91.t4 t91.t5 t91.t6))
% 0.39/0.70 (step t91 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 0.39/0.70 (step t92 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t90 t91 a99))
% 0.39/0.70 (step t93 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t89 t92))
% 0.39/0.70 (step t94 (cl (= tptp.nil tptp.sk1)) :rule resolution :premises (t82 a196 a7 a185 t93))
% 0.39/0.70 (step t95 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.sk5 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk6))) :rule symm :premises (a195))
% 0.39/0.70 (step t96 (cl) :rule resolution :premises (t16 t80 t94 t95 a190))
% 0.39/0.70
% 0.39/0.70 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.EBcVIDyrDn/cvc5---1.0.5_11500.smt2
% 0.39/0.70 % cvc5---1.0.5 exiting
% 0.39/0.71 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------