TSTP Solution File: SWC412-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC412-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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:02:00 EDT 2024
% Result : Unsatisfiable 0.97s 1.14s
% Output : Proof 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC412-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.16 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n018.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:25:09 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.56 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.97/1.14 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.wZHV8I529c/cvc5---1.0.5_6662.smt2
% 0.97/1.14 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.wZHV8I529c/cvc5---1.0.5_6662.smt2
% 0.97/1.17 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.97/1.17 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.97/1.17 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.97/1.17 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.97/1.17 (assume a4 (tptp.strictorderP tptp.nil))
% 0.97/1.17 (assume a5 (tptp.totalorderP tptp.nil))
% 0.97/1.17 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.97/1.17 (assume a7 (tptp.ssList tptp.nil))
% 0.97/1.17 (assume a8 (tptp.ssItem tptp.skac3))
% 0.97/1.17 (assume a9 (tptp.ssItem tptp.skac2))
% 0.97/1.17 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.97/1.17 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.97/1.17 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.97/1.17 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.97/1.17 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.97/1.17 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.97/1.17 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.97/1.17 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.97/1.17 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.97/1.17 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.97/1.17 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.97/1.17 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.97/1.17 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.97/1.17 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.97/1.17 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.97/1.17 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.97/1.17 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.97/1.17 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.97/1.17 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.97/1.17 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.97/1.17 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.97/1.17 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.97/1.17 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.97/1.17 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.97/1.17 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.97/1.17 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.97/1.17 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.97/1.17 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.97/1.17 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.97/1.17 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.97/1.17 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.97/1.17 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.97/1.17 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.97/1.17 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.97/1.17 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.97/1.17 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.97/1.17 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.97/1.17 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.97/1.17 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.97/1.17 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.97/1.17 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.97/1.17 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.97/1.17 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.97/1.17 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.97/1.17 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.97/1.17 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.97/1.17 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.97/1.17 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.97/1.17 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.97/1.17 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.97/1.17 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.97/1.17 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.97/1.17 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.97/1.17 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.97/1.17 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.97/1.17 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.97/1.17 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.97/1.17 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.97/1.17 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.97/1.17 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.97/1.17 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.97/1.17 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.97/1.17 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.97/1.17 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.97/1.17 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.97/1.17 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.97/1.17 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.97/1.17 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.97/1.17 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.97/1.17 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.97/1.17 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.97/1.17 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.97/1.17 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.97/1.17 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.97/1.17 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.97/1.17 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.97/1.17 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.97/1.17 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.97/1.17 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.97/1.17 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.97/1.17 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.97/1.17 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.97/1.17 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.97/1.17 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.97/1.17 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.97/1.17 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.97/1.17 (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.97/1.17 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (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.97/1.17 (assume a185 (tptp.ssList tptp.sk1))
% 0.97/1.17 (assume a186 (tptp.ssList tptp.sk2))
% 0.97/1.17 (assume a187 (tptp.ssList tptp.sk3))
% 0.97/1.17 (assume a188 (tptp.ssList tptp.sk4))
% 0.97/1.17 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.97/1.17 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.97/1.17 (assume a191 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4)))))
% 0.97/1.17 (assume a192 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk8))))
% 0.97/1.17 (assume a193 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk9))))
% 0.97/1.17 (assume a194 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk10))))
% 0.97/1.17 (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk8 tptp.nil) (tptp.cons tptp.sk9 tptp.nil)) tptp.sk10) tptp.sk2))))
% 0.97/1.17 (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk11))))
% 0.97/1.17 (assume a197 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk12))))
% 0.97/1.17 (assume a198 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk13))))
% 0.97/1.17 (assume a199 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))))
% 0.97/1.17 (assume a200 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))))
% 0.97/1.17 (assume a201 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))))
% 0.97/1.17 (assume a202 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))))
% 0.97/1.17 (assume a203 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))))
% 0.97/1.17 (assume a204 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))))
% 0.97/1.17 (assume a205 (or (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk8)))
% 0.97/1.17 (assume a206 (or (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk9)))
% 0.97/1.17 (assume a207 (or (tptp.ssItem tptp.sk5) (tptp.ssList tptp.sk10)))
% 0.97/1.17 (assume a208 (or (tptp.ssItem tptp.sk5) (= (tptp.app (tptp.app (tptp.cons tptp.sk8 tptp.nil) (tptp.cons tptp.sk9 tptp.nil)) tptp.sk10) tptp.sk2)))
% 0.97/1.17 (assume a209 (or (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk11)))
% 0.97/1.17 (assume a210 (or (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk12)))
% 0.97/1.17 (assume a211 (or (tptp.ssItem tptp.sk5) (tptp.ssList tptp.sk13)))
% 0.97/1.17 (assume a212 (or (tptp.ssItem tptp.sk5) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)))
% 0.97/1.17 (assume a213 (or (tptp.ssItem tptp.sk5) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))))
% 0.97/1.17 (assume a214 (or (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk8)))
% 0.97/1.17 (assume a215 (or (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk9)))
% 0.97/1.17 (assume a216 (or (tptp.ssItem tptp.sk6) (tptp.ssList tptp.sk10)))
% 0.97/1.17 (assume a217 (or (tptp.ssItem tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk8 tptp.nil) (tptp.cons tptp.sk9 tptp.nil)) tptp.sk10) tptp.sk2)))
% 0.97/1.17 (assume a218 (or (tptp.ssList tptp.sk7) (tptp.ssItem tptp.sk8)))
% 0.97/1.17 (assume a219 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk8)))
% 0.97/1.17 (assume a220 (or (tptp.ssList tptp.sk7) (tptp.ssItem tptp.sk9)))
% 0.97/1.17 (assume a221 (or (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk10)))
% 0.97/1.17 (assume a222 (or (tptp.ssList tptp.sk7) (= (tptp.app (tptp.app (tptp.cons tptp.sk8 tptp.nil) (tptp.cons tptp.sk9 tptp.nil)) tptp.sk10) tptp.sk2)))
% 0.97/1.17 (assume a223 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk9)))
% 0.97/1.17 (assume a224 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssList tptp.sk10)))
% 0.97/1.17 (assume a225 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (= (tptp.app (tptp.app (tptp.cons tptp.sk8 tptp.nil) (tptp.cons tptp.sk9 tptp.nil)) tptp.sk10) tptp.sk2)))
% 0.97/1.17 (assume a226 (or (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk11)))
% 0.97/1.17 (assume a227 (or (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk12)))
% 0.97/1.17 (assume a228 (or (tptp.ssItem tptp.sk6) (tptp.ssList tptp.sk13)))
% 0.97/1.17 (assume a229 (or (tptp.ssItem tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)))
% 0.97/1.17 (assume a230 (or (tptp.ssItem tptp.sk6) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))))
% 0.97/1.17 (assume a231 (or (tptp.ssList tptp.sk7) (tptp.ssItem tptp.sk11)))
% 0.97/1.17 (assume a232 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk11)))
% 0.97/1.17 (assume a233 (or (tptp.ssList tptp.sk7) (tptp.ssItem tptp.sk12)))
% 0.97/1.17 (assume a234 (or (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk13)))
% 0.97/1.17 (assume a235 (or (tptp.ssList tptp.sk7) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)))
% 0.97/1.17 (assume a236 (or (tptp.ssList tptp.sk7) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))))
% 0.97/1.17 (assume a237 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk12)))
% 0.97/1.17 (assume a238 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssList tptp.sk13)))
% 0.97/1.17 (assume a239 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)))
% 0.97/1.17 (assume a240 (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))))
% 0.97/1.17 (step t1 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule and_neg)
% 0.97/1.17 (step t2 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t3)
% 0.97/1.17 (assume t3.a0 (= tptp.sk2 tptp.sk4))
% 0.97/1.17 (assume t3.a1 (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))
% 0.97/1.17 (step t3.t1 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t3.t2)
% 0.97/1.17 (assume t3.t2.a0 (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))
% 0.97/1.17 (assume t3.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.97/1.17 (step t3.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t3.t2.a1))
% 0.97/1.17 (step t3.t2.t2 (cl (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2)) :rule symm :premises (t3.t2.a0))
% 0.97/1.17 (step t3.t2.t3 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule symm :premises (t3.t2.t2))
% 0.97/1.17 (step t3.t2.t4 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule trans :premises (t3.t2.t1 t3.t2.t3))
% 0.97/1.17 (step t3.t2 (cl (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule subproof :discharge (t3.t2.a0 t3.t2.a1))
% 0.97/1.17 (step t3.t3 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule and_pos)
% 0.97/1.17 (step t3.t4 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.97/1.17 (step t3.t5 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t3.t2 t3.t3 t3.t4))
% 0.97/1.17 (step t3.t6 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t3.t5))
% 0.97/1.17 (step t3.t7 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule contraction :premises (t3.t6))
% 0.97/1.17 (step t3.t8 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule resolution :premises (t3.t1 t3.t7))
% 0.97/1.17 (step t3.t9 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule implies_neg2)
% 0.97/1.17 (step t3.t10 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t3.t8 t3.t9))
% 0.97/1.17 (step t3.t11 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule contraction :premises (t3.t10))
% 0.97/1.17 (step t3.t12 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule implies :premises (t3.t11))
% 0.97/1.17 (step t3.t13 (cl (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.97/1.17 (step t3.t14 (cl (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t3.t13 t3.a1 t3.a0))
% 0.97/1.17 (step t3.t15 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule resolution :premises (t3.t12 t3.t14))
% 0.97/1.17 (step t3 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule subproof :discharge (t3.a0 t3.a1))
% 0.97/1.17 (step t4 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.97/1.17 (step t5 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule and_pos)
% 0.97/1.17 (step t6 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule resolution :premises (t3 t4 t5))
% 0.97/1.17 (step t7 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t6))
% 0.97/1.17 (step t8 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule contraction :premises (t7))
% 0.97/1.17 (step t9 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule resolution :premises (t2 t8))
% 0.97/1.17 (step t10 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule implies_neg2)
% 0.97/1.17 (step t11 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t9 t10))
% 0.97/1.17 (step t12 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule contraction :premises (t11))
% 0.97/1.17 (step t13 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule implies :premises (t12))
% 0.97/1.17 (step t14 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule resolution :premises (t1 t13))
% 0.97/1.17 (step t15 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule or_pos)
% 0.97/1.17 (step t16 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule reordering :premises (t15))
% 0.97/1.17 (step t17 (cl (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk12)) :rule or :premises (a210))
% 0.97/1.17 (step t18 (cl (tptp.ssItem tptp.sk12) (tptp.ssItem tptp.sk5)) :rule reordering :premises (t17))
% 0.97/1.17 (step t19 (cl (= (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule hole :args ((forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (= D A) (= E B) (= F C)))
% 0.97/1.17 (step t20 (cl (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv2 :premises (t19))
% 0.97/1.17 (step t21 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (tptp.ssItem tptp.sk6) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))))) (or (tptp.ssItem tptp.sk6) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t22 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t22.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t22.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t22.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t22.t4 (cl (= (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk6))) :rule refl)
% 0.97/1.17 (step t22.t5 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t22.t6 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t22.t7 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t22.t8 (cl (= (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t22.t9 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t22.t10 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) :rule cong :premises (t22.t9))
% 0.97/1.17 (step t22.t11 (cl (= (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule cong :premises (t22.t4 t22.t5 t22.t6 t22.t7 t22.t8 t22.t10))
% 0.97/1.17 (step t22 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule bind)
% 0.97/1.17 (step t23 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) (or (tptp.ssItem tptp.sk6) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule all_simplify)
% 0.97/1.17 (step t24 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk6) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (tptp.ssItem tptp.sk6) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule trans :premises (t22 t23))
% 0.97/1.17 (step t25 (cl (or (tptp.ssItem tptp.sk6) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule resolution :premises (t21 t24 a202))
% 0.97/1.17 (step t26 (cl (tptp.ssItem tptp.sk6) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule or :premises (t25))
% 0.97/1.17 (step t27 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t28)
% 0.97/1.17 (assume t28.a0 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))))
% 0.97/1.17 (step t28.t1 (cl (or (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))))) :rule forall_inst :args ((:= D tptp.sk11) (:= E tptp.sk12) (:= F tptp.sk13)))
% 0.97/1.17 (step t28.t2 (cl (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule or :premises (t28.t1))
% 0.97/1.17 (step t28.t3 (cl (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule resolution :premises (t28.t2 t28.a0))
% 0.97/1.17 (step t28 (cl (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule subproof :discharge (t28.a0))
% 0.97/1.17 (step t29 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule resolution :premises (t27 t28))
% 0.97/1.17 (step t30 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (not (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))))) :rule implies_neg2)
% 0.97/1.17 (step t31 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))))) :rule resolution :premises (t29 t30))
% 0.97/1.17 (step t32 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))))) :rule contraction :premises (t31))
% 0.97/1.17 (step t33 (cl (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule implies :premises (t32))
% 0.97/1.17 (step t34 (cl (= (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule hole :args ((forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (= D A) (= E B) (= F C)))
% 0.97/1.17 (step t35 (cl (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv2 :premises (t34))
% 0.97/1.17 (step t36 (cl (not (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule or_pos)
% 0.97/1.17 (step t37 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))))) :rule reordering :premises (t36))
% 0.97/1.17 (step t38 (cl (tptp.ssList tptp.sk7) (tptp.ssItem tptp.sk12)) :rule or :premises (a233))
% 0.97/1.17 (step t39 (cl (tptp.ssItem tptp.sk12) (tptp.ssList tptp.sk7)) :rule reordering :premises (t38))
% 0.97/1.17 (step t40 (cl (tptp.ssList tptp.sk7) (tptp.ssItem tptp.sk11)) :rule or :premises (a231))
% 0.97/1.17 (step t41 (cl (tptp.ssItem tptp.sk11) (tptp.ssList tptp.sk7)) :rule reordering :premises (t40))
% 0.97/1.17 (step t42 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (tptp.ssList tptp.sk7) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))))) (or (tptp.ssList tptp.sk7) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t43 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t43.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t43.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t43.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t43.t4 (cl (= (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk7))) :rule refl)
% 0.97/1.17 (step t43.t5 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t43.t6 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t43.t7 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t43.t8 (cl (= (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t43.t9 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t43.t10 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) :rule cong :premises (t43.t9))
% 0.97/1.17 (step t43.t11 (cl (= (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule cong :premises (t43.t4 t43.t5 t43.t6 t43.t7 t43.t8 t43.t10))
% 0.97/1.17 (step t43 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule bind)
% 0.97/1.17 (step t44 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) (or (tptp.ssList tptp.sk7) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule all_simplify)
% 0.97/1.17 (step t45 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssList tptp.sk7) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (tptp.ssList tptp.sk7) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule trans :premises (t43 t44))
% 0.97/1.17 (step t46 (cl (or (tptp.ssList tptp.sk7) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule resolution :premises (t42 t45 a203))
% 0.97/1.17 (step t47 (cl (tptp.ssList tptp.sk7) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule or :premises (t46))
% 0.97/1.17 (step t48 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule and_neg)
% 0.97/1.17 (step t49 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t50)
% 0.97/1.17 (assume t50.a0 (= tptp.sk2 tptp.sk4))
% 0.97/1.17 (assume t50.a1 (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))
% 0.97/1.17 (step t50.t1 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t50.t2)
% 0.97/1.17 (assume t50.t2.a0 (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))
% 0.97/1.17 (assume t50.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.97/1.17 (step t50.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t50.t2.a1))
% 0.97/1.17 (step t50.t2.t2 (cl (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) :rule symm :premises (t50.t2.a0))
% 0.97/1.17 (step t50.t2.t3 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule symm :premises (t50.t2.t2))
% 0.97/1.17 (step t50.t2.t4 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule trans :premises (t50.t2.t1 t50.t2.t3))
% 0.97/1.17 (step t50.t2 (cl (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule subproof :discharge (t50.t2.a0 t50.t2.a1))
% 0.97/1.17 (step t50.t3 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule and_pos)
% 0.97/1.17 (step t50.t4 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.97/1.17 (step t50.t5 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t50.t2 t50.t3 t50.t4))
% 0.97/1.17 (step t50.t6 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule reordering :premises (t50.t5))
% 0.97/1.17 (step t50.t7 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule contraction :premises (t50.t6))
% 0.97/1.17 (step t50.t8 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule resolution :premises (t50.t1 t50.t7))
% 0.97/1.17 (step t50.t9 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule implies_neg2)
% 0.97/1.17 (step t50.t10 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t50.t8 t50.t9))
% 0.97/1.17 (step t50.t11 (cl (=> (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule contraction :premises (t50.t10))
% 0.97/1.17 (step t50.t12 (cl (not (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule implies :premises (t50.t11))
% 0.97/1.17 (step t50.t13 (cl (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.97/1.17 (step t50.t14 (cl (and (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t50.t13 t50.a1 t50.a0))
% 0.97/1.17 (step t50.t15 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule resolution :premises (t50.t12 t50.t14))
% 0.97/1.17 (step t50 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule subproof :discharge (t50.a0 t50.a1))
% 0.97/1.17 (step t51 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.97/1.17 (step t52 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule and_pos)
% 0.97/1.17 (step t53 (cl (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule resolution :premises (t50 t51 t52))
% 0.97/1.17 (step t54 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule reordering :premises (t53))
% 0.97/1.17 (step t55 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule contraction :premises (t54))
% 0.97/1.17 (step t56 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule resolution :premises (t49 t55))
% 0.97/1.17 (step t57 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule implies_neg2)
% 0.97/1.17 (step t58 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t56 t57))
% 0.97/1.17 (step t59 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule contraction :premises (t58))
% 0.97/1.17 (step t60 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule implies :premises (t59))
% 0.97/1.17 (step t61 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule resolution :premises (t48 t60))
% 0.97/1.17 (step t62 (cl (not (= (or (tptp.ssList tptp.sk7) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (tptp.ssList tptp.sk7) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (not (or (tptp.ssList tptp.sk7) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (or (tptp.ssList tptp.sk7) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule equiv_pos2)
% 0.97/1.17 (step t63 (cl (= (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk7))) :rule refl)
% 0.97/1.17 (step t64 (cl (= (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t65 (cl (= (or (tptp.ssList tptp.sk7) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (tptp.ssList tptp.sk7) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule cong :premises (t63 t64))
% 0.97/1.17 (step t66 (cl (or (tptp.ssList tptp.sk7) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t62 t65 a235))
% 0.97/1.17 (step t67 (cl (tptp.ssList tptp.sk7) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule or :premises (t66))
% 0.97/1.17 (step t68 (cl (not (= (or (tptp.ssItem tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (tptp.ssItem tptp.sk6) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (not (or (tptp.ssItem tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (or (tptp.ssItem tptp.sk6) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule equiv_pos2)
% 0.97/1.17 (step t69 (cl (= (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk6))) :rule refl)
% 0.97/1.17 (step t70 (cl (= (or (tptp.ssItem tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (tptp.ssItem tptp.sk6) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule cong :premises (t69 t64))
% 0.97/1.17 (step t71 (cl (or (tptp.ssItem tptp.sk6) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t68 t70 a229))
% 0.97/1.17 (step t72 (cl (tptp.ssItem tptp.sk6) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule or :premises (t71))
% 0.97/1.17 (step t73 (cl (not (= (or (tptp.ssItem tptp.sk5) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (tptp.ssItem tptp.sk5) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (not (or (tptp.ssItem tptp.sk5) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (or (tptp.ssItem tptp.sk5) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule equiv_pos2)
% 0.97/1.17 (step t74 (cl (= (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk5))) :rule refl)
% 0.97/1.17 (step t75 (cl (= (or (tptp.ssItem tptp.sk5) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (tptp.ssItem tptp.sk5) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule cong :premises (t74 t64))
% 0.97/1.17 (step t76 (cl (or (tptp.ssItem tptp.sk5) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t73 t75 a212))
% 0.97/1.17 (step t77 (cl (tptp.ssItem tptp.sk5) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule or :premises (t76))
% 0.97/1.17 (step t78 (cl (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule resolution :premises (t16 t67 t72 t77))
% 0.97/1.17 (step t79 (cl (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule contraction :premises (t78))
% 0.97/1.17 (step t80 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule reordering :premises (t79))
% 0.97/1.17 (step t81 (cl (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t33 t35 t37 t39 t41 t47 t61 a189 t80))
% 0.97/1.17 (step t82 (cl (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (tptp.ssList tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule contraction :premises (t81))
% 0.97/1.17 (step t83 (cl (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t82 t16))
% 0.97/1.17 (step t84 (cl (not (tptp.ssList tptp.sk13)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6))) :rule contraction :premises (t83))
% 0.97/1.17 (step t85 (cl (not (tptp.ssList tptp.sk13)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) :rule reordering :premises (t84))
% 0.97/1.17 (step t86 (cl (not (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssList tptp.sk13)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssList tptp.sk13)))) (not (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssList tptp.sk13))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssList tptp.sk13))) :rule equiv_pos2)
% 0.97/1.17 (step t87 (cl (= (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule all_simplify)
% 0.97/1.17 (step t88 (cl (= (tptp.ssList tptp.sk13) (tptp.ssList tptp.sk13))) :rule refl)
% 0.97/1.17 (step t89 (cl (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssList tptp.sk13)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssList tptp.sk13)))) :rule cong :premises (t87 t88))
% 0.97/1.17 (step t90 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssList tptp.sk13))) :rule resolution :premises (t86 t89 a238))
% 0.97/1.17 (step t91 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssList tptp.sk13)) :rule or :premises (t90))
% 0.97/1.17 (step t92 (cl (tptp.ssList tptp.sk13) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t91))
% 0.97/1.17 (step t93 (cl (tptp.ssList tptp.sk7) (tptp.ssList tptp.sk13)) :rule or :premises (a234))
% 0.97/1.17 (step t94 (cl (tptp.ssList tptp.sk13) (tptp.ssList tptp.sk7)) :rule reordering :premises (t93))
% 0.97/1.17 (step t95 (cl (tptp.ssItem tptp.sk6) (tptp.ssList tptp.sk13)) :rule or :premises (a228))
% 0.97/1.17 (step t96 (cl (tptp.ssList tptp.sk13) (tptp.ssItem tptp.sk6)) :rule reordering :premises (t95))
% 0.97/1.17 (step t97 (cl (tptp.ssItem tptp.sk5) (tptp.ssList tptp.sk13)) :rule or :premises (a211))
% 0.97/1.17 (step t98 (cl (tptp.ssList tptp.sk13) (tptp.ssItem tptp.sk5)) :rule reordering :premises (t97))
% 0.97/1.17 (step t99 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (tptp.ssList tptp.sk13) (tptp.ssList tptp.sk13) (tptp.ssList tptp.sk13) (tptp.ssList tptp.sk13)) :rule resolution :premises (t14 a189 t16 t92 t94 t96 t98))
% 0.97/1.17 (step t100 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (tptp.ssList tptp.sk13)) :rule contraction :premises (t99))
% 0.97/1.17 (step t101 (cl (tptp.ssList tptp.sk13) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule reordering :premises (t100))
% 0.97/1.17 (step t102 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t103)
% 0.97/1.17 (assume t103.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))
% 0.97/1.17 (step t103.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6) (:= C tptp.sk7)))
% 0.97/1.17 (step t103.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule or :premises (t103.t1))
% 0.97/1.17 (step t103.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule resolution :premises (t103.t2 t103.a0))
% 0.97/1.17 (step t103 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule subproof :discharge (t103.a0))
% 0.97/1.17 (step t104 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule resolution :premises (t102 t103))
% 0.97/1.17 (step t105 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule implies_neg2)
% 0.97/1.17 (step t106 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t104 t105))
% 0.97/1.17 (step t107 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule contraction :premises (t106))
% 0.97/1.17 (step t108 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule implies :premises (t107))
% 0.97/1.17 (step t109 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_pos2)
% 0.97/1.17 (step t110 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.97/1.17 (step t111 (cl (= (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) true) (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_simplify)
% 0.97/1.17 (step t112 (cl (not (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) true)) (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule equiv1 :premises (t111))
% 0.97/1.17 (step t113 (cl (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))))) :rule all_simplify)
% 0.97/1.17 (step t114 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule refl)
% 0.97/1.17 (step t115 (cl (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t116 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule cong :premises (t114 t115))
% 0.97/1.17 (step t117 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) true)) :rule all_simplify)
% 0.97/1.17 (step t118 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) true)) :rule trans :premises (t116 t117))
% 0.97/1.17 (step t119 (cl (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) true)) :rule trans :premises (t113 t118))
% 0.97/1.17 (step t120 (cl (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t112 t119))
% 0.97/1.17 (step t121 (cl (= (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule refl)
% 0.97/1.17 (step t122 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule cong :premises (t110 t120 t121))
% 0.97/1.17 (step t123 (cl (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule and_neg)
% 0.97/1.17 (step t124 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t125)
% 0.97/1.17 (assume t125.a0 (= tptp.sk1 tptp.sk3))
% 0.97/1.17 (assume t125.a1 (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))
% 0.97/1.17 (step t125.t1 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.97/1.17 (anchor :step t125.t2)
% 0.97/1.17 (assume t125.t2.a0 (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))
% 0.97/1.17 (assume t125.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.97/1.17 (step t125.t2.t1 (cl (= (= (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_simplify)
% 0.97/1.17 (step t125.t2.t2 (cl (not (= (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule equiv1 :premises (t125.t2.t1))
% 0.97/1.17 (step t125.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t125.t2.a1))
% 0.97/1.17 (step t125.t2.t4 (cl (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) :rule refl)
% 0.97/1.17 (step t125.t2.t5 (cl (= (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule cong :premises (t125.t2.t3 t125.t2.t4))
% 0.97/1.17 (step t125.t2.t6 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_simplify)
% 0.97/1.17 (step t125.t2.t7 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv2 :premises (t125.t2.t6))
% 0.97/1.17 (step t125.t2.t8 (cl (not (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) :rule not_not)
% 0.97/1.17 (step t125.t2.t9 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) :rule resolution :premises (t125.t2.t7 t125.t2.t8))
% 0.97/1.17 (step t125.t2.t10 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false)) :rule resolution :premises (t125.t2.t9 t125.t2.a0))
% 0.97/1.17 (step t125.t2.t11 (cl (= (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) false)) :rule trans :premises (t125.t2.t5 t125.t2.t10))
% 0.97/1.17 (step t125.t2.t12 (cl (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t125.t2.t2 t125.t2.t11))
% 0.97/1.17 (step t125.t2 (cl (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule subproof :discharge (t125.t2.a0 t125.t2.a1))
% 0.97/1.17 (step t125.t3 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule and_pos)
% 0.97/1.17 (step t125.t4 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.97/1.17 (step t125.t5 (cl (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t125.t2 t125.t3 t125.t4))
% 0.97/1.17 (step t125.t6 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule reordering :premises (t125.t5))
% 0.97/1.17 (step t125.t7 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule contraction :premises (t125.t6))
% 0.97/1.17 (step t125.t8 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t125.t1 t125.t7))
% 0.97/1.17 (step t125.t9 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule implies_neg2)
% 0.97/1.17 (step t125.t10 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (=> (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t125.t8 t125.t9))
% 0.97/1.17 (step t125.t11 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule contraction :premises (t125.t10))
% 0.97/1.17 (step t125.t12 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule implies :premises (t125.t11))
% 0.97/1.17 (step t125.t13 (cl (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.97/1.17 (step t125.t14 (cl (and (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t125.t13 t125.a1 t125.a0))
% 0.97/1.17 (step t125.t15 (cl (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t125.t12 t125.t14))
% 0.97/1.17 (step t125 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule subproof :discharge (t125.a0 t125.a1))
% 0.97/1.17 (step t126 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.97/1.17 (step t127 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule and_pos)
% 0.97/1.17 (step t128 (cl (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule resolution :premises (t125 t126 t127))
% 0.97/1.17 (step t129 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule reordering :premises (t128))
% 0.97/1.17 (step t130 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule contraction :premises (t129))
% 0.97/1.17 (step t131 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t124 t130))
% 0.97/1.17 (step t132 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule implies_neg2)
% 0.97/1.17 (step t133 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t131 t132))
% 0.97/1.17 (step t134 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule contraction :premises (t133))
% 0.97/1.17 (step t135 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule implies :premises (t134))
% 0.97/1.17 (step t136 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t123 t135))
% 0.97/1.17 (step t137 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.97/1.17 (step t138 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule or_neg)
% 0.97/1.17 (step t139 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule or_neg)
% 0.97/1.17 (step t140 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t136 t137 t138 t139))
% 0.97/1.17 (step t141 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule contraction :premises (t140))
% 0.97/1.17 (step t142 (cl (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t109 t122 t141))
% 0.97/1.17 (step t143 (cl (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule or :premises (t142))
% 0.97/1.17 (step t144 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule reordering :premises (t143))
% 0.97/1.17 (step t145 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (or (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))))) (or (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t146 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t146.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t146.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t146.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t146.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t146.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t146.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t146.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))) :rule all_simplify)
% 0.97/1.17 (step t146.t8 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) :rule cong :premises (t146.t7))
% 0.97/1.17 (step t146.t9 (cl (= (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t146.t10 (cl (= (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule cong :premises (t146.t9))
% 0.97/1.17 (step t146.t11 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule cong :premises (t146.t4 t146.t5 t146.t6 t146.t8 t146.t10))
% 0.97/1.17 (step t146 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))))) :rule bind)
% 0.97/1.17 (step t147 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) (or (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule all_simplify)
% 0.97/1.17 (step t148 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (or (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule trans :premises (t146 t147))
% 0.97/1.17 (step t149 (cl (or (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule resolution :premises (t145 t148 a200))
% 0.97/1.17 (step t150 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule or :premises (t149))
% 0.97/1.17 (step t151 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t152 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t152.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t152.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t152.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t152.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t152.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t152.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t152.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))) :rule all_simplify)
% 0.97/1.17 (step t152.t8 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) :rule cong :premises (t152.t7))
% 0.97/1.17 (step t152.t9 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule cong :premises (t152.t4 t152.t5 t152.t6 t152.t8 t64))
% 0.97/1.17 (step t152 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))))) :rule bind)
% 0.97/1.17 (step t153 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule all_simplify)
% 0.97/1.17 (step t154 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule trans :premises (t152 t153))
% 0.97/1.17 (step t155 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule resolution :premises (t151 t154 a199))
% 0.97/1.17 (step t156 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule or :premises (t155))
% 0.97/1.17 (step t157 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk13))) (or (tptp.ssList tptp.sk13) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk13)))) (or (tptp.ssList tptp.sk13) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t158 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t158.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t158.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t158.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t158.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t158.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t158.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t158.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))) :rule all_simplify)
% 0.97/1.17 (step t158.t8 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) :rule cong :premises (t158.t7))
% 0.97/1.17 (step t158.t9 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk13)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssList tptp.sk13)))) :rule cong :premises (t158.t4 t158.t5 t158.t6 t158.t8 t88))
% 0.97/1.17 (step t158 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk13))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssList tptp.sk13))))) :rule bind)
% 0.97/1.17 (step t159 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssList tptp.sk13))) (or (tptp.ssList tptp.sk13) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule all_simplify)
% 0.97/1.17 (step t160 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssList tptp.sk13))) (or (tptp.ssList tptp.sk13) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule trans :premises (t158 t159))
% 0.97/1.17 (step t161 (cl (or (tptp.ssList tptp.sk13) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule resolution :premises (t157 t160 a198))
% 0.97/1.17 (step t162 (cl (tptp.ssList tptp.sk13) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule or :premises (t161))
% 0.97/1.17 (step t163 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (= A A) (= B B) (= C C)))
% 0.97/1.17 (step t164 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv2 :premises (t163))
% 0.97/1.17 (step t165 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (= A A) (= B B) (= C C)))
% 0.97/1.17 (step t166 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv2 :premises (t165))
% 0.97/1.17 (step t167 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (= A A) (= B B) (= C C)))
% 0.97/1.17 (step t168 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv2 :premises (t167))
% 0.97/1.17 (step t169 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4)))) (or (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4))))) (or (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t170 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D) (E $$unsorted) (:= E E) (F $$unsorted) (:= F F)))
% 0.97/1.17 (step t170.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t170.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t170.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t170.t4 (cl (= D D)) :rule refl)
% 0.97/1.17 (step t170.t5 (cl (= E E)) :rule refl)
% 0.97/1.17 (step t170.t6 (cl (= F F)) :rule refl)
% 0.97/1.17 (step t170.t7 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t170.t8 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t170.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t170.t10 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))) :rule all_simplify)
% 0.97/1.17 (step t170.t11 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) :rule cong :premises (t170.t10))
% 0.97/1.17 (step t170.t12 (cl (= (not (tptp.ssItem D)) (not (tptp.ssItem D)))) :rule refl)
% 0.97/1.17 (step t170.t13 (cl (= (not (tptp.ssItem E)) (not (tptp.ssItem E)))) :rule refl)
% 0.97/1.17 (step t170.t14 (cl (= (not (tptp.ssList F)) (not (tptp.ssList F)))) :rule refl)
% 0.97/1.17 (step t170.t15 (cl (= (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t170.t16 (cl (= (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t170.t17 (cl (= (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) :rule cong :premises (t170.t16))
% 0.97/1.17 (step t170.t18 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4))) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) :rule cong :premises (t170.t7 t170.t8 t170.t9 t170.t11 t170.t12 t170.t13 t170.t14 t170.t15 t170.t17))
% 0.97/1.17 (step t170 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))))) :rule bind)
% 0.97/1.17 (step t171 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (or (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))))) :rule all_simplify)
% 0.97/1.17 (step t172 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)) tptp.sk4)))) (or (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))))) :rule trans :premises (t170 t171))
% 0.97/1.17 (step t173 (cl (or (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))))) :rule resolution :premises (t169 t172 a191))
% 0.97/1.17 (step t174 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil))))))) :rule or :premises (t173))
% 0.97/1.17 (step t175 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule resolution :premises (t37 t144 a190 t61 a189 t150 t156 t162 t33 t164 t166 t168 t174))
% 0.97/1.17 (step t176 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule contraction :premises (t175))
% 0.97/1.17 (step t177 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule reordering :premises (t176))
% 0.97/1.17 (step t178 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk12))) (or (tptp.ssItem tptp.sk12) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk12)))) (or (tptp.ssItem tptp.sk12) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t179 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t179.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t179.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t179.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t179.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t179.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t179.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t179.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))) :rule all_simplify)
% 0.97/1.17 (step t179.t8 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) :rule cong :premises (t179.t7))
% 0.97/1.17 (step t179.t9 (cl (= (tptp.ssItem tptp.sk12) (tptp.ssItem tptp.sk12))) :rule refl)
% 0.97/1.17 (step t179.t10 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk12)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssItem tptp.sk12)))) :rule cong :premises (t179.t4 t179.t5 t179.t6 t179.t8 t179.t9))
% 0.97/1.17 (step t179 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk12))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssItem tptp.sk12))))) :rule bind)
% 0.97/1.17 (step t180 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssItem tptp.sk12))) (or (tptp.ssItem tptp.sk12) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule all_simplify)
% 0.97/1.17 (step t181 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk12))) (or (tptp.ssItem tptp.sk12) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule trans :premises (t179 t180))
% 0.97/1.17 (step t182 (cl (or (tptp.ssItem tptp.sk12) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule resolution :premises (t178 t181 a197))
% 0.97/1.17 (step t183 (cl (tptp.ssItem tptp.sk12) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule or :premises (t182))
% 0.97/1.17 (step t184 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk11))) (or (tptp.ssItem tptp.sk11) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk11)))) (or (tptp.ssItem tptp.sk11) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t185 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t185.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t185.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t185.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t185.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t185.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t185.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t185.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))) :rule all_simplify)
% 0.97/1.17 (step t185.t8 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) :rule cong :premises (t185.t7))
% 0.97/1.17 (step t185.t9 (cl (= (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk11))) :rule refl)
% 0.97/1.17 (step t185.t10 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk11)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssItem tptp.sk11)))) :rule cong :premises (t185.t4 t185.t5 t185.t6 t185.t8 t185.t9))
% 0.97/1.17 (step t185 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk11))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssItem tptp.sk11))))) :rule bind)
% 0.97/1.17 (step t186 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))) (tptp.ssItem tptp.sk11))) (or (tptp.ssItem tptp.sk11) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule all_simplify)
% 0.97/1.17 (step t187 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C) tptp.sk4)) (tptp.ssItem tptp.sk11))) (or (tptp.ssItem tptp.sk11) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))))) :rule trans :premises (t185 t186))
% 0.97/1.17 (step t188 (cl (or (tptp.ssItem tptp.sk11) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule resolution :premises (t184 t187 a196))
% 0.97/1.17 (step t189 (cl (tptp.ssItem tptp.sk11) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule or :premises (t188))
% 0.97/1.17 (step t190 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (= A A) (= B B) (= C C)))
% 0.97/1.17 (step t191 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv2 :premises (t190))
% 0.97/1.17 (step t192 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (= A A) (= B B) (= C C)))
% 0.97/1.17 (step t193 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))))) :rule equiv2 :premises (t192))
% 0.97/1.17 (step t194 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule resolution :premises (t177 t183 t189 t191 t193))
% 0.97/1.17 (step t195 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) (tptp.cons B tptp.nil)) C)))))) :rule contraction :premises (t194))
% 0.97/1.17 (step t196 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) :rule resolution :premises (t108 t195))
% 0.97/1.17 (step t197 (cl (tptp.ssList tptp.sk13)) :rule resolution :premises (t101 t196))
% 0.97/1.17 (step t198 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t20 t26 t33 t85 t197 t196 t37 t197))
% 0.97/1.17 (step t199 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule contraction :premises (t198))
% 0.97/1.17 (step t200 (cl (not (= (or (tptp.ssList tptp.sk7) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (tptp.ssList tptp.sk7) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) (not (or (tptp.ssList tptp.sk7) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (or (tptp.ssList tptp.sk7) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_pos2)
% 0.97/1.17 (step t201 (cl (= (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t202 (cl (= (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule cong :premises (t201))
% 0.97/1.17 (step t203 (cl (= (or (tptp.ssList tptp.sk7) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (tptp.ssList tptp.sk7) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule cong :premises (t63 t202))
% 0.97/1.17 (step t204 (cl (or (tptp.ssList tptp.sk7) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t200 t203 a236))
% 0.97/1.17 (step t205 (cl (tptp.ssList tptp.sk7) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule or :premises (t204))
% 0.97/1.17 (step t206 (cl (not (= (or (tptp.ssItem tptp.sk6) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (tptp.ssItem tptp.sk6) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) (not (or (tptp.ssItem tptp.sk6) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (or (tptp.ssItem tptp.sk6) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_pos2)
% 0.97/1.17 (step t207 (cl (= (or (tptp.ssItem tptp.sk6) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (tptp.ssItem tptp.sk6) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule cong :premises (t69 t202))
% 0.97/1.17 (step t208 (cl (or (tptp.ssItem tptp.sk6) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t206 t207 a230))
% 0.97/1.17 (step t209 (cl (tptp.ssItem tptp.sk6) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule or :premises (t208))
% 0.97/1.17 (step t210 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule resolution :premises (t16 t205 t209))
% 0.97/1.17 (step t211 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule contraction :premises (t210))
% 0.97/1.17 (step t212 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule reordering :premises (t211))
% 0.97/1.17 (step t213 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t199 t144 a190 t61 a189 t212 t196 t80 t196))
% 0.97/1.17 (step t214 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule contraction :premises (t213))
% 0.97/1.17 (step t215 (cl (= (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule hole :args ((forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (= D A) (= E B) (= F C)))
% 0.97/1.17 (step t216 (cl (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv2 :premises (t215))
% 0.97/1.17 (step t217 (cl (not (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) (not (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_pos2)
% 0.97/1.17 (step t218 (cl (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule cong :premises (t87 t202))
% 0.97/1.17 (step t219 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t217 t218 a240))
% 0.97/1.17 (step t220 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule or :premises (t219))
% 0.97/1.17 (step t221 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t220))
% 0.97/1.17 (step t222 (cl (not (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) (not (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule equiv_pos2)
% 0.97/1.17 (step t223 (cl (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (= (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)) tptp.sk2)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))))) :rule cong :premises (t87 t64))
% 0.97/1.17 (step t224 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))))) :rule resolution :premises (t222 t223 a239))
% 0.97/1.17 (step t225 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil)))) :rule or :premises (t224))
% 0.97/1.17 (step t226 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk11 tptp.nil) tptp.sk13) (tptp.cons tptp.sk12 tptp.nil))) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t225))
% 0.97/1.17 (step t227 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t228 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t228.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t228.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t228.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t228.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t228.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t228.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t228.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t228.t8 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t228.t9 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) :rule cong :premises (t228.t8))
% 0.97/1.17 (step t228.t10 (cl (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule cong :premises (t87 t228.t4 t228.t5 t228.t6 t228.t7 t228.t9))
% 0.97/1.17 (step t228 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule bind)
% 0.97/1.17 (step t229 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule all_simplify)
% 0.97/1.17 (step t230 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule trans :premises (t228 t229))
% 0.97/1.17 (step t231 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule resolution :premises (t227 t230 a204))
% 0.97/1.17 (step t232 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule or :premises (t231))
% 0.97/1.17 (step t233 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule resolution :premises (t37 t33 t144 a190 t61 a189 t216 t221 t226 t232 t101 t108 t177))
% 0.97/1.17 (step t234 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule contraction :premises (t233))
% 0.97/1.17 (step t235 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule reordering :premises (t234))
% 0.97/1.17 (step t236 (cl (= (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule hole :args ((forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (= D A) (= E B) (= F C)))
% 0.97/1.17 (step t237 (cl (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (not (tptp.ssItem D)) (not (tptp.ssItem E)) (not (tptp.ssList F)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons E tptp.nil) F) (tptp.cons D tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons D tptp.nil) F) (tptp.cons E tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv2 :premises (t236))
% 0.97/1.17 (step t238 (cl (not (= (or (tptp.ssItem tptp.sk5) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (tptp.ssItem tptp.sk5) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) (not (or (tptp.ssItem tptp.sk5) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1)))) (or (tptp.ssItem tptp.sk5) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule equiv_pos2)
% 0.97/1.17 (step t239 (cl (= (or (tptp.ssItem tptp.sk5) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)) tptp.sk1))) (or (tptp.ssItem tptp.sk5) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))))) :rule cong :premises (t74 t202))
% 0.97/1.17 (step t240 (cl (or (tptp.ssItem tptp.sk5) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil)))))) :rule resolution :premises (t238 t239 a213))
% 0.97/1.17 (step t241 (cl (tptp.ssItem tptp.sk5) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.cons tptp.sk12 tptp.nil) tptp.sk13) (tptp.cons tptp.sk11 tptp.nil))))) :rule or :premises (t240))
% 0.97/1.17 (step t242 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (tptp.ssItem tptp.sk5) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))))) (or (tptp.ssItem tptp.sk5) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule equiv_pos2)
% 0.97/1.17 (anchor :step t243 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 0.97/1.17 (step t243.t1 (cl (= A A)) :rule refl)
% 0.97/1.17 (step t243.t2 (cl (= B B)) :rule refl)
% 0.97/1.17 (step t243.t3 (cl (= C C)) :rule refl)
% 0.97/1.17 (step t243.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 0.97/1.17 (step t243.t5 (cl (= (not (tptp.ssItem B)) (not (tptp.ssItem B)))) :rule refl)
% 0.97/1.17 (step t243.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.97/1.17 (step t243.t7 (cl (= (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t243.t8 (cl (= (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))) :rule all_simplify)
% 0.97/1.17 (step t243.t9 (cl (= (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) :rule cong :premises (t243.t8))
% 0.97/1.17 (step t243.t10 (cl (= (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4))) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule cong :premises (t74 t243.t4 t243.t5 t243.t6 t243.t7 t243.t9))
% 0.97/1.17 (step t243 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule bind)
% 0.97/1.17 (step t244 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))) (or (tptp.ssItem tptp.sk5) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule all_simplify)
% 0.97/1.17 (step t245 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.ssItem tptp.sk5) (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)) tptp.sk4)))) (or (tptp.ssItem tptp.sk5) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))))) :rule trans :premises (t243 t244))
% 0.97/1.17 (step t246 (cl (or (tptp.ssItem tptp.sk5) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil)))))))) :rule resolution :premises (t242 t245 a201))
% 0.97/1.17 (step t247 (cl (tptp.ssItem tptp.sk5) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssItem B)) (not (tptp.ssList C)) (= tptp.sk3 (tptp.app (tptp.app (tptp.cons B tptp.nil) C) (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons A tptp.nil) C) (tptp.cons B tptp.nil))))))) :rule or :premises (t246))
% 0.97/1.17 (step t248 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk5) (not (= tptp.sk2 tptp.sk4)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t37 t33 t144 a190 t237 t241 t247 t61 t80 t14 t235 t101))
% 0.97/1.17 (step t249 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (tptp.ssItem tptp.sk5) (not (= tptp.sk2 tptp.sk4)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))))) :rule contraction :premises (t248))
% 0.97/1.17 (step t250 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (tptp.ssItem tptp.sk5) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule resolution :premises (t249 t108 t177 a189))
% 0.97/1.17 (step t251 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (tptp.ssItem tptp.sk5)) :rule contraction :premises (t250))
% 0.97/1.17 (step t252 (cl (tptp.ssItem tptp.sk5) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule reordering :premises (t251))
% 0.97/1.17 (step t253 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12)) (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule resolution :premises (t214 t14 a189 t235 t252))
% 0.97/1.17 (step t254 (cl (not (tptp.ssItem tptp.sk11)) (not (tptp.ssItem tptp.sk12))) :rule contraction :premises (t253))
% 0.97/1.17 (step t255 (cl (not (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk11)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk11)))) (not (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk11))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk11))) :rule equiv_pos2)
% 0.97/1.17 (step t256 (cl (= (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk11))) :rule refl)
% 0.97/1.17 (step t257 (cl (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk11)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk11)))) :rule cong :premises (t87 t256))
% 0.97/1.17 (step t258 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk11))) :rule resolution :premises (t255 t257 a232))
% 0.97/1.17 (step t259 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk11)) :rule or :premises (t258))
% 0.97/1.17 (step t260 (cl (tptp.ssItem tptp.sk11) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t259))
% 0.97/1.17 (step t261 (cl (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk11)) :rule or :premises (a226))
% 0.97/1.17 (step t262 (cl (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk6)) :rule reordering :premises (t261))
% 0.97/1.17 (step t263 (cl (tptp.ssItem tptp.sk5) (tptp.ssItem tptp.sk11)) :rule or :premises (a209))
% 0.97/1.17 (step t264 (cl (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk5)) :rule reordering :premises (t263))
% 0.97/1.17 (step t265 (cl (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk11) (tptp.ssItem tptp.sk11)) :rule resolution :premises (t14 a189 t16 t196 t260 t41 t262 t264))
% 0.97/1.17 (step t266 (cl (tptp.ssItem tptp.sk11)) :rule contraction :premises (t265))
% 0.97/1.17 (step t267 (cl (not (tptp.ssItem tptp.sk12))) :rule resolution :premises (t254 t266))
% 0.97/1.17 (step t268 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t18 t267))
% 0.97/1.17 (step t269 (cl (tptp.ssItem tptp.sk6) (tptp.ssItem tptp.sk12)) :rule or :premises (a227))
% 0.97/1.17 (step t270 (cl (tptp.ssItem tptp.sk12) (tptp.ssItem tptp.sk6)) :rule reordering :premises (t269))
% 0.97/1.17 (step t271 (cl (tptp.ssItem tptp.sk6)) :rule resolution :premises (t270 t267))
% 0.97/1.17 (step t272 (cl (tptp.ssList tptp.sk7)) :rule resolution :premises (t39 t267))
% 0.97/1.17 (step t273 (cl (not (= tptp.sk4 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t16 t268 t271 t272 t196))
% 0.97/1.17 (step t274 (cl (not (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk12)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk12)))) (not (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk12))) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk12))) :rule equiv_pos2)
% 0.97/1.17 (step t275 (cl (= (tptp.ssItem tptp.sk12) (tptp.ssItem tptp.sk12))) :rule refl)
% 0.97/1.17 (step t276 (cl (= (or (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7) tptp.sk2) (tptp.ssItem tptp.sk12)) (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk12)))) :rule cong :premises (t87 t275))
% 0.97/1.17 (step t277 (cl (or (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk12))) :rule resolution :premises (t274 t276 a237))
% 0.97/1.17 (step t278 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7)) (tptp.ssItem tptp.sk12)) :rule or :premises (t277))
% 0.97/1.17 (step t279 (cl (tptp.ssItem tptp.sk12) (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule reordering :premises (t278))
% 0.97/1.17 (step t280 (cl (= tptp.sk2 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk7))) :rule resolution :premises (t279 t267))
% 0.97/1.17 (step t281 (cl) :rule resolution :premises (t14 t273 t280 a189))
% 0.97/1.17
% 0.97/1.18 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.wZHV8I529c/cvc5---1.0.5_6662.smt2
% 0.97/1.18 % cvc5---1.0.5 exiting
% 0.97/1.18 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------