%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWC344-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 18:01:37 EDT 2024

% Result   : Unsatisfiable 25.70s 26.26s
% Output   : Proof 27.83s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14  % Problem    : SWC344-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sun May 26 14:46:24 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.21/0.57  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.57  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.52/10.77  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.60/15.80  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.62/20.83  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.66/25.86  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 25.70/26.26  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.ruWhwh3zB8/cvc5---1.0.5_8039.smt2
% 25.70/26.26  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.ruWhwh3zB8/cvc5---1.0.5_8039.smt2
% 27.74/28.00  (assume a0 (tptp.equalelemsP tptp.nil))
% 27.74/28.00  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 27.74/28.00  (assume a2 (tptp.strictorderedP tptp.nil))
% 27.74/28.00  (assume a3 (tptp.totalorderedP tptp.nil))
% 27.74/28.00  (assume a4 (tptp.strictorderP tptp.nil))
% 27.74/28.00  (assume a5 (tptp.totalorderP tptp.nil))
% 27.74/28.00  (assume a6 (tptp.cyclefreeP tptp.nil))
% 27.74/28.00  (assume a7 (tptp.ssList tptp.nil))
% 27.74/28.00  (assume a8 (tptp.ssItem tptp.skac3))
% 27.74/28.00  (assume a9 (tptp.ssItem tptp.skac2))
% 27.74/28.00  (assume a10 (not (tptp.singletonP tptp.nil)))
% 27.74/28.00  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 27.74/28.00  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 27.74/28.00  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 27.74/28.00  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 27.74/28.00  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 27.74/28.00  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 27.74/28.00  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 27.74/28.00  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 27.74/28.00  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 27.74/28.00  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 27.74/28.00  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 27.74/28.00  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 27.74/28.00  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 27.74/28.00  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 27.74/28.00  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 27.74/28.00  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 27.74/28.00  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 27.74/28.00  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 27.74/28.00  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 27.74/28.00  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 27.74/28.00  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 27.74/28.00  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 27.74/28.00  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 27.74/28.00  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 27.74/28.00  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 27.74/28.00  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 27.74/28.00  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 27.74/28.00  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 27.74/28.00  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 27.74/28.00  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 27.74/28.00  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 27.74/28.00  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 27.74/28.00  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 27.74/28.00  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 27.74/28.00  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 27.74/28.00  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 27.74/28.00  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 27.74/28.00  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 27.74/28.00  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 27.74/28.00  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 27.74/28.00  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 27.74/28.00  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 27.74/28.00  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 27.74/28.00  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 27.74/28.00  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 27.74/28.00  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 27.74/28.00  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 27.74/28.00  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 27.74/28.00  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 27.74/28.00  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 27.74/28.00  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 27.74/28.00  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 27.74/28.00  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 27.74/28.00  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 27.74/28.00  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 27.74/28.00  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 27.74/28.00  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 27.74/28.00  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 27.74/28.00  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 27.74/28.00  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 27.74/28.00  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 27.74/28.00  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 27.74/28.00  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 27.74/28.00  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 27.74/28.00  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 27.74/28.00  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 27.74/28.00  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 27.74/28.00  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 27.74/28.00  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 27.74/28.00  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 27.74/28.00  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 27.74/28.00  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 27.74/28.00  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 27.74/28.00  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 27.74/28.00  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 27.74/28.00  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 27.74/28.00  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 27.74/28.00  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 27.74/28.00  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 27.74/28.00  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 27.74/28.00  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 27.74/28.00  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 27.74/28.00  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 27.74/28.00  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 27.74/28.00  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 27.74/28.00  (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))))
% 27.74/28.00  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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))))
% 27.74/28.00  (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)))))
% 27.74/28.00  (assume a185 (tptp.ssList tptp.sk1))
% 27.74/28.00  (assume a186 (tptp.ssList tptp.sk2))
% 27.74/28.00  (assume a187 (tptp.ssList tptp.sk3))
% 27.74/28.00  (assume a188 (tptp.ssList tptp.sk4))
% 27.74/28.00  (assume a189 (= tptp.sk2 tptp.sk4))
% 27.74/28.00  (assume a190 (= tptp.sk1 tptp.sk3))
% 27.74/28.00  (assume a191 (tptp.ssList tptp.sk5))
% 27.74/28.00  (assume a192 (tptp.ssList tptp.sk6))
% 27.74/28.00  (assume a193 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4))
% 27.74/28.00  (assume a194 (tptp.strictorderedP tptp.sk3))
% 27.74/28.00  (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.lt A C)))))
% 27.74/28.00  (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))))
% 27.74/28.00  (assume a197 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 27.74/28.00  (assume a198 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a199 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a200 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a201 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a202 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a203 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a204 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a205 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a206 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a207 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a208 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a209 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a210 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a211 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a212 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a213 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a214 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a215 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a216 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a217 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a218 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a219 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a220 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a221 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a222 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a223 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a224 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a225 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a226 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a227 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a228 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a229 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a230 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a231 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a232 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a233 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a234 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a235 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a236 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a237 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a238 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a239 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a240 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a241 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a242 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a243 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a244 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a245 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a246 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a247 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))
% 27.74/28.00  (assume a248 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a249 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a250 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a251 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a252 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a253 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a254 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a255 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a256 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a257 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a258 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a259 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a260 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a261 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a262 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a263 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a264 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a265 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a266 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a267 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a268 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a269 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a270 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a271 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a272 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a273 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a274 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a275 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a276 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a277 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a278 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a279 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a280 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a281 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a282 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a283 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a284 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a285 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a286 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a287 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a288 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a289 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a290 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a291 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a292 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a293 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a294 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (assume a295 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))
% 27.74/28.00  (step t1 (cl (not (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.74/28.00  (step t2 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t1))
% 27.74/28.00  (step t3 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.00  (step t4 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3))
% 27.74/28.00  (step t5 (cl (not (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.74/28.00  (step t6 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t5))
% 27.74/28.00  (step t7 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t8)
% 27.74/28.00  (assume t8.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))
% 27.74/28.00  (step t8.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A (tptp.sk11 tptp.sk6 tptp.sk5)) (:= B (tptp.sk12 tptp.sk6 tptp.sk5)) (:= C (tptp.sk13 tptp.sk6 tptp.sk5)) (:= D (tptp.sk14 tptp.sk6 tptp.sk5))))
% 27.74/28.00  (step t8.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule or :premises (t8.t1))
% 27.74/28.00  (step t8.t3 (cl (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t8.t2 t8.a0))
% 27.74/28.00  (step t8 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t8.a0))
% 27.74/28.00  (step t9 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t7 t8))
% 27.74/28.00  (step t10 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.74/28.00  (step t11 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t9 t10))
% 27.74/28.00  (step t12 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t11))
% 27.74/28.00  (step t13 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies :premises (t12))
% 27.74/28.00  (step t14 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule equiv_pos2)
% 27.74/28.00  (anchor :step t15 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 27.74/28.00  (step t15.t1 (cl (= A A)) :rule refl)
% 27.74/28.00  (step t15.t2 (cl (= B B)) :rule refl)
% 27.74/28.00  (step t15.t3 (cl (= C C)) :rule refl)
% 27.74/28.00  (step t15.t4 (cl (= D D)) :rule refl)
% 27.74/28.00  (step t15.t5 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 27.74/28.00  (step t15.t6 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.74/28.00  (step t15.t7 (cl (= (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6) (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B)))) :rule all_simplify)
% 27.74/28.00  (step t15.t8 (cl (= (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))))) :rule cong :premises (t15.t7))
% 27.74/28.00  (step t15.t9 (cl (= (not (tptp.ssItem C)) (not (tptp.ssItem C)))) :rule refl)
% 27.74/28.00  (step t15.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 27.74/28.00  (step t15.t11 (cl (= (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil))))) :rule all_simplify)
% 27.74/28.00  (step t15.t12 (cl (= (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))))) :rule cong :premises (t15.t11))
% 27.74/28.00  (step t15.t13 (cl (= (not (tptp.lt C A)) (not (tptp.lt C A)))) :rule refl)
% 27.74/28.00  (step t15.t14 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule cong :premises (t15.t5 t15.t6 t15.t8 t15.t9 t15.t10 t15.t12 t15.t13))
% 27.74/28.00  (step t15 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A)))))) :rule bind)
% 27.74/28.00  (step t16 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk6 (tptp.app (tptp.cons A tptp.nil) B))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app D (tptp.cons C tptp.nil)))) (not (tptp.lt C A))))) :rule resolution :premises (t14 t15 a196))
% 27.74/28.00  (step t17 (cl (or (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t13 t16))
% 27.74/28.00  (step t18 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.00  (step t19 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t18))
% 27.74/28.00  (step t20 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.74/28.00  (step t21 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.74/28.00  (step t22 (cl (= (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk5)))) :rule refl)
% 27.74/28.00  (step t23 (cl (= (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)))) :rule refl)
% 27.74/28.00  (step t24 (cl (= (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true)) :rule all_simplify)
% 27.74/28.00  (step t25 (cl (= (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not true))) :rule cong :premises (t24))
% 27.74/28.00  (step t26 (cl (= (not true) false)) :rule all_simplify)
% 27.74/28.00  (step t27 (cl (= (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) false)) :rule trans :premises (t25 t26))
% 27.74/28.00  (step t28 (cl (= (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.74/28.00  (step t29 (cl (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.74/28.00  (step t30 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t28 t29))
% 27.74/28.00  (step t31 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.74/28.00  (step t32 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t30 t31))
% 27.74/28.00  (step t33 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t21 t32))
% 27.74/28.00  (step t34 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t35)
% 27.74/28.00  (assume t35.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.74/28.00  (step t35.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.74/28.00  (step t35.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t35.t1))
% 27.74/28.00  (step t35.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t35.t2 t35.a0))
% 27.74/28.00  (step t35 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t35.a0))
% 27.74/28.00  (step t36 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t34 t35))
% 27.74/28.00  (step t37 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.00  (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t36 t37))
% 27.74/28.00  (step t39 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t38))
% 27.74/28.00  (step t40 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t20 t33 t39))
% 27.74/28.00  (step t41 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t40))
% 27.74/28.00  (step t42 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.74/28.00  (anchor :step t43 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.74/28.00  (step t43.t1 (cl (= A A)) :rule refl)
% 27.74/28.00  (step t43.t2 (cl (= B B)) :rule refl)
% 27.74/28.00  (step t43.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.74/28.00  (step t43.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.74/28.00  (step t43.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.74/28.00  (step t43.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t43.t5))
% 27.74/28.00  (step t43.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.74/28.00  (step t43.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.74/28.00  (step t43.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.74/28.00  (step t43.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.74/28.00  (step t43.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t43.t3 t43.t4 t43.t6 t43.t7 t43.t8 t43.t9 t43.t10))
% 27.74/28.00  (step t43 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.74/28.00  (step t44 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.74/28.00  (step t45 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t43 t44))
% 27.74/28.00  (step t46 (cl (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 27.74/28.00  (step t47 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (a193))
% 27.74/28.00  (step t48 (cl (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t46 t47 a190 a189))
% 27.74/28.00  (step t49 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.74/28.00  (step t50 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t49))
% 27.74/28.00  (step t51 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t50))
% 27.74/28.00  (step t52 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.74/28.00  (step t53 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t52 t49))
% 27.74/28.00  (anchor :step t54 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.74/28.00  (step t54.t1 (cl (= A A)) :rule refl)
% 27.74/28.00  (step t54.t2 (cl (= B B)) :rule refl)
% 27.74/28.00  (step t54.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.74/28.00  (step t54.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.74/28.00  (step t54.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.74/28.00  (step t54.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.74/28.00  (step t54.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t54.t5 t54.t6))
% 27.74/28.00  (step t54.t8 (cl (= A A)) :rule refl)
% 27.74/28.00  (step t54.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t54.t8 t49))
% 27.74/28.00  (step t54.t10 (cl (= B B)) :rule refl)
% 27.74/28.00  (step t54.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t54.t9 t54.t10))
% 27.74/28.00  (step t54.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t54.t7 t54.t11))
% 27.74/28.00  (step t54.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t54.t12))
% 27.74/28.00  (step t54.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.74/28.00  (step t54.t15 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.74/28.00  (step t54.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t54.t3 t54.t4 t54.t13 t54.t14 t54.t15))
% 27.74/28.00  (step t54 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.74/28.00  (step t55 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t51 t53 t54))
% 27.74/28.00  (step t56 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t45 t55))
% 27.74/28.00  (step t57 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t42 t56 a217))
% 27.74/28.00  (step t58 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t57))
% 27.74/28.00  (step t59 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t58))
% 27.74/28.00  (step t60 (cl (not (= (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))) (or (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (= tptp.nil tptp.sk3))))) (not (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3)))) (or (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 27.74/28.00  (step t61 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.74/28.00  (step t62 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.74/28.00  (step t63 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t61 t62))
% 27.74/28.00  (step t64 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 27.74/28.00  (step t65 (cl (= (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))) (or (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (= tptp.nil tptp.sk3))))) :rule cong :premises (t63 t64))
% 27.74/28.00  (step t66 (cl (or (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t60 t65 a197))
% 27.74/28.00  (step t67 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (= tptp.nil tptp.sk3))) :rule or :premises (t66))
% 27.74/28.00  (step t68 (cl (not (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule reordering :premises (t67))
% 27.74/28.00  (step t69 (cl (not (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or_pos)
% 27.74/28.00  (step t70 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))))) :rule reordering :premises (t69))
% 27.74/28.00  (step t71 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t72)
% 27.74/28.00  (assume t72.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))))
% 27.74/28.00  (step t72.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))))) :rule forall_inst :args ((:= A (tptp.sk13 tptp.sk6 tptp.sk6)) (:= B (tptp.sk14 tptp.sk6 tptp.sk5)) (:= C (tptp.sk11 tptp.sk6 tptp.sk6)) (:= D (tptp.sk12 tptp.sk6 tptp.sk5))))
% 27.74/28.00  (step t72.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule or :premises (t72.t1))
% 27.74/28.00  (step t72.t3 (cl (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t72.t2 t72.a0))
% 27.74/28.00  (step t72 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t72.a0))
% 27.74/28.00  (step t73 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t71 t72))
% 27.74/28.00  (step t74 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.74/28.00  (step t75 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t73 t74))
% 27.74/28.00  (step t76 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t75))
% 27.74/28.00  (step t77 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies :premises (t76))
% 27.74/28.00  (step t78 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.lt A C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.lt A C))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) :rule equiv_pos2)
% 27.74/28.00  (anchor :step t79 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 27.74/28.00  (step t79.t1 (cl (= A A)) :rule refl)
% 27.74/28.00  (step t79.t2 (cl (= B B)) :rule refl)
% 27.74/28.00  (step t79.t3 (cl (= C C)) :rule refl)
% 27.74/28.00  (step t79.t4 (cl (= D D)) :rule refl)
% 27.74/28.00  (step t79.t5 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 27.74/28.00  (step t79.t6 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.74/28.00  (step t79.t7 (cl (= (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5) (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil))))) :rule all_simplify)
% 27.74/28.00  (step t79.t8 (cl (= (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))))) :rule cong :premises (t79.t7))
% 27.74/28.00  (step t79.t9 (cl (= (not (tptp.ssItem C)) (not (tptp.ssItem C)))) :rule refl)
% 27.74/28.00  (step t79.t10 (cl (= (not (tptp.ssList D)) (not (tptp.ssList D)))) :rule refl)
% 27.74/28.00  (step t79.t11 (cl (= (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D)))) :rule all_simplify)
% 27.74/28.00  (step t79.t12 (cl (= (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))))) :rule cong :premises (t79.t11))
% 27.74/28.00  (step t79.t13 (cl (= (not (tptp.lt A C)) (not (tptp.lt A C)))) :rule refl)
% 27.74/28.00  (step t79.t14 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.lt A C))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) :rule cong :premises (t79.t5 t79.t6 t79.t8 t79.t9 t79.t10 t79.t12 t79.t13))
% 27.74/28.00  (step t79 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.lt A C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))))) :rule bind)
% 27.74/28.00  (step t80 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) :rule resolution :premises (t78 t79 a195))
% 27.74/28.00  (step t81 (cl (or (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t77 t80))
% 27.74/28.00  (step t82 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.00  (step t83 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t82))
% 27.74/28.00  (step t84 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.00  (step t85 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t84))
% 27.74/28.00  (step t86 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t70 t81 t83 a192 a191 t85 a192 a191))
% 27.74/28.00  (step t87 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t86))
% 27.74/28.00  (step t88 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.74/28.00  (step t89 (cl (= (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule refl)
% 27.74/28.00  (step t90 (cl (= (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule refl)
% 27.74/28.00  (step t91 (cl (= (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule refl)
% 27.74/28.00  (step t92 (cl (= (not (= tptp.nil tptp.sk5)) (not (= tptp.nil tptp.sk5)))) :rule refl)
% 27.74/28.00  (step t93 (cl (= (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule refl)
% 27.74/28.00  (step t94 (cl (= (= (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) true) (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) :rule equiv_simplify)
% 27.74/28.00  (step t95 (cl (not (= (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) true)) (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule equiv1 :premises (t94))
% 27.74/28.00  (step t96 (cl (= (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))))) :rule all_simplify)
% 27.74/28.00  (step t97 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule refl)
% 27.74/28.00  (step t98 (cl (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule all_simplify)
% 27.74/28.00  (step t99 (cl (= (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) :rule cong :premises (t97 t98))
% 27.74/28.00  (step t100 (cl (= (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) true)) :rule all_simplify)
% 27.74/28.00  (step t101 (cl (= (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) true)) :rule trans :premises (t99 t100))
% 27.74/28.00  (step t102 (cl (= (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) true)) :rule trans :premises (t96 t101))
% 27.74/28.00  (step t103 (cl (= (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t95 t102))
% 27.74/28.00  (step t104 (cl (= (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule refl)
% 27.74/28.00  (step t105 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t89 t90 t91 t92 t93 t103 t104))
% 27.74/28.00  (step t106 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) :rule and_neg)
% 27.74/28.00  (step t107 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t108)
% 27.74/28.00  (assume t108.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t108.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t108.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t108.a3 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t108.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t108.a5 (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))
% 27.74/28.00  (step t108.t1 (cl (=> (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t108.t2)
% 27.74/28.00  (assume t108.t2.a0 (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))
% 27.74/28.00  (assume t108.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t108.t2.a2 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t108.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t108.t2.a4 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t108.t2.a5 (= tptp.nil tptp.sk5))
% 27.74/28.00  (step t108.t2.t1 (cl (= (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) false) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule equiv_simplify)
% 27.74/28.00  (step t108.t2.t2 (cl (not (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) false)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule equiv1 :premises (t108.t2.t1))
% 27.74/28.00  (step t108.t2.t3 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.00  (step t108.t2.t4 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t108.t2.a5))
% 27.74/28.00  (step t108.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t108.t2.a4))
% 27.74/28.00  (step t108.t2.t6 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t108.t2.t5))
% 27.74/28.00  (step t108.t2.t7 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.00  (step t108.t2.t8 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t108.t2.t7 t108.t2.a3))
% 27.74/28.00  (step t108.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t108.t2.a2))
% 27.74/28.00  (step t108.t2.t10 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t108.t2.a3))
% 27.74/28.00  (step t108.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t108.t2.t9 t108.t2.t10))
% 27.74/28.00  (step t108.t2.t12 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t108.t2.a1))
% 27.74/28.00  (step t108.t2.t13 (cl (= tptp.sk5 tptp.sk6)) :rule trans :premises (t108.t2.t4 t108.t2.t6 t108.t2.t8 t108.t2.t11 t108.t2.t12))
% 27.74/28.00  (step t108.t2.t14 (cl (= (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk7 tptp.sk6 tptp.sk6))) :rule cong :premises (t108.t2.t3 t108.t2.t13))
% 27.74/28.00  (step t108.t2.t15 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t108.t2.t6 t108.t2.t8 t108.t2.t11 t108.t2.t12))
% 27.74/28.00  (step t108.t2.t16 (cl (= (tptp.sk7 tptp.nil tptp.nil) (tptp.sk7 tptp.sk6 tptp.sk6))) :rule cong :premises (t108.t2.t15 t108.t2.t15))
% 27.74/28.00  (step t108.t2.t17 (cl (= (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk7 tptp.nil tptp.nil))) :rule symm :premises (t108.t2.t16))
% 27.74/28.00  (step t108.t2.t18 (cl (= (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk7 tptp.nil tptp.nil))) :rule trans :premises (t108.t2.t14 t108.t2.t17))
% 27.74/28.00  (step t108.t2.t19 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk7 tptp.nil tptp.nil)))) :rule cong :premises (t108.t2.t18))
% 27.74/28.00  (step t108.t2.t20 (cl (= (tptp.ssItem (tptp.sk7 tptp.nil tptp.nil)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule cong :premises (t108.t2.t16))
% 27.74/28.00  (step t108.t2.t21 (cl (= (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) false) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) :rule equiv_simplify)
% 27.74/28.00  (step t108.t2.t22 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) false) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) :rule equiv2 :premises (t108.t2.t21))
% 27.74/28.00  (step t108.t2.t23 (cl (not (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) :rule not_not)
% 27.74/28.00  (step t108.t2.t24 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) false) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) :rule resolution :premises (t108.t2.t22 t108.t2.t23))
% 27.74/28.00  (step t108.t2.t25 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) false)) :rule resolution :premises (t108.t2.t24 t108.t2.a0))
% 27.74/28.00  (step t108.t2.t26 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) false)) :rule trans :premises (t108.t2.t19 t108.t2.t20 t108.t2.t25))
% 27.74/28.00  (step t108.t2.t27 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t108.t2.t2 t108.t2.t26))
% 27.74/28.00  (step t108.t2 (cl (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t108.t2.a0 t108.t2.a1 t108.t2.a2 t108.t2.a3 t108.t2.a4 t108.t2.a5))
% 27.74/28.00  (step t108.t3 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t108.t4 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t108.t5 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t108.t6 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t108.t7 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t108.t8 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t108.t9 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)))) :rule resolution :premises (t108.t2 t108.t3 t108.t4 t108.t5 t108.t6 t108.t7 t108.t8))
% 27.74/28.00  (step t108.t10 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t108.t9))
% 27.74/28.00  (step t108.t11 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t108.t10))
% 27.74/28.00  (step t108.t12 (cl (=> (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t108.t1 t108.t11))
% 27.74/28.00  (step t108.t13 (cl (=> (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.00  (step t108.t14 (cl (=> (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (=> (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t108.t12 t108.t13))
% 27.74/28.00  (step t108.t15 (cl (=> (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t108.t14))
% 27.74/28.00  (step t108.t16 (cl (not (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule implies :premises (t108.t15))
% 27.74/28.00  (step t108.t17 (cl (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5))) :rule and_neg)
% 27.74/28.00  (step t108.t18 (cl (and (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) :rule resolution :premises (t108.t17 t108.a5 t108.a2 t108.a4 t108.a1 t108.a0 t108.a3))
% 27.74/28.00  (step t108.t19 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t108.t16 t108.t18))
% 27.74/28.00  (step t108 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t108.a0 t108.a1 t108.a2 t108.a3 t108.a4 t108.a5))
% 27.74/28.00  (step t109 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t110 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t111 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t112 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t113 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t114 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t115 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t108 t109 t110 t111 t112 t113 t114))
% 27.74/28.00  (step t116 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t115))
% 27.74/28.00  (step t117 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t116))
% 27.74/28.00  (step t118 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t107 t117))
% 27.74/28.00  (step t119 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.00  (step t120 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t118 t119))
% 27.74/28.00  (step t121 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t120))
% 27.74/28.00  (step t122 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule implies :premises (t121))
% 27.74/28.00  (step t123 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t106 t122))
% 27.74/28.00  (step t124 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.74/28.00  (step t125 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.74/28.00  (step t126 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.74/28.00  (step t127 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.74/28.00  (step t128 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.74/28.00  (step t129 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))))) :rule or_neg)
% 27.74/28.00  (step t130 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule or_neg)
% 27.74/28.00  (step t131 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t123 t124 t125 t126 t127 t128 t129 t130))
% 27.74/28.00  (step t132 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t131))
% 27.74/28.00  (step t133 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t88 t105 t132))
% 27.74/28.00  (step t134 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule or :premises (t133))
% 27.74/28.00  (step t135 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t134))
% 27.74/28.00  (step t136 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule or_pos)
% 27.74/28.00  (step t137 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule reordering :premises (t136))
% 27.74/28.00  (step t138 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t139)
% 27.74/28.00  (assume t139.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 27.74/28.00  (step t139.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 27.74/28.00  (step t139.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule or :premises (t139.t1))
% 27.74/28.00  (step t139.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t139.t2 t139.a0))
% 27.74/28.00  (step t139 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule subproof :discharge (t139.a0))
% 27.74/28.00  (step t140 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t138 t139))
% 27.74/28.00  (step t141 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule implies_neg2)
% 27.74/28.00  (step t142 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t140 t141))
% 27.74/28.00  (step t143 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule contraction :premises (t142))
% 27.74/28.00  (step t144 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies :premises (t143))
% 27.74/28.00  (step t145 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 27.74/28.00  (anchor :step t146 :args ((U $$unsorted) (:= U U)))
% 27.74/28.00  (step t146.t1 (cl (= U U)) :rule refl)
% 27.74/28.00  (step t146.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 27.74/28.00  (step t146.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 27.74/28.00  (step t146.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t146.t2 t146.t3))
% 27.74/28.00  (step t146 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 27.74/28.00  (step t147 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t145 t146 a73))
% 27.74/28.00  (step t148 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t144 t147))
% 27.74/28.00  (step t149 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule resolution :premises (t137 a192 t148))
% 27.74/28.00  (step t150 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule or_pos)
% 27.74/28.00  (step t151 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule reordering :premises (t150))
% 27.74/28.00  (step t152 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t153)
% 27.74/28.00  (assume t153.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 27.74/28.00  (step t153.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 27.74/28.00  (step t153.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule or :premises (t153.t1))
% 27.74/28.00  (step t153.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t153.t2 t153.a0))
% 27.74/28.00  (step t153 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule subproof :discharge (t153.a0))
% 27.74/28.00  (step t154 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t152 t153))
% 27.74/28.00  (step t155 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 27.74/28.00  (step t156 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule resolution :premises (t154 t155))
% 27.74/28.00  (step t157 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule contraction :premises (t156))
% 27.74/28.00  (step t158 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule implies :premises (t157))
% 27.74/28.00  (step t159 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule equiv_pos2)
% 27.74/28.00  (anchor :step t160 :args ((U $$unsorted) (:= U U)))
% 27.74/28.00  (step t160.t1 (cl (= U U)) :rule refl)
% 27.74/28.00  (step t160.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 27.74/28.00  (step t160.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 27.74/28.00  (step t160.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule cong :premises (t160.t2 t160.t3))
% 27.74/28.00  (step t160 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) :rule bind)
% 27.74/28.00  (step t161 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t159 t160 a72))
% 27.74/28.00  (step t162 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t158 t161))
% 27.74/28.00  (step t163 (cl (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule resolution :premises (t151 a192 t162))
% 27.74/28.00  (step t164 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule and_neg)
% 27.74/28.00  (step t165 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t166)
% 27.74/28.00  (assume t166.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t166.a1 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.00  (assume t166.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t166.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.00  (assume t166.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t166.a5 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t166.a6 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t166.a7 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.00  (assume t166.a8 (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))
% 27.74/28.00  (step t166.t1 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t166.t2)
% 27.74/28.00  (assume t166.t2.a0 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t166.t2.a1 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t166.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t166.t2.a3 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t166.t2.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t166.t2.a5 (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))
% 27.74/28.00  (assume t166.t2.a6 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.00  (assume t166.t2.a7 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.00  (assume t166.t2.a8 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.00  (step t166.t2.t1 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t166.t2.a0))
% 27.74/28.00  (step t166.t2.t2 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t166.t2.a8))
% 27.74/28.00  (step t166.t2.t3 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule symm :premises (t166.t2.t2))
% 27.74/28.00  (step t166.t2.t4 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.74/28.00  (step t166.t2.t5 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.00  (step t166.t2.t6 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t166.t2.a2))
% 27.74/28.00  (step t166.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t166.t2.t5 t166.t2.t6))
% 27.74/28.00  (step t166.t2.t8 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t166.t2.t7))
% 27.74/28.00  (step t166.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t166.t2.a3))
% 27.74/28.00  (step t166.t2.t10 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t166.t2.t9))
% 27.74/28.00  (step t166.t2.t11 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t166.t2.t10 t166.t2.a2))
% 27.74/28.00  (step t166.t2.t12 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t166.t2.t11))
% 27.74/28.00  (step t166.t2.t13 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t166.t2.a4))
% 27.74/28.00  (step t166.t2.t14 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t166.t2.a1 t166.t2.t8 t166.t2.t12 t166.t2.t13))
% 27.74/28.00  (step t166.t2.t15 (cl (= tptp.sk6 tptp.nil)) :rule symm :premises (t166.t2.t14))
% 27.74/28.00  (step t166.t2.t16 (cl (= (tptp.app tptp.sk3 tptp.sk6) (tptp.app tptp.sk3 tptp.nil))) :rule cong :premises (t166.t2.t4 t166.t2.t15))
% 27.74/28.00  (step t166.t2.t17 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t166.t2.a7))
% 27.74/28.00  (step t166.t2.t18 (cl (= (tptp.app tptp.sk3 tptp.sk6) tptp.sk3)) :rule trans :premises (t166.t2.t16 t166.t2.t17))
% 27.74/28.00  (step t166.t2.t19 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app tptp.nil tptp.sk3))) :rule cong :premises (t166.t2.t1 t166.t2.t18))
% 27.74/28.00  (step t166.t2.t20 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t166.t2.a6))
% 27.74/28.00  (step t166.t2.t21 (cl (= (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)) tptp.sk3)) :rule symm :premises (t166.t2.a5))
% 27.74/28.00  (step t166.t2.t22 (cl (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule symm :premises (t166.t2.t21))
% 27.74/28.00  (step t166.t2.t23 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.00  (step t166.t2.t24 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t166.t2.t13))
% 27.74/28.00  (step t166.t2.t25 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t166.t2.a1))
% 27.74/28.00  (step t166.t2.t26 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t166.t2.t1))
% 27.74/28.00  (step t166.t2.t27 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t166.t2.t24 t166.t2.t11 t166.t2.t7 t166.t2.t25 t166.t2.t26))
% 27.74/28.00  (step t166.t2.t28 (cl (= (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.sk14 tptp.sk6 tptp.sk5))) :rule cong :premises (t166.t2.t23 t166.t2.t27))
% 27.74/28.00  (step t166.t2.t29 (cl (= (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) :rule refl)
% 27.74/28.00  (step t166.t2.t30 (cl (= (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)) (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule cong :premises (t166.t2.t28 t166.t2.t29))
% 27.74/28.00  (step t166.t2.t31 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule trans :premises (t166.t2.t1 t166.t2.a1 t166.t2.t3 t166.t2.t19 t166.t2.t20 t166.t2.t22 t166.t2.t30))
% 27.74/28.00  (step t166.t2 (cl (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule subproof :discharge (t166.t2.a0 t166.t2.a1 t166.t2.a2 t166.t2.a3 t166.t2.a4 t166.t2.a5 t166.t2.a6 t166.t2.a7 t166.t2.a8))
% 27.74/28.00  (step t166.t3 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t166.t4 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t166.t5 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t166.t6 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t166.t7 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t166.t8 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule and_pos)
% 27.74/28.00  (step t166.t9 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t166.t10 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t166.t11 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t166.t12 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule resolution :premises (t166.t2 t166.t3 t166.t4 t166.t5 t166.t6 t166.t7 t166.t8 t166.t9 t166.t10 t166.t11))
% 27.74/28.00  (step t166.t13 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t166.t12))
% 27.74/28.00  (step t166.t14 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t166.t13))
% 27.74/28.00  (step t166.t15 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t166.t1 t166.t14))
% 27.74/28.00  (step t166.t16 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies_neg2)
% 27.74/28.00  (step t166.t17 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t166.t15 t166.t16))
% 27.74/28.00  (step t166.t18 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule contraction :premises (t166.t17))
% 27.74/28.00  (step t166.t19 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule implies :premises (t166.t18))
% 27.74/28.00  (step t166.t20 (cl (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule and_neg)
% 27.74/28.00  (step t166.t21 (cl (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule resolution :premises (t166.t20 t166.a5 t166.a0 t166.a2 t166.a6 t166.a4 t166.a8 t166.a3 t166.a1 t166.a7))
% 27.74/28.00  (step t166.t22 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t166.t19 t166.t21))
% 27.74/28.00  (step t166 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule subproof :discharge (t166.a0 t166.a1 t166.a2 t166.a3 t166.a4 t166.a5 t166.a6 t166.a7 t166.a8))
% 27.74/28.00  (step t167 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t168 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t169 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t170 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t171 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t172 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t173 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t174 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t175 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule and_pos)
% 27.74/28.00  (step t176 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t166 t167 t168 t169 t170 t171 t172 t173 t174 t175))
% 27.74/28.00  (step t177 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t176))
% 27.74/28.00  (step t178 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t177))
% 27.74/28.00  (step t179 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t165 t178))
% 27.74/28.00  (step t180 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies_neg2)
% 27.74/28.00  (step t181 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t179 t180))
% 27.74/28.00  (step t182 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule contraction :premises (t181))
% 27.74/28.00  (step t183 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule implies :premises (t182))
% 27.74/28.00  (step t184 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t164 t183))
% 27.74/28.00  (step t185 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t184))
% 27.74/28.00  (step t186 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule or_pos)
% 27.74/28.00  (step t187 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule reordering :premises (t186))
% 27.74/28.00  (step t188 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (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)))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t189)
% 27.74/28.00  (assume t189.a0 (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))))))
% 27.74/28.00  (step t189.t1 (cl (or (not (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)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk3) (:= W tptp.sk5)))
% 27.74/28.00  (step t189.t2 (cl (not (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)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule or :premises (t189.t1))
% 27.74/28.00  (step t189.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule resolution :premises (t189.t2 t189.a0))
% 27.74/28.00  (step t189 (cl (not (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)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule subproof :discharge (t189.a0))
% 27.74/28.00  (step t190 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule resolution :premises (t188 t189))
% 27.74/28.00  (step t191 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule implies_neg2)
% 27.74/28.00  (step t192 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (=> (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule resolution :premises (t190 t191))
% 27.74/28.00  (step t193 (cl (=> (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule contraction :premises (t192))
% 27.74/28.00  (step t194 (cl (not (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)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule implies :premises (t193))
% 27.74/28.00  (step t195 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule resolution :premises (t194 a148))
% 27.74/28.00  (step t196 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule resolution :premises (t187 a187 a191 a192 t195))
% 27.74/28.00  (step t197 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule or_pos)
% 27.74/28.00  (step t198 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule reordering :premises (t197))
% 27.74/28.00  (step t199 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t200)
% 27.74/28.00  (assume t200.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 27.74/28.00  (step t200.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 27.74/28.00  (step t200.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule or :premises (t200.t1))
% 27.74/28.00  (step t200.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t200.t2 t200.a0))
% 27.74/28.00  (step t200 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule subproof :discharge (t200.a0))
% 27.74/28.00  (step t201 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t199 t200))
% 27.74/28.00  (step t202 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule implies_neg2)
% 27.74/28.00  (step t203 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t201 t202))
% 27.74/28.00  (step t204 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule contraction :premises (t203))
% 27.74/28.00  (step t205 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies :premises (t204))
% 27.74/28.00  (step t206 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t205 t147))
% 27.74/28.00  (step t207 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t198 a187 t206))
% 27.74/28.00  (step t208 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule or_pos)
% 27.74/28.00  (step t209 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule reordering :premises (t208))
% 27.74/28.00  (step t210 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t211)
% 27.74/28.00  (assume t211.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 27.74/28.00  (step t211.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 27.74/28.00  (step t211.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule or :premises (t211.t1))
% 27.74/28.00  (step t211.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t211.t2 t211.a0))
% 27.74/28.00  (step t211 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule subproof :discharge (t211.a0))
% 27.74/28.00  (step t212 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t210 t211))
% 27.74/28.00  (step t213 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule implies_neg2)
% 27.74/28.00  (step t214 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule resolution :premises (t212 t213))
% 27.74/28.00  (step t215 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule contraction :premises (t214))
% 27.74/28.00  (step t216 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule implies :premises (t215))
% 27.74/28.00  (step t217 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t216 t161))
% 27.74/28.00  (step t218 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule resolution :premises (t209 a187 t217))
% 27.74/28.00  (step t219 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule and_neg)
% 27.74/28.00  (step t220 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t221)
% 27.74/28.00  (assume t221.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t221.a1 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.00  (assume t221.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t221.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.00  (assume t221.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t221.a5 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t221.a6 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t221.a7 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.00  (assume t221.a8 (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))
% 27.74/28.00  (step t221.t1 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t221.t2)
% 27.74/28.00  (assume t221.t2.a0 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t221.t2.a1 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t221.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t221.t2.a3 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t221.t2.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t221.t2.a5 (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))
% 27.74/28.00  (assume t221.t2.a6 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.00  (assume t221.t2.a7 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.00  (assume t221.t2.a8 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.00  (step t221.t2.t1 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t221.t2.a8))
% 27.74/28.00  (step t221.t2.t2 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t221.t2.t1))
% 27.74/28.00  (step t221.t2.t3 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t221.t2.a0))
% 27.74/28.00  (step t221.t2.t4 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t221.t2.t3))
% 27.74/28.00  (step t221.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t221.t2.a7))
% 27.74/28.00  (step t221.t2.t6 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule symm :premises (t221.t2.t5))
% 27.74/28.00  (step t221.t2.t7 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.74/28.00  (step t221.t2.t8 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.00  (step t221.t2.t9 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t221.t2.a2))
% 27.74/28.00  (step t221.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t221.t2.t8 t221.t2.t9))
% 27.74/28.00  (step t221.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t221.t2.t10))
% 27.74/28.00  (step t221.t2.t12 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t221.t2.a3))
% 27.74/28.00  (step t221.t2.t13 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t221.t2.t12))
% 27.74/28.00  (step t221.t2.t14 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t221.t2.t13 t221.t2.a2))
% 27.74/28.00  (step t221.t2.t15 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t221.t2.t14))
% 27.74/28.00  (step t221.t2.t16 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t221.t2.a4))
% 27.74/28.00  (step t221.t2.t17 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t221.t2.a1 t221.t2.t11 t221.t2.t15 t221.t2.t16))
% 27.74/28.00  (step t221.t2.t18 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app tptp.sk3 tptp.sk6))) :rule cong :premises (t221.t2.t7 t221.t2.t17))
% 27.74/28.00  (step t221.t2.t19 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.sk6))) :rule trans :premises (t221.t2.t6 t221.t2.t18))
% 27.74/28.00  (step t221.t2.t20 (cl (= (tptp.app tptp.nil tptp.sk3) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule cong :premises (t221.t2.t4 t221.t2.t19))
% 27.74/28.00  (step t221.t2.t21 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t221.t2.a6))
% 27.74/28.00  (step t221.t2.t22 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule symm :premises (t221.t2.t21))
% 27.74/28.00  (step t221.t2.t23 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t221.t2.t22))
% 27.74/28.00  (step t221.t2.t24 (cl (= (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)) tptp.sk6)) :rule symm :premises (t221.t2.a5))
% 27.74/28.00  (step t221.t2.t25 (cl (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule symm :premises (t221.t2.t24))
% 27.74/28.00  (step t221.t2.t26 (cl (= (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil))) :rule refl)
% 27.74/28.00  (step t221.t2.t27 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.00  (step t221.t2.t28 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t221.t2.t16))
% 27.74/28.00  (step t221.t2.t29 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t221.t2.a1))
% 27.74/28.00  (step t221.t2.t30 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t221.t2.t28 t221.t2.t14 t221.t2.t10 t221.t2.t29 t221.t2.t4))
% 27.74/28.00  (step t221.t2.t31 (cl (= (tptp.sk12 tptp.sk6 tptp.sk6) (tptp.sk12 tptp.sk6 tptp.sk5))) :rule cong :premises (t221.t2.t27 t221.t2.t30))
% 27.74/28.00  (step t221.t2.t32 (cl (= (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)) (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule cong :premises (t221.t2.t26 t221.t2.t31))
% 27.74/28.00  (step t221.t2.t33 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule trans :premises (t221.t2.t2 t221.t2.t20 t221.t2.t23 t221.t2.t11 t221.t2.t15 t221.t2.t16 t221.t2.t25 t221.t2.t32))
% 27.74/28.00  (step t221.t2 (cl (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t221.t2.a0 t221.t2.a1 t221.t2.a2 t221.t2.a3 t221.t2.a4 t221.t2.a5 t221.t2.a6 t221.t2.a7 t221.t2.a8))
% 27.74/28.00  (step t221.t3 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t221.t4 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t221.t5 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t221.t6 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t221.t7 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t221.t8 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t221.t9 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t221.t10 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t221.t11 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t221.t12 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t221.t2 t221.t3 t221.t4 t221.t5 t221.t6 t221.t7 t221.t8 t221.t9 t221.t10 t221.t11))
% 27.74/28.00  (step t221.t13 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t221.t12))
% 27.74/28.00  (step t221.t14 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t221.t13))
% 27.74/28.00  (step t221.t15 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t221.t1 t221.t14))
% 27.74/28.00  (step t221.t16 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.00  (step t221.t17 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t221.t15 t221.t16))
% 27.74/28.00  (step t221.t18 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t221.t17))
% 27.74/28.00  (step t221.t19 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t221.t18))
% 27.74/28.00  (step t221.t20 (cl (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule and_neg)
% 27.74/28.00  (step t221.t21 (cl (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t221.t20 t221.a5 t221.a0 t221.a2 t221.a6 t221.a4 t221.a8 t221.a7 t221.a1 t221.a3))
% 27.74/28.00  (step t221.t22 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t221.t19 t221.t21))
% 27.74/28.00  (step t221 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t221.a0 t221.a1 t221.a2 t221.a3 t221.a4 t221.a5 t221.a6 t221.a7 t221.a8))
% 27.74/28.00  (step t222 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t223 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t224 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t225 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t226 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t227 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t228 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t229 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t230 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.74/28.00  (step t231 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t221 t222 t223 t224 t225 t226 t227 t228 t229 t230))
% 27.74/28.00  (step t232 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t231))
% 27.74/28.00  (step t233 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t232))
% 27.74/28.00  (step t234 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t220 t233))
% 27.74/28.00  (step t235 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.00  (step t236 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t234 t235))
% 27.74/28.00  (step t237 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t236))
% 27.74/28.00  (step t238 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t237))
% 27.74/28.00  (step t239 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t219 t238))
% 27.74/28.00  (step t240 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t239))
% 27.74/28.00  (step t241 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.74/28.00  (step t242 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t241))
% 27.74/28.00  (step t243 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t242))
% 27.74/28.00  (step t244 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule or_pos)
% 27.74/28.00  (step t245 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t244))
% 27.74/28.00  (step t246 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule reordering :premises (t245))
% 27.74/28.00  (step t247 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.74/28.00  (step t248 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t247))
% 27.74/28.00  (step t249 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t248))
% 27.74/28.00  (step t250 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule or_pos)
% 27.74/28.00  (step t251 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t250))
% 27.74/28.00  (step t252 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule reordering :premises (t251))
% 27.74/28.00  (step t253 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.74/28.00  (step t254 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t253))
% 27.74/28.00  (step t255 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t254))
% 27.74/28.00  (step t256 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t87 t135 t149 t163 t185 t196 t149 t207 t163 t218 t240 t196 t149 t207 t163 t218 t243 a192 t246 a192 t249 a192 t252 a192 t255 a192))
% 27.74/28.00  (step t257 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t256))
% 27.74/28.00  (step t258 (cl (not (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule or_pos)
% 27.74/28.00  (step t259 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule reordering :premises (t258))
% 27.74/28.00  (step t260 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t261)
% 27.74/28.00  (assume t261.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))))
% 27.74/28.00  (step t261.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule forall_inst :args ((:= A (tptp.sk7 tptp.sk6 tptp.sk6)) (:= B (tptp.sk8 tptp.sk6 tptp.sk5)) (:= C (tptp.sk9 tptp.sk6 tptp.sk6)) (:= D (tptp.sk10 tptp.sk6 tptp.sk5))))
% 27.74/28.00  (step t261.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule or :premises (t261.t1))
% 27.74/28.00  (step t261.t3 (cl (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t261.t2 t261.a0))
% 27.74/28.00  (step t261 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t261.a0))
% 27.74/28.00  (step t262 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t260 t261))
% 27.74/28.00  (step t263 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.74/28.00  (step t264 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t262 t263))
% 27.74/28.00  (step t265 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t264))
% 27.74/28.00  (step t266 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule implies :premises (t265))
% 27.74/28.00  (step t267 (cl (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t266 t80))
% 27.74/28.00  (step t268 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule and_neg)
% 27.74/28.00  (step t269 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t270)
% 27.74/28.00  (assume t270.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t270.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t270.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t270.a3 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t270.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t270.a5 (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))
% 27.74/28.00  (step t270.t1 (cl (=> (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t270.t2)
% 27.74/28.00  (assume t270.t2.a0 (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))
% 27.74/28.00  (assume t270.t2.a1 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t270.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t270.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t270.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t270.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (step t270.t2.t1 (cl (= (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) true) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 27.74/28.00  (step t270.t2.t2 (cl (not (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) true)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule equiv1 :premises (t270.t2.t1))
% 27.74/28.00  (step t270.t2.t3 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.00  (step t270.t2.t4 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t270.t2.a5))
% 27.74/28.00  (step t270.t2.t5 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t270.t2.t4))
% 27.74/28.00  (step t270.t2.t6 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t270.t2.a4))
% 27.74/28.00  (step t270.t2.t7 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t270.t2.t6))
% 27.74/28.00  (step t270.t2.t8 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t270.t2.t7 t270.t2.a3))
% 27.74/28.00  (step t270.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.00  (step t270.t2.t10 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t270.t2.a3))
% 27.74/28.00  (step t270.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t270.t2.t9 t270.t2.t10))
% 27.74/28.00  (step t270.t2.t12 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t270.t2.a2))
% 27.74/28.00  (step t270.t2.t13 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t270.t2.a1))
% 27.74/28.00  (step t270.t2.t14 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t270.t2.t13))
% 27.74/28.00  (step t270.t2.t15 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t270.t2.t5 t270.t2.t8 t270.t2.t11 t270.t2.t12 t270.t2.t14))
% 27.74/28.00  (step t270.t2.t16 (cl (= (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk13 tptp.sk6 tptp.sk5))) :rule cong :premises (t270.t2.t3 t270.t2.t15))
% 27.74/28.00  (step t270.t2.t17 (cl (= (tptp.sk11 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule cong :premises (t270.t2.t3 t270.t2.t15))
% 27.74/28.00  (step t270.t2.t18 (cl (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule cong :premises (t270.t2.t16 t270.t2.t17))
% 27.74/28.00  (step t270.t2.t19 (cl (= (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) true) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule equiv_simplify)
% 27.74/28.00  (step t270.t2.t20 (cl (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) true) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule equiv2 :premises (t270.t2.t19))
% 27.74/28.00  (step t270.t2.t21 (cl (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) true)) :rule resolution :premises (t270.t2.t20 t270.t2.a0))
% 27.74/28.00  (step t270.t2.t22 (cl (= (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) true)) :rule trans :premises (t270.t2.t18 t270.t2.t21))
% 27.74/28.00  (step t270.t2.t23 (cl (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t270.t2.t2 t270.t2.t22))
% 27.74/28.00  (step t270.t2 (cl (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule subproof :discharge (t270.t2.a0 t270.t2.a1 t270.t2.a2 t270.t2.a3 t270.t2.a4 t270.t2.a5))
% 27.74/28.00  (step t270.t3 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule and_pos)
% 27.74/28.00  (step t270.t4 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t270.t5 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t270.t6 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t270.t7 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t270.t8 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t270.t9 (cl (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t270.t2 t270.t3 t270.t4 t270.t5 t270.t6 t270.t7 t270.t8))
% 27.74/28.00  (step t270.t10 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule reordering :premises (t270.t9))
% 27.74/28.00  (step t270.t11 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t270.t10))
% 27.74/28.00  (step t270.t12 (cl (=> (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t270.t1 t270.t11))
% 27.74/28.00  (step t270.t13 (cl (=> (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 27.74/28.00  (step t270.t14 (cl (=> (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (=> (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t270.t12 t270.t13))
% 27.74/28.00  (step t270.t15 (cl (=> (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t270.t14))
% 27.74/28.00  (step t270.t16 (cl (not (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule implies :premises (t270.t15))
% 27.74/28.00  (step t270.t17 (cl (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.74/28.00  (step t270.t18 (cl (and (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t270.t17 t270.a5 t270.a3 t270.a0 t270.a1 t270.a4 t270.a2))
% 27.74/28.00  (step t270.t19 (cl (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t270.t16 t270.t18))
% 27.74/28.00  (step t270 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule subproof :discharge (t270.a0 t270.a1 t270.a2 t270.a3 t270.a4 t270.a5))
% 27.74/28.00  (step t271 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t272 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.00  (step t273 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.00  (step t274 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.00  (step t275 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.00  (step t276 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule and_pos)
% 27.74/28.00  (step t277 (cl (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t270 t271 t272 t273 t274 t275 t276))
% 27.74/28.00  (step t278 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule reordering :premises (t277))
% 27.74/28.00  (step t279 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t278))
% 27.74/28.00  (step t280 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t269 t279))
% 27.74/28.00  (step t281 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 27.74/28.00  (step t282 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t280 t281))
% 27.74/28.00  (step t283 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t282))
% 27.74/28.00  (step t284 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule implies :premises (t283))
% 27.74/28.00  (step t285 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t268 t284))
% 27.74/28.00  (step t286 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t285))
% 27.74/28.00  (step t287 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule and_neg)
% 27.74/28.00  (step t288 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t289)
% 27.74/28.00  (assume t289.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t289.a1 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.00  (assume t289.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t289.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.00  (assume t289.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t289.a5 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t289.a6 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t289.a7 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.00  (assume t289.a8 (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))
% 27.74/28.00  (step t289.t1 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule implies_neg1)
% 27.74/28.00  (anchor :step t289.t2)
% 27.74/28.00  (assume t289.t2.a0 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.00  (assume t289.t2.a1 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.00  (assume t289.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.00  (assume t289.t2.a3 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.00  (assume t289.t2.a4 (= tptp.nil tptp.sk5))
% 27.74/28.00  (assume t289.t2.a5 (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))
% 27.74/28.00  (assume t289.t2.a6 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.00  (assume t289.t2.a7 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.00  (assume t289.t2.a8 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.00  (step t289.t2.t1 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t289.t2.a4))
% 27.74/28.00  (step t289.t2.t2 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t289.t2.t1))
% 27.74/28.00  (step t289.t2.t3 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t289.t2.t2))
% 27.74/28.00  (step t289.t2.t4 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t289.t2.a3))
% 27.74/28.00  (step t289.t2.t5 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t289.t2.t4))
% 27.74/28.00  (step t289.t2.t6 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t289.t2.a8))
% 27.74/28.00  (step t289.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule symm :premises (t289.t2.t6))
% 27.74/28.00  (step t289.t2.t8 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.74/28.00  (step t289.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.00  (step t289.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t289.t2.t9 t289.t2.a2))
% 27.74/28.00  (step t289.t2.t11 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t289.t2.a1))
% 27.74/28.00  (step t289.t2.t12 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t289.t2.t11))
% 27.74/28.00  (step t289.t2.t13 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t289.t2.t12))
% 27.74/28.00  (step t289.t2.t14 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t289.t2.a2))
% 27.74/28.00  (step t289.t2.t15 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t289.t2.t13 t289.t2.t14))
% 27.74/28.00  (step t289.t2.t16 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t289.t2.a0))
% 27.74/28.00  (step t289.t2.t17 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t289.t2.t16))
% 27.74/28.00  (step t289.t2.t18 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t289.t2.t17))
% 27.74/28.00  (step t289.t2.t19 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t289.t2.t5 t289.t2.t10 t289.t2.t15 t289.t2.t18))
% 27.74/28.00  (step t289.t2.t20 (cl (= tptp.sk6 tptp.nil)) :rule symm :premises (t289.t2.t19))
% 27.74/28.00  (step t289.t2.t21 (cl (= (tptp.app tptp.sk3 tptp.sk6) (tptp.app tptp.sk3 tptp.nil))) :rule cong :premises (t289.t2.t8 t289.t2.t20))
% 27.74/28.00  (step t289.t2.t22 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t289.t2.a7))
% 27.74/28.00  (step t289.t2.t23 (cl (= (tptp.app tptp.sk3 tptp.sk6) tptp.sk3)) :rule trans :premises (t289.t2.t21 t289.t2.t22))
% 27.74/28.00  (step t289.t2.t24 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app tptp.nil tptp.sk3))) :rule cong :premises (t289.t2.t3 t289.t2.t23))
% 27.74/28.00  (step t289.t2.t25 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t289.t2.a6))
% 27.74/28.01  (step t289.t2.t26 (cl (= (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)) tptp.sk3)) :rule symm :premises (t289.t2.a5))
% 27.74/28.01  (step t289.t2.t27 (cl (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule symm :premises (t289.t2.t26))
% 27.74/28.01  (step t289.t2.t28 (cl (= (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.sk14 tptp.sk6 tptp.sk5))) :rule refl)
% 27.74/28.01  (step t289.t2.t29 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.01  (step t289.t2.t30 (cl (= tptp.sk5 tptp.sk6)) :rule trans :premises (t289.t2.t3 t289.t2.t5 t289.t2.t10 t289.t2.t15 t289.t2.t18))
% 27.74/28.01  (step t289.t2.t31 (cl (= (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk13 tptp.sk6 tptp.sk6))) :rule cong :premises (t289.t2.t29 t289.t2.t30))
% 27.74/28.01  (step t289.t2.t32 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.74/28.01  (step t289.t2.t33 (cl (= (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) :rule cong :premises (t289.t2.t31 t289.t2.t32))
% 27.74/28.01  (step t289.t2.t34 (cl (= (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)) (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule cong :premises (t289.t2.t28 t289.t2.t33))
% 27.74/28.01  (step t289.t2.t35 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule trans :premises (t289.t2.t3 t289.t2.t5 t289.t2.t7 t289.t2.t24 t289.t2.t25 t289.t2.t27 t289.t2.t34))
% 27.74/28.01  (step t289.t2 (cl (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule subproof :discharge (t289.t2.a0 t289.t2.a1 t289.t2.a2 t289.t2.a3 t289.t2.a4 t289.t2.a5 t289.t2.a6 t289.t2.a7 t289.t2.a8))
% 27.74/28.01  (step t289.t3 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t289.t4 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t289.t5 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t289.t6 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t289.t7 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t289.t8 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule and_pos)
% 27.74/28.01  (step t289.t9 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t289.t10 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t289.t11 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.01  (step t289.t12 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule resolution :premises (t289.t2 t289.t3 t289.t4 t289.t5 t289.t6 t289.t7 t289.t8 t289.t9 t289.t10 t289.t11))
% 27.74/28.01  (step t289.t13 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t289.t12))
% 27.74/28.01  (step t289.t14 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t289.t13))
% 27.74/28.01  (step t289.t15 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t289.t1 t289.t14))
% 27.74/28.01  (step t289.t16 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies_neg2)
% 27.74/28.01  (step t289.t17 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t289.t15 t289.t16))
% 27.74/28.01  (step t289.t18 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule contraction :premises (t289.t17))
% 27.74/28.01  (step t289.t19 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule implies :premises (t289.t18))
% 27.74/28.01  (step t289.t20 (cl (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule and_neg)
% 27.74/28.01  (step t289.t21 (cl (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule resolution :premises (t289.t20 t289.a4 t289.a6 t289.a2 t289.a0 t289.a5 t289.a8 t289.a3 t289.a1 t289.a7))
% 27.74/28.01  (step t289.t22 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t289.t19 t289.t21))
% 27.74/28.01  (step t289 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule subproof :discharge (t289.a0 t289.a1 t289.a2 t289.a3 t289.a4 t289.a5 t289.a6 t289.a7 t289.a8))
% 27.74/28.01  (step t290 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t291 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t292 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t293 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t294 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t295 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t296 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t297 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.01  (step t298 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule and_pos)
% 27.74/28.01  (step t299 (cl (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t289 t290 t291 t292 t293 t294 t295 t296 t297 t298))
% 27.74/28.01  (step t300 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t299))
% 27.74/28.01  (step t301 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t300))
% 27.74/28.01  (step t302 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t288 t301))
% 27.74/28.01  (step t303 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies_neg2)
% 27.74/28.01  (step t304 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t302 t303))
% 27.74/28.01  (step t305 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule contraction :premises (t304))
% 27.74/28.01  (step t306 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule implies :premises (t305))
% 27.74/28.01  (step t307 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t287 t306))
% 27.74/28.01  (step t308 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t307))
% 27.74/28.01  (step t309 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule and_neg)
% 27.74/28.01  (step t310 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t311)
% 27.74/28.01  (assume t311.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.01  (assume t311.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.01  (assume t311.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.01  (assume t311.a3 (= tptp.nil tptp.sk5))
% 27.74/28.01  (assume t311.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.01  (assume t311.a5 (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))
% 27.74/28.01  (step t311.t1 (cl (=> (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t311.t2)
% 27.74/28.01  (assume t311.t2.a0 (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))
% 27.74/28.01  (assume t311.t2.a1 (= tptp.nil tptp.sk5))
% 27.74/28.01  (assume t311.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.01  (assume t311.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.01  (assume t311.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.01  (assume t311.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.01  (step t311.t2.t1 (cl (= (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) true) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 27.74/28.01  (step t311.t2.t2 (cl (not (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) true)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule equiv1 :premises (t311.t2.t1))
% 27.74/28.01  (step t311.t2.t3 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.01  (step t311.t2.t4 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t311.t2.a3))
% 27.74/28.01  (step t311.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t311.t2.t3 t311.t2.t4))
% 27.74/28.01  (step t311.t2.t6 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t311.t2.t5))
% 27.74/28.01  (step t311.t2.t7 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t311.t2.a4))
% 27.74/28.01  (step t311.t2.t8 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t311.t2.t7))
% 27.74/28.01  (step t311.t2.t9 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t311.t2.t8 t311.t2.a3))
% 27.74/28.01  (step t311.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t311.t2.t9))
% 27.74/28.01  (step t311.t2.t11 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t311.t2.a5))
% 27.74/28.01  (step t311.t2.t12 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t311.t2.a2 t311.t2.t6 t311.t2.t10 t311.t2.t11))
% 27.74/28.01  (step t311.t2.t13 (cl (= (tptp.sk13 tptp.nil tptp.nil) (tptp.sk13 tptp.sk6 tptp.sk6))) :rule cong :premises (t311.t2.t12 t311.t2.t12))
% 27.74/28.01  (step t311.t2.t14 (cl (= (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk13 tptp.nil tptp.nil))) :rule symm :premises (t311.t2.t13))
% 27.74/28.01  (step t311.t2.t15 (cl (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.nil tptp.nil)))) :rule cong :premises (t311.t2.t14))
% 27.74/28.01  (step t311.t2.t16 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.01  (step t311.t2.t17 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t311.t2.t11))
% 27.74/28.01  (step t311.t2.t18 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t311.t2.a2))
% 27.74/28.01  (step t311.t2.t19 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t311.t2.a1))
% 27.74/28.01  (step t311.t2.t20 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t311.t2.t19))
% 27.74/28.01  (step t311.t2.t21 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t311.t2.t17 t311.t2.t9 t311.t2.t5 t311.t2.t18 t311.t2.t20))
% 27.74/28.01  (step t311.t2.t22 (cl (= (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk13 tptp.sk6 tptp.sk5))) :rule cong :premises (t311.t2.t16 t311.t2.t21))
% 27.74/28.01  (step t311.t2.t23 (cl (= (tptp.sk13 tptp.nil tptp.nil) (tptp.sk13 tptp.sk6 tptp.sk5))) :rule trans :premises (t311.t2.t13 t311.t2.t22))
% 27.74/28.01  (step t311.t2.t24 (cl (= (tptp.ssItem (tptp.sk13 tptp.nil tptp.nil)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule cong :premises (t311.t2.t23))
% 27.74/28.01  (step t311.t2.t25 (cl (= (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) true) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule equiv_simplify)
% 27.74/28.01  (step t311.t2.t26 (cl (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) true) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule equiv2 :premises (t311.t2.t25))
% 27.74/28.01  (step t311.t2.t27 (cl (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) true)) :rule resolution :premises (t311.t2.t26 t311.t2.a0))
% 27.74/28.01  (step t311.t2.t28 (cl (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) true)) :rule trans :premises (t311.t2.t15 t311.t2.t24 t311.t2.t27))
% 27.74/28.01  (step t311.t2.t29 (cl (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule resolution :premises (t311.t2.t2 t311.t2.t28))
% 27.74/28.01  (step t311.t2 (cl (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule subproof :discharge (t311.t2.a0 t311.t2.a1 t311.t2.a2 t311.t2.a3 t311.t2.a4 t311.t2.a5))
% 27.74/28.01  (step t311.t3 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule and_pos)
% 27.74/28.01  (step t311.t4 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t311.t5 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t311.t6 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t311.t7 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t311.t8 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t311.t9 (cl (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t311.t2 t311.t3 t311.t4 t311.t5 t311.t6 t311.t7 t311.t8))
% 27.74/28.01  (step t311.t10 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule reordering :premises (t311.t9))
% 27.74/28.01  (step t311.t11 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t311.t10))
% 27.74/28.01  (step t311.t12 (cl (=> (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule resolution :premises (t311.t1 t311.t11))
% 27.74/28.01  (step t311.t13 (cl (=> (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 27.74/28.01  (step t311.t14 (cl (=> (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (=> (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t311.t12 t311.t13))
% 27.74/28.01  (step t311.t15 (cl (=> (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t311.t14))
% 27.74/28.01  (step t311.t16 (cl (not (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule implies :premises (t311.t15))
% 27.74/28.01  (step t311.t17 (cl (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.74/28.01  (step t311.t18 (cl (and (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t311.t17 t311.a5 t311.a3 t311.a0 t311.a1 t311.a4 t311.a2))
% 27.74/28.01  (step t311.t19 (cl (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule resolution :premises (t311.t16 t311.t18))
% 27.74/28.01  (step t311 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule subproof :discharge (t311.a0 t311.a1 t311.a2 t311.a3 t311.a4 t311.a5))
% 27.74/28.01  (step t312 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t313 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t314 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t315 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t316 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t317 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule and_pos)
% 27.74/28.01  (step t318 (cl (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t311 t312 t313 t314 t315 t316 t317))
% 27.74/28.01  (step t319 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule reordering :premises (t318))
% 27.74/28.01  (step t320 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t319))
% 27.74/28.01  (step t321 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule resolution :premises (t310 t320))
% 27.74/28.01  (step t322 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 27.74/28.01  (step t323 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t321 t322))
% 27.74/28.01  (step t324 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t323))
% 27.74/28.01  (step t325 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule implies :premises (t324))
% 27.74/28.01  (step t326 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule resolution :premises (t309 t325))
% 27.74/28.01  (step t327 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t326))
% 27.74/28.01  (step t328 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule and_neg)
% 27.74/28.01  (step t329 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t330)
% 27.74/28.01  (assume t330.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.01  (assume t330.a1 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.01  (assume t330.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.01  (assume t330.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.01  (assume t330.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.01  (assume t330.a5 (= tptp.nil tptp.sk5))
% 27.74/28.01  (assume t330.a6 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.01  (assume t330.a7 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.01  (assume t330.a8 (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))
% 27.74/28.01  (step t330.t1 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t330.t2)
% 27.74/28.01  (assume t330.t2.a0 (= tptp.nil tptp.sk5))
% 27.74/28.01  (assume t330.t2.a1 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.01  (assume t330.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.01  (assume t330.t2.a3 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.01  (assume t330.t2.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.01  (assume t330.t2.a5 (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))
% 27.74/28.01  (assume t330.t2.a6 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.74/28.01  (assume t330.t2.a7 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.74/28.01  (assume t330.t2.a8 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.74/28.01  (step t330.t2.t1 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t330.t2.a8))
% 27.74/28.01  (step t330.t2.t2 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t330.t2.t1))
% 27.74/28.01  (step t330.t2.t3 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t330.t2.a0))
% 27.74/28.01  (step t330.t2.t4 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t330.t2.t3))
% 27.74/28.01  (step t330.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t330.t2.a7))
% 27.74/28.01  (step t330.t2.t6 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule symm :premises (t330.t2.t5))
% 27.74/28.01  (step t330.t2.t7 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.74/28.01  (step t330.t2.t8 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.01  (step t330.t2.t9 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t330.t2.a2))
% 27.74/28.01  (step t330.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t330.t2.t8 t330.t2.t9))
% 27.74/28.01  (step t330.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t330.t2.t10))
% 27.74/28.01  (step t330.t2.t12 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t330.t2.a3))
% 27.74/28.01  (step t330.t2.t13 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t330.t2.t12))
% 27.74/28.01  (step t330.t2.t14 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t330.t2.t13 t330.t2.a2))
% 27.74/28.01  (step t330.t2.t15 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t330.t2.t14))
% 27.74/28.01  (step t330.t2.t16 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t330.t2.a4))
% 27.74/28.01  (step t330.t2.t17 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t330.t2.a1 t330.t2.t11 t330.t2.t15 t330.t2.t16))
% 27.74/28.01  (step t330.t2.t18 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app tptp.sk3 tptp.sk6))) :rule cong :premises (t330.t2.t7 t330.t2.t17))
% 27.74/28.01  (step t330.t2.t19 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.sk6))) :rule trans :premises (t330.t2.t6 t330.t2.t18))
% 27.74/28.01  (step t330.t2.t20 (cl (= (tptp.app tptp.nil tptp.sk3) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule cong :premises (t330.t2.t4 t330.t2.t19))
% 27.74/28.01  (step t330.t2.t21 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t330.t2.a6))
% 27.74/28.01  (step t330.t2.t22 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule symm :premises (t330.t2.t21))
% 27.74/28.01  (step t330.t2.t23 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t330.t2.t22))
% 27.74/28.01  (step t330.t2.t24 (cl (= (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)) tptp.sk6)) :rule symm :premises (t330.t2.a5))
% 27.74/28.01  (step t330.t2.t25 (cl (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule symm :premises (t330.t2.t24))
% 27.74/28.01  (step t330.t2.t26 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.01  (step t330.t2.t27 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t330.t2.t16))
% 27.74/28.01  (step t330.t2.t28 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t330.t2.a1))
% 27.74/28.01  (step t330.t2.t29 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t330.t2.t27 t330.t2.t14 t330.t2.t10 t330.t2.t28 t330.t2.t4))
% 27.74/28.01  (step t330.t2.t30 (cl (= tptp.sk5 tptp.sk6)) :rule symm :premises (t330.t2.t29))
% 27.74/28.01  (step t330.t2.t31 (cl (= (tptp.sk11 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule cong :premises (t330.t2.t26 t330.t2.t30))
% 27.74/28.01  (step t330.t2.t32 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.74/28.01  (step t330.t2.t33 (cl (= (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil))) :rule cong :premises (t330.t2.t31 t330.t2.t32))
% 27.74/28.01  (step t330.t2.t34 (cl (= (tptp.sk12 tptp.sk6 tptp.sk6) (tptp.sk12 tptp.sk6 tptp.sk5))) :rule cong :premises (t330.t2.t26 t330.t2.t29))
% 27.74/28.01  (step t330.t2.t35 (cl (= (tptp.sk12 tptp.sk6 tptp.sk5) (tptp.sk12 tptp.sk6 tptp.sk6))) :rule symm :premises (t330.t2.t34))
% 27.74/28.01  (step t330.t2.t36 (cl (= (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)) (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule cong :premises (t330.t2.t33 t330.t2.t35))
% 27.74/28.01  (step t330.t2.t37 (cl (= (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil))) :rule refl)
% 27.74/28.01  (step t330.t2.t38 (cl (= (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)) (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule cong :premises (t330.t2.t37 t330.t2.t34))
% 27.74/28.01  (step t330.t2.t39 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule trans :premises (t330.t2.t2 t330.t2.t20 t330.t2.t23 t330.t2.t11 t330.t2.t15 t330.t2.t16 t330.t2.t25 t330.t2.t36 t330.t2.t38))
% 27.74/28.01  (step t330.t2 (cl (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t330.t2.a0 t330.t2.a1 t330.t2.a2 t330.t2.a3 t330.t2.a4 t330.t2.a5 t330.t2.a6 t330.t2.a7 t330.t2.a8))
% 27.74/28.01  (step t330.t3 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t330.t4 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t330.t5 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t330.t6 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t330.t7 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t330.t8 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule and_pos)
% 27.74/28.01  (step t330.t9 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.01  (step t330.t10 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t330.t11 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t330.t12 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t330.t2 t330.t3 t330.t4 t330.t5 t330.t6 t330.t7 t330.t8 t330.t9 t330.t10 t330.t11))
% 27.74/28.01  (step t330.t13 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t330.t12))
% 27.74/28.01  (step t330.t14 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t330.t13))
% 27.74/28.01  (step t330.t15 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t330.t1 t330.t14))
% 27.74/28.01  (step t330.t16 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.01  (step t330.t17 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t330.t15 t330.t16))
% 27.74/28.01  (step t330.t18 (cl (=> (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t330.t17))
% 27.74/28.01  (step t330.t19 (cl (not (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t330.t18))
% 27.74/28.01  (step t330.t20 (cl (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule and_neg)
% 27.74/28.01  (step t330.t21 (cl (and (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t330.t20 t330.a5 t330.a0 t330.a2 t330.a6 t330.a4 t330.a8 t330.a7 t330.a1 t330.a3))
% 27.74/28.01  (step t330.t22 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t330.t19 t330.t21))
% 27.74/28.01  (step t330 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t330.a0 t330.a1 t330.a2 t330.a3 t330.a4 t330.a5 t330.a6 t330.a7 t330.a8))
% 27.74/28.01  (step t331 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t332 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t333 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t334 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t335 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t336 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t337 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t338 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.74/28.01  (step t339 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule and_pos)
% 27.74/28.01  (step t340 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t330 t331 t332 t333 t334 t335 t336 t337 t338 t339))
% 27.74/28.01  (step t341 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t340))
% 27.74/28.01  (step t342 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t341))
% 27.74/28.01  (step t343 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t329 t342))
% 27.74/28.01  (step t344 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.01  (step t345 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t343 t344))
% 27.74/28.01  (step t346 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t345))
% 27.74/28.01  (step t347 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t346))
% 27.74/28.01  (step t348 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t328 t347))
% 27.74/28.01  (step t349 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t348))
% 27.74/28.01  (step t350 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule and_neg)
% 27.74/28.01  (step t351 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t352)
% 27.74/28.01  (assume t352.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.01  (assume t352.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.01  (assume t352.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.01  (assume t352.a3 (= tptp.nil tptp.sk5))
% 27.74/28.01  (assume t352.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.01  (assume t352.a5 (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))
% 27.74/28.01  (step t352.t1 (cl (=> (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t352.t2)
% 27.74/28.01  (assume t352.t2.a0 (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))
% 27.74/28.01  (assume t352.t2.a1 (= tptp.nil tptp.sk5))
% 27.74/28.01  (assume t352.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.74/28.01  (assume t352.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.74/28.01  (assume t352.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.74/28.01  (assume t352.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.74/28.01  (step t352.t2.t1 (cl (= (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) true) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 27.74/28.01  (step t352.t2.t2 (cl (not (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) true)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule equiv1 :premises (t352.t2.t1))
% 27.74/28.01  (step t352.t2.t3 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.74/28.01  (step t352.t2.t4 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t352.t2.a3))
% 27.74/28.01  (step t352.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t352.t2.t3 t352.t2.t4))
% 27.74/28.01  (step t352.t2.t6 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t352.t2.t5))
% 27.74/28.01  (step t352.t2.t7 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t352.t2.a4))
% 27.74/28.01  (step t352.t2.t8 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t352.t2.t7))
% 27.74/28.01  (step t352.t2.t9 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t352.t2.t8 t352.t2.a3))
% 27.74/28.01  (step t352.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t352.t2.t9))
% 27.74/28.01  (step t352.t2.t11 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t352.t2.a5))
% 27.74/28.01  (step t352.t2.t12 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t352.t2.a2 t352.t2.t6 t352.t2.t10 t352.t2.t11))
% 27.74/28.01  (step t352.t2.t13 (cl (= (tptp.sk11 tptp.nil tptp.nil) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule cong :premises (t352.t2.t12 t352.t2.t12))
% 27.74/28.01  (step t352.t2.t14 (cl (= (tptp.sk11 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.nil tptp.nil))) :rule symm :premises (t352.t2.t13))
% 27.74/28.01  (step t352.t2.t15 (cl (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.nil tptp.nil)))) :rule cong :premises (t352.t2.t14))
% 27.74/28.01  (step t352.t2.t16 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.74/28.01  (step t352.t2.t17 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t352.t2.t11))
% 27.74/28.01  (step t352.t2.t18 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t352.t2.a2))
% 27.74/28.01  (step t352.t2.t19 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t352.t2.a1))
% 27.74/28.01  (step t352.t2.t20 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t352.t2.t19))
% 27.74/28.01  (step t352.t2.t21 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t352.t2.t17 t352.t2.t9 t352.t2.t5 t352.t2.t18 t352.t2.t20))
% 27.74/28.01  (step t352.t2.t22 (cl (= (tptp.sk11 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule cong :premises (t352.t2.t16 t352.t2.t21))
% 27.74/28.01  (step t352.t2.t23 (cl (= (tptp.sk11 tptp.nil tptp.nil) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule trans :premises (t352.t2.t13 t352.t2.t22))
% 27.74/28.01  (step t352.t2.t24 (cl (= (tptp.ssItem (tptp.sk11 tptp.nil tptp.nil)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule cong :premises (t352.t2.t23))
% 27.74/28.01  (step t352.t2.t25 (cl (= (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) true) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule equiv_simplify)
% 27.74/28.01  (step t352.t2.t26 (cl (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) true) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule equiv2 :premises (t352.t2.t25))
% 27.74/28.01  (step t352.t2.t27 (cl (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) true)) :rule resolution :premises (t352.t2.t26 t352.t2.a0))
% 27.74/28.01  (step t352.t2.t28 (cl (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) true)) :rule trans :premises (t352.t2.t15 t352.t2.t24 t352.t2.t27))
% 27.74/28.01  (step t352.t2.t29 (cl (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t352.t2.t2 t352.t2.t28))
% 27.74/28.01  (step t352.t2 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule subproof :discharge (t352.t2.a0 t352.t2.a1 t352.t2.a2 t352.t2.a3 t352.t2.a4 t352.t2.a5))
% 27.74/28.01  (step t352.t3 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule and_pos)
% 27.74/28.01  (step t352.t4 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t352.t5 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t352.t6 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t352.t7 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t352.t8 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t352.t9 (cl (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t352.t2 t352.t3 t352.t4 t352.t5 t352.t6 t352.t7 t352.t8))
% 27.74/28.01  (step t352.t10 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule reordering :premises (t352.t9))
% 27.74/28.01  (step t352.t11 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t352.t10))
% 27.74/28.01  (step t352.t12 (cl (=> (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t352.t1 t352.t11))
% 27.74/28.01  (step t352.t13 (cl (=> (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 27.74/28.01  (step t352.t14 (cl (=> (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (=> (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t352.t12 t352.t13))
% 27.74/28.01  (step t352.t15 (cl (=> (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t352.t14))
% 27.74/28.01  (step t352.t16 (cl (not (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule implies :premises (t352.t15))
% 27.74/28.01  (step t352.t17 (cl (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.74/28.01  (step t352.t18 (cl (and (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t352.t17 t352.a5 t352.a3 t352.a0 t352.a1 t352.a4 t352.a2))
% 27.74/28.01  (step t352.t19 (cl (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t352.t16 t352.t18))
% 27.74/28.01  (step t352 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule subproof :discharge (t352.a0 t352.a1 t352.a2 t352.a3 t352.a4 t352.a5))
% 27.74/28.01  (step t353 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t354 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.74/28.01  (step t355 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.74/28.01  (step t356 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.74/28.01  (step t357 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.74/28.01  (step t358 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule and_pos)
% 27.74/28.01  (step t359 (cl (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t352 t353 t354 t355 t356 t357 t358))
% 27.74/28.01  (step t360 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule reordering :premises (t359))
% 27.74/28.01  (step t361 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t360))
% 27.74/28.01  (step t362 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t351 t361))
% 27.74/28.01  (step t363 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 27.74/28.01  (step t364 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t362 t363))
% 27.74/28.01  (step t365 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t364))
% 27.74/28.01  (step t366 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule implies :premises (t365))
% 27.74/28.01  (step t367 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule resolution :premises (t350 t366))
% 27.74/28.01  (step t368 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t367))
% 27.74/28.01  (step t369 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.74/28.01  (step t370 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t369))
% 27.74/28.01  (step t371 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.01  (step t372 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t371))
% 27.74/28.01  (step t373 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.01  (step t374 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t373))
% 27.74/28.01  (step t375 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.74/28.01  (step t376 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t375))
% 27.74/28.01  (step t377 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.01  (step t378 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t377))
% 27.74/28.01  (step t379 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.74/28.01  (step t380 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t379))
% 27.74/28.01  (step t381 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.74/28.01  (step t382 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.74/28.01  (step t383 (cl (= (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.74/28.01  (step t384 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t28 t383))
% 27.74/28.01  (step t385 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.74/28.01  (step t386 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t384 t385))
% 27.74/28.01  (step t387 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t382 t386))
% 27.74/28.01  (step t388 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t389)
% 27.74/28.01  (assume t389.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.74/28.01  (step t389.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.74/28.01  (step t389.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t389.t1))
% 27.74/28.01  (step t389.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t389.t2 t389.a0))
% 27.74/28.01  (step t389 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t389.a0))
% 27.74/28.01  (step t390 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t388 t389))
% 27.74/28.01  (step t391 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.74/28.01  (step t392 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t390 t391))
% 27.74/28.01  (step t393 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t392))
% 27.74/28.01  (step t394 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t381 t387 t393))
% 27.74/28.01  (step t395 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t394))
% 27.74/28.01  (step t396 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.74/28.01  (step t397 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t396))
% 27.74/28.01  (step t398 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.74/28.01  (anchor :step t399 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.74/28.01  (step t399.t1 (cl (= A A)) :rule refl)
% 27.74/28.01  (step t399.t2 (cl (= B B)) :rule refl)
% 27.74/28.01  (step t399.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.74/28.01  (step t399.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.74/28.01  (step t399.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.74/28.01  (step t399.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t399.t5))
% 27.74/28.01  (step t399.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.74/28.01  (step t399.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.74/28.01  (step t399.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.74/28.01  (step t399.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.74/28.01  (step t399.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t399.t3 t399.t4 t399.t6 t399.t7 t399.t8 t399.t9 t399.t10))
% 27.74/28.01  (step t399 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.74/28.01  (step t400 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.74/28.01  (step t401 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t399 t400))
% 27.74/28.01  (step t402 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.74/28.01  (step t403 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t402))
% 27.74/28.01  (step t404 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t403))
% 27.74/28.01  (step t405 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.74/28.01  (step t406 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.74/28.01  (step t407 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.74/28.01  (step t408 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t406 t407))
% 27.74/28.01  (step t409 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t405 t408))
% 27.74/28.01  (step t410 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t409))
% 27.74/28.01  (anchor :step t411 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.74/28.01  (step t411.t1 (cl (= A A)) :rule refl)
% 27.74/28.01  (step t411.t2 (cl (= B B)) :rule refl)
% 27.74/28.01  (step t411.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.74/28.01  (step t411.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.74/28.01  (step t411.t5 (cl (= A A)) :rule refl)
% 27.74/28.01  (step t411.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t411.t5 t402))
% 27.74/28.01  (step t411.t7 (cl (= B B)) :rule refl)
% 27.74/28.01  (step t411.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t411.t6 t411.t7))
% 27.74/28.01  (step t411.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t408 t411.t8))
% 27.74/28.01  (step t411.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t411.t9))
% 27.74/28.01  (step t411.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.74/28.01  (step t411.t12 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.74/28.01  (step t411.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t411.t3 t411.t4 t411.t10 t411.t11 t411.t12))
% 27.74/28.01  (step t411 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.74/28.01  (step t412 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t404 t410 t411))
% 27.74/28.01  (step t413 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t401 t412))
% 27.74/28.01  (step t414 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t398 t413 a254))
% 27.74/28.01  (step t415 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t414))
% 27.74/28.01  (step t416 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.74/28.01  (step t417 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.74/28.01  (step t418 (cl (= (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.74/28.01  (step t419 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t28 t418))
% 27.74/28.01  (step t420 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.74/28.01  (step t421 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t419 t420))
% 27.74/28.01  (step t422 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t417 t421))
% 27.74/28.01  (step t423 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.74/28.01  (anchor :step t424)
% 27.74/28.01  (assume t424.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))
% 27.74/28.01  (step t424.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.74/28.01  (step t424.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t424.t1))
% 27.83/28.01  (step t424.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t424.t2 t424.a0))
% 27.83/28.01  (step t424 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t424.a0))
% 27.83/28.01  (step t425 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t423 t424))
% 27.83/28.01  (step t426 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t427 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t425 t426))
% 27.83/28.01  (step t428 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t427))
% 27.83/28.01  (step t429 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t416 t422 t428))
% 27.83/28.01  (step t430 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t429))
% 27.83/28.01  (step t431 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t432 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t431))
% 27.83/28.01  (step t433 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t434 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t434.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t434.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t434.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t434.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t434.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t434.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t434.t5))
% 27.83/28.01  (step t434.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t434.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.01  (step t434.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t434.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t434.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t434.t3 t434.t4 t434.t6 t434.t7 t434.t8 t434.t9 t434.t10))
% 27.83/28.01  (step t434 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t435 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t436 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t434 t435))
% 27.83/28.01  (step t437 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t438 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t437))
% 27.83/28.01  (step t439 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t438))
% 27.83/28.01  (step t440 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t441 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t442 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t443 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t441 t442))
% 27.83/28.01  (step t444 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t440 t443))
% 27.83/28.01  (step t445 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t444))
% 27.83/28.01  (anchor :step t446 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t446.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t446.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t446.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t446.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t446.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t446.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t446.t5 t437))
% 27.83/28.01  (step t446.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t446.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t446.t6 t446.t7))
% 27.83/28.01  (step t446.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t443 t446.t8))
% 27.83/28.01  (step t446.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t446.t9))
% 27.83/28.01  (step t446.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t446.t12 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.01  (step t446.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t446.t3 t446.t4 t446.t10 t446.t11 t446.t12))
% 27.83/28.01  (step t446 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.01  (step t447 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t439 t445 t446))
% 27.83/28.01  (step t448 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t436 t447))
% 27.83/28.01  (step t449 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t433 t448 a260))
% 27.83/28.01  (step t450 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t449))
% 27.83/28.01  (step t451 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.01  (step t452 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.01  (step t453 (cl (= (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule refl)
% 27.83/28.01  (step t454 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t28 t453))
% 27.83/28.01  (step t455 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.01  (step t456 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t454 t455))
% 27.83/28.01  (step t457 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t452 t456))
% 27.83/28.01  (step t458 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t459)
% 27.83/28.01  (assume t459.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.01  (step t459.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t459.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t459.t1))
% 27.83/28.01  (step t459.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t459.t2 t459.a0))
% 27.83/28.01  (step t459 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t459.a0))
% 27.83/28.01  (step t460 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t458 t459))
% 27.83/28.01  (step t461 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.01  (step t462 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t460 t461))
% 27.83/28.01  (step t463 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t462))
% 27.83/28.01  (step t464 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t451 t457 t463))
% 27.83/28.01  (step t465 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t464))
% 27.83/28.01  (step t466 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.01  (step t467 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t466))
% 27.83/28.01  (step t468 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t469 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t469.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t469.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t469.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t469.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t469.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t469.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t469.t5))
% 27.83/28.01  (step t469.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t469.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.01  (step t469.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t469.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t469.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t469.t3 t469.t4 t469.t6 t469.t7 t469.t8 t469.t9 t469.t10))
% 27.83/28.01  (step t469 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t470 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.01  (step t471 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t469 t470))
% 27.83/28.01  (step t472 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t473 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t472))
% 27.83/28.01  (step t474 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t473))
% 27.83/28.01  (step t475 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t476 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t477 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t478 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t476 t477))
% 27.83/28.01  (step t479 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t475 t478))
% 27.83/28.01  (step t480 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t479))
% 27.83/28.01  (anchor :step t481 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t481.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t481.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t481.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t481.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t481.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t481.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t481.t5 t472))
% 27.83/28.01  (step t481.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t481.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t481.t6 t481.t7))
% 27.83/28.01  (step t481.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t478 t481.t8))
% 27.83/28.01  (step t481.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t481.t9))
% 27.83/28.01  (step t481.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t481.t12 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.01  (step t481.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t481.t3 t481.t4 t481.t10 t481.t11 t481.t12))
% 27.83/28.01  (step t481 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.01  (step t482 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t474 t480 t481))
% 27.83/28.01  (step t483 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t471 t482))
% 27.83/28.01  (step t484 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t468 t483 a261))
% 27.83/28.01  (step t485 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t484))
% 27.83/28.01  (step t486 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.01  (step t487 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.01  (step t488 (cl (= (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.83/28.01  (step t489 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t28 t488))
% 27.83/28.01  (step t490 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.01  (step t491 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t489 t490))
% 27.83/28.01  (step t492 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t487 t491))
% 27.83/28.01  (step t493 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t494)
% 27.83/28.01  (assume t494.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.01  (step t494.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t494.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t494.t1))
% 27.83/28.01  (step t494.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t494.t2 t494.a0))
% 27.83/28.01  (step t494 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t494.a0))
% 27.83/28.01  (step t495 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t493 t494))
% 27.83/28.01  (step t496 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t497 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t495 t496))
% 27.83/28.01  (step t498 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t497))
% 27.83/28.01  (step t499 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t486 t492 t498))
% 27.83/28.01  (step t500 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t499))
% 27.83/28.01  (step t501 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t502 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t501))
% 27.83/28.01  (step t503 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t504 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t504.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t504.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t504.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t504.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t504.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t504.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t504.t5))
% 27.83/28.01  (step t504.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t504.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.01  (step t504.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t504.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t504.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t504.t3 t504.t4 t504.t6 t504.t7 t504.t8 t504.t9 t504.t10))
% 27.83/28.01  (step t504 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t505 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t506 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t504 t505))
% 27.83/28.01  (step t507 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t508 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t507))
% 27.83/28.01  (step t509 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t508))
% 27.83/28.01  (step t510 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t511 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t512 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t513 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t511 t512))
% 27.83/28.01  (step t514 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t510 t513))
% 27.83/28.01  (step t515 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t514))
% 27.83/28.01  (anchor :step t516 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t516.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t516.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t516.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t516.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t516.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t516.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t516.t5 t507))
% 27.83/28.01  (step t516.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t516.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t516.t6 t516.t7))
% 27.83/28.01  (step t516.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t513 t516.t8))
% 27.83/28.01  (step t516.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t516.t9))
% 27.83/28.01  (step t516.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t516.t12 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.01  (step t516.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t516.t3 t516.t4 t516.t10 t516.t11 t516.t12))
% 27.83/28.01  (step t516 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.01  (step t517 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t509 t515 t516))
% 27.83/28.01  (step t518 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t506 t517))
% 27.83/28.01  (step t519 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t503 t518 a262))
% 27.83/28.01  (step t520 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t519))
% 27.83/28.01  (step t521 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.01  (step t522 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.01  (step t523 (cl (= (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.83/28.01  (step t524 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t28 t523))
% 27.83/28.01  (step t525 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.01  (step t526 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t524 t525))
% 27.83/28.01  (step t527 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t522 t526))
% 27.83/28.01  (step t528 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t529)
% 27.83/28.01  (assume t529.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.01  (step t529.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t529.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t529.t1))
% 27.83/28.01  (step t529.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t529.t2 t529.a0))
% 27.83/28.01  (step t529 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t529.a0))
% 27.83/28.01  (step t530 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t528 t529))
% 27.83/28.01  (step t531 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t532 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t530 t531))
% 27.83/28.01  (step t533 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t532))
% 27.83/28.01  (step t534 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t521 t527 t533))
% 27.83/28.01  (step t535 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t534))
% 27.83/28.01  (step t536 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t537 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t536))
% 27.83/28.01  (step t538 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t539 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t539.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t539.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t539.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t539.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t539.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t539.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t539.t5))
% 27.83/28.01  (step t539.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t539.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.01  (step t539.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t539.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t539.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t539.t3 t539.t4 t539.t6 t539.t7 t539.t8 t539.t9 t539.t10))
% 27.83/28.01  (step t539 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t540 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t541 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t539 t540))
% 27.83/28.01  (step t542 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t543 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t542))
% 27.83/28.01  (step t544 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t543))
% 27.83/28.01  (step t545 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t546 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t547 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t548 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t546 t547))
% 27.83/28.01  (step t549 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t545 t548))
% 27.83/28.01  (step t550 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t549))
% 27.83/28.01  (anchor :step t551 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t551.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t551.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t551.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t551.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t551.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t551.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t551.t5 t542))
% 27.83/28.01  (step t551.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t551.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t551.t6 t551.t7))
% 27.83/28.01  (step t551.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t548 t551.t8))
% 27.83/28.01  (step t551.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t551.t9))
% 27.83/28.01  (step t551.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t551.t12 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.01  (step t551.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t551.t3 t551.t4 t551.t10 t551.t11 t551.t12))
% 27.83/28.01  (step t551 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.01  (step t552 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t544 t550 t551))
% 27.83/28.01  (step t553 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t541 t552))
% 27.83/28.01  (step t554 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t538 t553 a263))
% 27.83/28.01  (step t555 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t554))
% 27.83/28.01  (step t556 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.01  (step t557 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.01  (step t558 (cl (= (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t559 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t28 t558))
% 27.83/28.01  (step t560 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.01  (step t561 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t559 t560))
% 27.83/28.01  (step t562 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t557 t561))
% 27.83/28.01  (step t563 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t564)
% 27.83/28.01  (assume t564.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.01  (step t564.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t564.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t564.t1))
% 27.83/28.01  (step t564.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t564.t2 t564.a0))
% 27.83/28.01  (step t564 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t564.a0))
% 27.83/28.01  (step t565 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t563 t564))
% 27.83/28.01  (step t566 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.01  (step t567 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t565 t566))
% 27.83/28.01  (step t568 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t567))
% 27.83/28.01  (step t569 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t556 t562 t568))
% 27.83/28.01  (step t570 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t569))
% 27.83/28.01  (step t571 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.01  (step t572 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t571))
% 27.83/28.01  (step t573 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t574 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t574.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t574.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t574.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t574.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t574.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t574.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t574.t5))
% 27.83/28.01  (step t574.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t574.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t574.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t574.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t574.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t574.t3 t574.t4 t574.t6 t574.t7 t574.t8 t574.t9 t574.t10))
% 27.83/28.01  (step t574 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t575 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.01  (step t576 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t574 t575))
% 27.83/28.01  (step t577 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t578 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t577))
% 27.83/28.01  (step t579 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t578))
% 27.83/28.01  (step t580 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t581 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t582 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t583 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t581 t582))
% 27.83/28.01  (step t584 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t580 t583))
% 27.83/28.01  (step t585 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t584))
% 27.83/28.01  (anchor :step t586 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t586.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t586.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t586.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t586.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t586.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t586.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t586.t5 t577))
% 27.83/28.01  (step t586.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t586.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t586.t6 t586.t7))
% 27.83/28.01  (step t586.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t583 t586.t8))
% 27.83/28.01  (step t586.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t586.t9))
% 27.83/28.01  (step t586.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t586.t12 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.01  (step t586.t13 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t577 t586.t12))
% 27.83/28.01  (step t586.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t586.t3 t586.t4 t586.t10 t586.t11 t586.t13))
% 27.83/28.01  (step t586 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.01  (step t587 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t579 t585 t586))
% 27.83/28.01  (step t588 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t576 t587))
% 27.83/28.01  (step t589 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t573 t588 a264))
% 27.83/28.01  (step t590 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t589))
% 27.83/28.01  (step t591 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t592 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t591))
% 27.83/28.01  (step t593 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t594 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t594.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t594.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t594.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t594.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t594.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t594.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t594.t5))
% 27.83/28.01  (step t594.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t594.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t594.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t594.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t594.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t594.t3 t594.t4 t594.t6 t594.t7 t594.t8 t594.t9 t594.t10))
% 27.83/28.01  (step t594 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t595 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t596 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t594 t595))
% 27.83/28.01  (step t597 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t598 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t597))
% 27.83/28.01  (step t599 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t598))
% 27.83/28.01  (step t600 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t601 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t602 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t603 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t601 t602))
% 27.83/28.01  (step t604 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t600 t603))
% 27.83/28.01  (step t605 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t604))
% 27.83/28.01  (anchor :step t606 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t606.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t606.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t606.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t606.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t606.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t606.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t606.t5 t597))
% 27.83/28.01  (step t606.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t606.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t606.t6 t606.t7))
% 27.83/28.01  (step t606.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t603 t606.t8))
% 27.83/28.01  (step t606.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t606.t9))
% 27.83/28.01  (step t606.t11 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.01  (step t606.t12 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t606.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t606.t3 t606.t4 t606.t10 t606.t11 t606.t12))
% 27.83/28.01  (step t606 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.01  (step t607 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t599 t605 t606))
% 27.83/28.01  (step t608 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t596 t607))
% 27.83/28.01  (step t609 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t593 t608 a265))
% 27.83/28.01  (step t610 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t609))
% 27.83/28.01  (step t611 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t70 t81 t286 t149 t163 t308 t196 t149 t207 t163 t218 t327 t149 t163 t349 t196 t149 t207 t163 t218 t368 t149 t163 t19 a192 a191 t370 a192 a191 t372 a192 a191 t374 a192 a191 t376 a192 a191 t378 a192 a191 t380 a192 a191 t395 t397 t415 t430 t432 t450 t465 t467 t485 t500 t502 t520 t535 t537 t555 t570 t572 t590 t41 t592 t610))
% 27.83/28.01  (step t612 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3))) :rule contraction :premises (t611))
% 27.83/28.01  (step t613 (cl (not (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5)) :rule or_pos)
% 27.83/28.01  (step t614 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5)))) :rule reordering :premises (t613))
% 27.83/28.01  (step t615 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t616)
% 27.83/28.01  (assume t616.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 27.83/28.01  (step t616.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk3)))
% 27.83/28.01  (step t616.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) :rule or :premises (t616.t1))
% 27.83/28.01  (step t616.t3 (cl (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) :rule resolution :premises (t616.t2 t616.a0))
% 27.83/28.01  (step t616 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) :rule subproof :discharge (t616.a0))
% 27.83/28.01  (step t617 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) :rule resolution :premises (t615 t616))
% 27.83/28.01  (step t618 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) (not (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5)))) :rule implies_neg2)
% 27.83/28.01  (step t619 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5)))) :rule resolution :premises (t617 t618))
% 27.83/28.01  (step t620 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5)))) :rule contraction :premises (t619))
% 27.83/28.01  (step t621 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) :rule implies :premises (t620))
% 27.83/28.01  (step t622 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t612 t614 t621))
% 27.83/28.01  (step t623 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t622))
% 27.83/28.01  (step t624 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule or_pos)
% 27.83/28.01  (step t625 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule reordering :premises (t624))
% 27.83/28.01  (step t626 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) :rule or_pos)
% 27.83/28.01  (step t627 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule reordering :premises (t626))
% 27.83/28.01  (step t628 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t629)
% 27.83/28.01  (assume t629.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 27.83/28.01  (step t629.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk5)))
% 27.83/28.01  (step t629.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule or :premises (t629.t1))
% 27.83/28.01  (step t629.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t629.t2 t629.a0))
% 27.83/28.01  (step t629 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule subproof :discharge (t629.a0))
% 27.83/28.01  (step t630 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t628 t629))
% 27.83/28.01  (step t631 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule implies_neg2)
% 27.83/28.01  (step t632 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule resolution :premises (t630 t631))
% 27.83/28.01  (step t633 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule contraction :premises (t632))
% 27.83/28.01  (step t634 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule implies :premises (t633))
% 27.83/28.01  (step t635 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t636)
% 27.83/28.01  (assume t636.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 27.83/28.01  (step t636.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule forall_inst :args ((:= U (tptp.app tptp.sk5 tptp.sk3)) (:= V tptp.sk6)))
% 27.83/28.01  (step t636.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) :rule or :premises (t636.t1))
% 27.83/28.01  (step t636.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t636.t2 t636.a0))
% 27.83/28.01  (step t636 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) :rule subproof :discharge (t636.a0))
% 27.83/28.01  (step t637 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t635 t636))
% 27.83/28.01  (step t638 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule implies_neg2)
% 27.83/28.01  (step t639 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule resolution :premises (t637 t638))
% 27.83/28.01  (step t640 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule contraction :premises (t639))
% 27.83/28.01  (step t641 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) :rule implies :premises (t640))
% 27.83/28.01  (step t642 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t623 t625 a192 t627 t634 a84 t641))
% 27.83/28.01  (step t643 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t642))
% 27.83/28.01  (step t644 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t645 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 27.83/28.01  (step t645.t1 (cl (= U U)) :rule refl)
% 27.83/28.01  (step t645.t2 (cl (= V V)) :rule refl)
% 27.83/28.01  (step t645.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 27.83/28.01  (step t645.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t645.t3))
% 27.83/28.01  (step t645.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 27.83/28.01  (step t645.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 27.83/28.01  (step t645.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 27.83/28.01  (step t645.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t645.t4 t645.t5 t645.t6 t645.t7))
% 27.83/28.01  (step t645 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 27.83/28.01  (step t646 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t644 t645 a117))
% 27.83/28.01  (step t647 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) :rule resolution :premises (t643 a194 a187 a191 t646))
% 27.83/28.01  (step t648 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.01  (step t649 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t648))
% 27.83/28.01  (step t650 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t649))
% 27.83/28.01  (step t651 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.01  (step t652 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t651))
% 27.83/28.01  (step t653 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t652))
% 27.83/28.01  (step t654 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.01  (step t655 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t654))
% 27.83/28.01  (step t656 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t655))
% 27.83/28.01  (step t657 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.83/28.01  (step t658 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t657))
% 27.83/28.01  (step t659 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.01  (step t660 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t659))
% 27.83/28.01  (step t661 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.83/28.01  (step t662 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t661))
% 27.83/28.01  (step t663 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.01  (step t664 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t663))
% 27.83/28.01  (step t665 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t70 t81 t308 t196 t149 t207 t163 t218 t349 t196 t149 t207 t163 t218 t650 a192 t653 a192 t656 a192 t658 a192 a191 t660 a192 a191 t662 a192 a191 t664 a192 a191))
% 27.83/28.01  (step t666 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t665))
% 27.83/28.01  (step t667 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.01  (step t668 (cl (= (= (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) true) (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv_simplify)
% 27.83/28.01  (step t669 (cl (not (= (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) true)) (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule equiv1 :premises (t668))
% 27.83/28.01  (step t670 (cl (= (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.01  (step t671 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t672 (cl (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t673 (cl (= (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule cong :premises (t671 t672))
% 27.83/28.01  (step t674 (cl (= (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) true)) :rule all_simplify)
% 27.83/28.01  (step t675 (cl (= (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) true)) :rule trans :premises (t673 t674))
% 27.83/28.01  (step t676 (cl (= (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) true)) :rule trans :premises (t670 t675))
% 27.83/28.01  (step t677 (cl (= (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t669 t676))
% 27.83/28.01  (step t678 (cl (= (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule refl)
% 27.83/28.01  (step t679 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))))) :rule cong :premises (t89 t90 t91 t92 t93 t677 t678))
% 27.83/28.01  (step t680 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule and_neg)
% 27.83/28.01  (step t681 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t682)
% 27.83/28.01  (assume t682.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t682.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t682.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (assume t682.a3 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t682.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t682.a5 (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))
% 27.83/28.01  (step t682.t1 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t682.t2)
% 27.83/28.01  (assume t682.t2.a0 (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))
% 27.83/28.01  (assume t682.t2.a1 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t682.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t682.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t682.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t682.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (step t682.t2.t1 (cl (= (= (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv_simplify)
% 27.83/28.01  (step t682.t2.t2 (cl (not (= (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false)) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule equiv1 :premises (t682.t2.t1))
% 27.83/28.01  (step t682.t2.t3 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t682.t2.a5))
% 27.83/28.01  (step t682.t2.t4 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t682.t2.t3))
% 27.83/28.01  (step t682.t2.t5 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t682.t2.a4))
% 27.83/28.01  (step t682.t2.t6 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t682.t2.t5))
% 27.83/28.01  (step t682.t2.t7 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t682.t2.t6 t682.t2.a3))
% 27.83/28.01  (step t682.t2.t8 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.01  (step t682.t2.t9 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t682.t2.a3))
% 27.83/28.01  (step t682.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t682.t2.t8 t682.t2.t9))
% 27.83/28.01  (step t682.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t682.t2.a2))
% 27.83/28.01  (step t682.t2.t12 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t682.t2.a1))
% 27.83/28.01  (step t682.t2.t13 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t682.t2.t12))
% 27.83/28.01  (step t682.t2.t14 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t682.t2.t4 t682.t2.t7 t682.t2.t10 t682.t2.t11 t682.t2.t13))
% 27.83/28.01  (step t682.t2.t15 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.83/28.01  (step t682.t2.t16 (cl (= (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.sk8 tptp.sk6 tptp.sk5))) :rule cong :premises (t682.t2.t15 t682.t2.t14))
% 27.83/28.01  (step t682.t2.t17 (cl (= (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) :rule refl)
% 27.83/28.01  (step t682.t2.t18 (cl (= (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)) (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule cong :premises (t682.t2.t16 t682.t2.t17))
% 27.83/28.01  (step t682.t2.t19 (cl (= (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule cong :premises (t682.t2.t14 t682.t2.t18))
% 27.83/28.01  (step t682.t2.t20 (cl (= (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv_simplify)
% 27.83/28.01  (step t682.t2.t21 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv2 :premises (t682.t2.t20))
% 27.83/28.01  (step t682.t2.t22 (cl (not (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule not_not)
% 27.83/28.01  (step t682.t2.t23 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t682.t2.t21 t682.t2.t22))
% 27.83/28.01  (step t682.t2.t24 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false)) :rule resolution :premises (t682.t2.t23 t682.t2.a0))
% 27.83/28.01  (step t682.t2.t25 (cl (= (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false)) :rule trans :premises (t682.t2.t19 t682.t2.t24))
% 27.83/28.01  (step t682.t2.t26 (cl (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t682.t2.t2 t682.t2.t25))
% 27.83/28.01  (step t682.t2 (cl (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule subproof :discharge (t682.t2.a0 t682.t2.a1 t682.t2.a2 t682.t2.a3 t682.t2.a4 t682.t2.a5))
% 27.83/28.01  (step t682.t3 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule and_pos)
% 27.83/28.01  (step t682.t4 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t682.t5 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t682.t6 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t682.t7 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t682.t8 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t682.t9 (cl (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t682.t2 t682.t3 t682.t4 t682.t5 t682.t6 t682.t7 t682.t8))
% 27.83/28.01  (step t682.t10 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule reordering :premises (t682.t9))
% 27.83/28.01  (step t682.t11 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule contraction :premises (t682.t10))
% 27.83/28.01  (step t682.t12 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t682.t1 t682.t11))
% 27.83/28.01  (step t682.t13 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.01  (step t682.t14 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t682.t12 t682.t13))
% 27.83/28.01  (step t682.t15 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t682.t14))
% 27.83/28.01  (step t682.t16 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies :premises (t682.t15))
% 27.83/28.01  (step t682.t17 (cl (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.83/28.01  (step t682.t18 (cl (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t682.t17 t682.a5 t682.a3 t682.a0 t682.a1 t682.a4 t682.a2))
% 27.83/28.01  (step t682.t19 (cl (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t682.t16 t682.t18))
% 27.83/28.01  (step t682 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule subproof :discharge (t682.a0 t682.a1 t682.a2 t682.a3 t682.a4 t682.a5))
% 27.83/28.01  (step t683 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t684 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t685 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t686 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t687 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t688 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule and_pos)
% 27.83/28.01  (step t689 (cl (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))))) :rule resolution :premises (t682 t683 t684 t685 t686 t687 t688))
% 27.83/28.01  (step t690 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule reordering :premises (t689))
% 27.83/28.01  (step t691 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule contraction :premises (t690))
% 27.83/28.01  (step t692 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t681 t691))
% 27.83/28.01  (step t693 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.01  (step t694 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t692 t693))
% 27.83/28.01  (step t695 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t694))
% 27.83/28.01  (step t696 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies :premises (t695))
% 27.83/28.01  (step t697 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t680 t696))
% 27.83/28.01  (step t698 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.83/28.01  (step t699 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.83/28.01  (step t700 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.83/28.01  (step t701 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.83/28.01  (step t702 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.83/28.01  (step t703 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))))) :rule or_neg)
% 27.83/28.01  (step t704 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule or_neg)
% 27.83/28.01  (step t705 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t697 t698 t699 t700 t701 t702 t703 t704))
% 27.83/28.01  (step t706 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t705))
% 27.83/28.01  (step t707 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t667 t679 t706))
% 27.83/28.01  (step t708 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule or :premises (t707))
% 27.83/28.01  (step t709 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t708))
% 27.83/28.01  (step t710 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.01  (step t711 (cl (= (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule refl)
% 27.83/28.01  (step t712 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t89 t90 t91 t92 t93 t677 t711))
% 27.83/28.01  (step t713 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t714)
% 27.83/28.01  (assume t714.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t714.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t714.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (assume t714.a3 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t714.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t714.a5 (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))
% 27.83/28.01  (step t714.t1 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t714.t2)
% 27.83/28.01  (assume t714.t2.a0 (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))
% 27.83/28.01  (assume t714.t2.a1 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t714.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t714.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t714.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t714.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (step t714.t2.t1 (cl (= (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) false) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_simplify)
% 27.83/28.01  (step t714.t2.t2 (cl (not (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) false)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule equiv1 :premises (t714.t2.t1))
% 27.83/28.01  (step t714.t2.t3 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 27.83/28.01  (step t714.t2.t4 (cl (= (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.sk8 tptp.sk6 tptp.sk5))) :rule refl)
% 27.83/28.01  (step t714.t2.t5 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.83/28.01  (step t714.t2.t6 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t714.t2.a1))
% 27.83/28.01  (step t714.t2.t7 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t714.t2.t6))
% 27.83/28.01  (step t714.t2.t8 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t714.t2.t7))
% 27.83/28.01  (step t714.t2.t9 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t714.t2.a2))
% 27.83/28.01  (step t714.t2.t10 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t714.t2.t9))
% 27.83/28.01  (step t714.t2.t11 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.01  (step t714.t2.t12 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t714.t2.t11 t714.t2.a3))
% 27.83/28.01  (step t714.t2.t13 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t714.t2.a4))
% 27.83/28.01  (step t714.t2.t14 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t714.t2.t13))
% 27.83/28.01  (step t714.t2.t15 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t714.t2.t14))
% 27.83/28.01  (step t714.t2.t16 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t714.t2.a3))
% 27.83/28.01  (step t714.t2.t17 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t714.t2.t15 t714.t2.t16))
% 27.83/28.01  (step t714.t2.t18 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t714.t2.a5))
% 27.83/28.01  (step t714.t2.t19 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t714.t2.t18))
% 27.83/28.01  (step t714.t2.t20 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t714.t2.t19))
% 27.83/28.01  (step t714.t2.t21 (cl (= tptp.sk5 tptp.sk6)) :rule trans :premises (t714.t2.t8 t714.t2.t10 t714.t2.t12 t714.t2.t17 t714.t2.t20))
% 27.83/28.01  (step t714.t2.t22 (cl (= (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk7 tptp.sk6 tptp.sk6))) :rule cong :premises (t714.t2.t5 t714.t2.t21))
% 27.83/28.01  (step t714.t2.t23 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t714.t2.t24 (cl (= (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) :rule cong :premises (t714.t2.t22 t714.t2.t23))
% 27.83/28.01  (step t714.t2.t25 (cl (= (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)) (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule cong :premises (t714.t2.t4 t714.t2.t24))
% 27.83/28.01  (step t714.t2.t26 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule cong :premises (t714.t2.t3 t714.t2.t25))
% 27.83/28.01  (step t714.t2.t27 (cl (= (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv_simplify)
% 27.83/28.01  (step t714.t2.t28 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule equiv2 :premises (t714.t2.t27))
% 27.83/28.01  (step t714.t2.t29 (cl (not (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule not_not)
% 27.83/28.01  (step t714.t2.t30 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t714.t2.t28 t714.t2.t29))
% 27.83/28.01  (step t714.t2.t31 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) false)) :rule resolution :premises (t714.t2.t30 t714.t2.a0))
% 27.83/28.01  (step t714.t2.t32 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) false)) :rule trans :premises (t714.t2.t26 t714.t2.t31))
% 27.83/28.01  (step t714.t2.t33 (cl (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t714.t2.t2 t714.t2.t32))
% 27.83/28.01  (step t714.t2 (cl (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t714.t2.a0 t714.t2.a1 t714.t2.a2 t714.t2.a3 t714.t2.a4 t714.t2.a5))
% 27.83/28.01  (step t714.t3 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule and_pos)
% 27.83/28.01  (step t714.t4 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t714.t5 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t714.t6 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t714.t7 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t714.t8 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t714.t9 (cl (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t714.t2 t714.t3 t714.t4 t714.t5 t714.t6 t714.t7 t714.t8))
% 27.83/28.01  (step t714.t10 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule reordering :premises (t714.t9))
% 27.83/28.01  (step t714.t11 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule contraction :premises (t714.t10))
% 27.83/28.01  (step t714.t12 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t714.t1 t714.t11))
% 27.83/28.01  (step t714.t13 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.01  (step t714.t14 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t714.t12 t714.t13))
% 27.83/28.01  (step t714.t15 (cl (=> (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t714.t14))
% 27.83/28.01  (step t714.t16 (cl (not (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t714.t15))
% 27.83/28.01  (step t714.t17 (cl (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.83/28.01  (step t714.t18 (cl (and (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t714.t17 t714.a5 t714.a3 t714.a0 t714.a1 t714.a4 t714.a2))
% 27.83/28.01  (step t714.t19 (cl (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t714.t16 t714.t18))
% 27.83/28.01  (step t714 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t714.a0 t714.a1 t714.a2 t714.a3 t714.a4 t714.a5))
% 27.83/28.01  (step t715 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t716 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t717 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t718 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t719 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t720 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) :rule and_pos)
% 27.83/28.01  (step t721 (cl (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))))) :rule resolution :premises (t714 t715 t716 t717 t718 t719 t720))
% 27.83/28.01  (step t722 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule reordering :premises (t721))
% 27.83/28.01  (step t723 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule contraction :premises (t722))
% 27.83/28.01  (step t724 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t713 t723))
% 27.83/28.01  (step t725 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.01  (step t726 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t724 t725))
% 27.83/28.01  (step t727 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t726))
% 27.83/28.01  (step t728 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t727))
% 27.83/28.01  (step t729 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t680 t728))
% 27.83/28.01  (step t730 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.83/28.01  (step t731 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.83/28.01  (step t732 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.83/28.01  (step t733 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.83/28.01  (step t734 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.83/28.01  (step t735 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))))) :rule or_neg)
% 27.83/28.01  (step t736 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule or_neg)
% 27.83/28.01  (step t737 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t729 t730 t731 t732 t733 t734 t735 t736))
% 27.83/28.01  (step t738 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t737))
% 27.83/28.01  (step t739 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t710 t712 t738))
% 27.83/28.01  (step t740 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t739))
% 27.83/28.01  (step t741 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule reordering :premises (t740))
% 27.83/28.01  (step t742 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.01  (step t743 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.83/28.01  (step t744 (cl (= (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t745 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t744 t418))
% 27.83/28.01  (step t746 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.01  (step t747 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t745 t746))
% 27.83/28.01  (step t748 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t743 t747))
% 27.83/28.01  (step t749 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t750)
% 27.83/28.01  (assume t750.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))
% 27.83/28.01  (step t750.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t750.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t750.t1))
% 27.83/28.01  (step t750.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t750.t2 t750.a0))
% 27.83/28.01  (step t750 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t750.a0))
% 27.83/28.01  (step t751 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t749 t750))
% 27.83/28.01  (step t752 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t753 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t751 t752))
% 27.83/28.01  (step t754 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t753))
% 27.83/28.01  (step t755 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t742 t748 t754))
% 27.83/28.01  (step t756 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t755))
% 27.83/28.01  (step t757 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t758 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t757))
% 27.83/28.01  (step t759 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t760 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t760.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t760.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t760.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t760.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t760.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t760.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t760.t5))
% 27.83/28.01  (step t760.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t760.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.01  (step t760.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t760.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t760.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t760.t3 t760.t4 t760.t6 t760.t7 t760.t8 t760.t9 t760.t10))
% 27.83/28.01  (step t760 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t761 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t762 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t760 t761))
% 27.83/28.01  (step t763 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t764 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t763))
% 27.83/28.01  (step t765 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t764))
% 27.83/28.01  (step t766 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t767 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t768 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t769 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t767 t768))
% 27.83/28.01  (step t770 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t766 t769))
% 27.83/28.01  (step t771 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t770))
% 27.83/28.01  (anchor :step t772 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t772.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t772.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t772.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t772.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t772.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t772.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t772.t5 t763))
% 27.83/28.01  (step t772.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t772.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t772.t6 t772.t7))
% 27.83/28.01  (step t772.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t769 t772.t8))
% 27.83/28.01  (step t772.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t772.t9))
% 27.83/28.01  (step t772.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t772.t12 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.01  (step t772.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t772.t3 t772.t4 t772.t10 t772.t11 t772.t12))
% 27.83/28.01  (step t772 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.01  (step t773 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t765 t771 t772))
% 27.83/28.01  (step t774 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t762 t773))
% 27.83/28.01  (step t775 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t759 t774 a266))
% 27.83/28.01  (step t776 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t775))
% 27.83/28.01  (step t777 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.01  (step t778 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.01  (step t779 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t744 t453))
% 27.83/28.01  (step t780 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.01  (step t781 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t779 t780))
% 27.83/28.01  (step t782 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t778 t781))
% 27.83/28.01  (step t783 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t784)
% 27.83/28.01  (assume t784.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.01  (step t784.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t784.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t784.t1))
% 27.83/28.01  (step t784.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t784.t2 t784.a0))
% 27.83/28.01  (step t784 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t784.a0))
% 27.83/28.01  (step t785 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t783 t784))
% 27.83/28.01  (step t786 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.01  (step t787 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t785 t786))
% 27.83/28.01  (step t788 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t787))
% 27.83/28.01  (step t789 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t777 t782 t788))
% 27.83/28.01  (step t790 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t789))
% 27.83/28.01  (step t791 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.01  (step t792 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t791))
% 27.83/28.01  (step t793 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t794 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t794.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t794.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t794.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t794.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t794.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t794.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t794.t5))
% 27.83/28.01  (step t794.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t794.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.01  (step t794.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t794.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t794.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t794.t3 t794.t4 t794.t6 t794.t7 t794.t8 t794.t9 t794.t10))
% 27.83/28.01  (step t794 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t795 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.01  (step t796 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t794 t795))
% 27.83/28.01  (step t797 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t798 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t797))
% 27.83/28.01  (step t799 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t798))
% 27.83/28.01  (step t800 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t801 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t802 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t803 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t801 t802))
% 27.83/28.01  (step t804 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t800 t803))
% 27.83/28.01  (step t805 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t804))
% 27.83/28.01  (anchor :step t806 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t806.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t806.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t806.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t806.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t806.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t806.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t806.t5 t797))
% 27.83/28.01  (step t806.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t806.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t806.t6 t806.t7))
% 27.83/28.01  (step t806.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t803 t806.t8))
% 27.83/28.01  (step t806.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t806.t9))
% 27.83/28.01  (step t806.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t806.t12 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.01  (step t806.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t806.t3 t806.t4 t806.t10 t806.t11 t806.t12))
% 27.83/28.01  (step t806 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.01  (step t807 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t799 t805 t806))
% 27.83/28.01  (step t808 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t796 t807))
% 27.83/28.01  (step t809 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t793 t808 a271))
% 27.83/28.01  (step t810 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t809))
% 27.83/28.01  (step t811 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.01  (step t812 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.01  (step t813 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t744 t523))
% 27.83/28.01  (step t814 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.01  (step t815 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t813 t814))
% 27.83/28.01  (step t816 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t812 t815))
% 27.83/28.01  (step t817 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t818)
% 27.83/28.01  (assume t818.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.01  (step t818.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t818.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t818.t1))
% 27.83/28.01  (step t818.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t818.t2 t818.a0))
% 27.83/28.01  (step t818 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t818.a0))
% 27.83/28.01  (step t819 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t817 t818))
% 27.83/28.01  (step t820 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t821 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t819 t820))
% 27.83/28.01  (step t822 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t821))
% 27.83/28.01  (step t823 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t811 t816 t822))
% 27.83/28.01  (step t824 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t823))
% 27.83/28.01  (step t825 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t826 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t825))
% 27.83/28.01  (step t827 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t828 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t828.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t828.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t828.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t828.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t828.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t828.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t828.t5))
% 27.83/28.01  (step t828.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t828.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.01  (step t828.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t828.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t828.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t828.t3 t828.t4 t828.t6 t828.t7 t828.t8 t828.t9 t828.t10))
% 27.83/28.01  (step t828 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t829 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t830 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t828 t829))
% 27.83/28.01  (step t831 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t832 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t831))
% 27.83/28.01  (step t833 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t832))
% 27.83/28.01  (step t834 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t835 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t836 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t837 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t835 t836))
% 27.83/28.01  (step t838 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t834 t837))
% 27.83/28.01  (step t839 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t838))
% 27.83/28.01  (anchor :step t840 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t840.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t840.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t840.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t840.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t840.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t840.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t840.t5 t831))
% 27.83/28.01  (step t840.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t840.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t840.t6 t840.t7))
% 27.83/28.01  (step t840.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t837 t840.t8))
% 27.83/28.01  (step t840.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t840.t9))
% 27.83/28.01  (step t840.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t840.t12 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.01  (step t840.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t840.t3 t840.t4 t840.t10 t840.t11 t840.t12))
% 27.83/28.01  (step t840 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.01  (step t841 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t833 t839 t840))
% 27.83/28.01  (step t842 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t830 t841))
% 27.83/28.01  (step t843 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t827 t842 a273))
% 27.83/28.01  (step t844 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t843))
% 27.83/28.01  (step t845 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.01  (step t846 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.01  (step t847 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t744 t558))
% 27.83/28.01  (step t848 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.01  (step t849 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t847 t848))
% 27.83/28.01  (step t850 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t846 t849))
% 27.83/28.01  (step t851 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t852)
% 27.83/28.01  (assume t852.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.01  (step t852.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.01  (step t852.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t852.t1))
% 27.83/28.01  (step t852.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t852.t2 t852.a0))
% 27.83/28.01  (step t852 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t852.a0))
% 27.83/28.01  (step t853 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t851 t852))
% 27.83/28.01  (step t854 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.01  (step t855 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t853 t854))
% 27.83/28.01  (step t856 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t855))
% 27.83/28.01  (step t857 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t845 t850 t856))
% 27.83/28.01  (step t858 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t857))
% 27.83/28.01  (step t859 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.01  (step t860 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t859))
% 27.83/28.01  (step t861 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t862 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t862.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t862.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t862.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t862.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t862.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t862.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t862.t5))
% 27.83/28.01  (step t862.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t862.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t862.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t862.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t862.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t862.t3 t862.t4 t862.t6 t862.t7 t862.t8 t862.t9 t862.t10))
% 27.83/28.01  (step t862 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t863 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.01  (step t864 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t862 t863))
% 27.83/28.01  (step t865 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t866 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t865))
% 27.83/28.01  (step t867 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t866))
% 27.83/28.01  (step t868 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t869 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t870 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t871 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t869 t870))
% 27.83/28.01  (step t872 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t868 t871))
% 27.83/28.01  (step t873 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t872))
% 27.83/28.01  (anchor :step t874 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t874.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t874.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t874.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t874.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t874.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t874.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t874.t5 t865))
% 27.83/28.01  (step t874.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t874.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t874.t6 t874.t7))
% 27.83/28.01  (step t874.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t871 t874.t8))
% 27.83/28.01  (step t874.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t874.t9))
% 27.83/28.01  (step t874.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t874.t12 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.01  (step t874.t13 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t865 t874.t12))
% 27.83/28.01  (step t874.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t874.t3 t874.t4 t874.t10 t874.t11 t874.t13))
% 27.83/28.01  (step t874 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.01  (step t875 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t867 t873 t874))
% 27.83/28.01  (step t876 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t864 t875))
% 27.83/28.01  (step t877 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t861 t876 a274))
% 27.83/28.01  (step t878 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t877))
% 27.83/28.01  (step t879 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t880)
% 27.83/28.01  (assume t880.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.01  (step t880.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.01  (step t880.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t880.t1))
% 27.83/28.01  (step t880.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t880.t2 t880.a0))
% 27.83/28.01  (step t880 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t880.a0))
% 27.83/28.01  (step t881 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t879 t880))
% 27.83/28.01  (step t882 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.01  (step t883 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t881 t882))
% 27.83/28.01  (step t884 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t883))
% 27.83/28.01  (step t885 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t884))
% 27.83/28.01  (step t886 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t887 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t886))
% 27.83/28.01  (step t888 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t889 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t889.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t889.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t889.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t889.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t889.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t889.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t889.t5))
% 27.83/28.01  (step t889.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t889.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t889.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t889.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t889.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t889.t3 t889.t4 t889.t6 t889.t7 t889.t8 t889.t9 t889.t10))
% 27.83/28.01  (step t889 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t890 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t891 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t889 t890))
% 27.83/28.01  (step t892 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t893 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t892))
% 27.83/28.01  (step t894 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t893))
% 27.83/28.01  (step t895 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t896 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t897 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t898 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t896 t897))
% 27.83/28.01  (step t899 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t895 t898))
% 27.83/28.01  (step t900 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t899))
% 27.83/28.01  (anchor :step t901 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t901.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t901.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t901.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t901.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t901.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t901.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t901.t5 t892))
% 27.83/28.01  (step t901.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t901.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t901.t6 t901.t7))
% 27.83/28.01  (step t901.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t898 t901.t8))
% 27.83/28.01  (step t901.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t901.t9))
% 27.83/28.01  (step t901.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t901.t12 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t901.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t901.t3 t901.t4 t901.t10 t901.t11 t901.t12))
% 27.83/28.01  (step t901 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.01  (step t902 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t894 t900 t901))
% 27.83/28.01  (step t903 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t891 t902))
% 27.83/28.01  (step t904 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t888 t903 a255))
% 27.83/28.01  (step t905 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t904))
% 27.83/28.01  (step t906 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t907)
% 27.83/28.01  (assume t907.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.01  (step t907.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.01  (step t907.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule or :premises (t907.t1))
% 27.83/28.01  (step t907.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t907.t2 t907.a0))
% 27.83/28.01  (step t907 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t907.a0))
% 27.83/28.01  (step t908 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t906 t907))
% 27.83/28.01  (step t909 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.01  (step t910 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t908 t909))
% 27.83/28.01  (step t911 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t910))
% 27.83/28.01  (step t912 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies :premises (t911))
% 27.83/28.01  (step t913 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t914 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t913))
% 27.83/28.01  (step t915 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t916 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t916.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t916.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t916.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t916.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t916.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t916.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t916.t5))
% 27.83/28.01  (step t916.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t916.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.01  (step t916.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t916.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t916.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t916.t3 t916.t4 t916.t6 t916.t7 t916.t8 t916.t9 t916.t10))
% 27.83/28.01  (step t916 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t917 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t918 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t916 t917))
% 27.83/28.01  (step t919 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t920 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t919))
% 27.83/28.01  (step t921 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t920))
% 27.83/28.01  (step t922 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t923 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t924 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t925 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t923 t924))
% 27.83/28.01  (step t926 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t922 t925))
% 27.83/28.01  (step t927 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t926))
% 27.83/28.01  (anchor :step t928 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t928.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t928.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t928.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t928.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t928.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t928.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t928.t5 t919))
% 27.83/28.01  (step t928.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t928.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t928.t6 t928.t7))
% 27.83/28.01  (step t928.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t925 t928.t8))
% 27.83/28.01  (step t928.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t928.t9))
% 27.83/28.01  (step t928.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t928.t12 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.01  (step t928.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t928.t3 t928.t4 t928.t10 t928.t11 t928.t12))
% 27.83/28.01  (step t928 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.01  (step t929 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t921 t927 t928))
% 27.83/28.01  (step t930 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t918 t929))
% 27.83/28.01  (step t931 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t915 t930 a272))
% 27.83/28.01  (step t932 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t931))
% 27.83/28.01  (step t933 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t934)
% 27.83/28.01  (assume t934.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.01  (step t934.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.01  (step t934.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t934.t1))
% 27.83/28.01  (step t934.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t934.t2 t934.a0))
% 27.83/28.01  (step t934 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t934.a0))
% 27.83/28.01  (step t935 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t933 t934))
% 27.83/28.01  (step t936 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.01  (step t937 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t935 t936))
% 27.83/28.01  (step t938 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t937))
% 27.83/28.01  (step t939 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t938))
% 27.83/28.01  (step t940 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t941 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t940))
% 27.83/28.01  (step t942 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t943 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t943.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t943.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t943.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t943.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t943.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t943.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t943.t5))
% 27.83/28.01  (step t943.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.01  (step t943.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t943.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t943.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t943.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t943.t3 t943.t4 t943.t6 t943.t7 t943.t8 t943.t9 t943.t10))
% 27.83/28.01  (step t943 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t944 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t945 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t943 t944))
% 27.83/28.01  (step t946 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t947 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t946))
% 27.83/28.01  (step t948 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t947))
% 27.83/28.01  (step t949 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t950 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t951 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t952 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t950 t951))
% 27.83/28.01  (step t953 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t949 t952))
% 27.83/28.01  (step t954 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t953))
% 27.83/28.01  (anchor :step t955 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t955.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t955.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t955.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t955.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t955.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t955.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t955.t5 t946))
% 27.83/28.01  (step t955.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t955.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t955.t6 t955.t7))
% 27.83/28.01  (step t955.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t952 t955.t8))
% 27.83/28.01  (step t955.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t955.t9))
% 27.83/28.01  (step t955.t11 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.01  (step t955.t12 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t955.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t955.t3 t955.t4 t955.t10 t955.t11 t955.t12))
% 27.83/28.01  (step t955 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.01  (step t956 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t948 t954 t955))
% 27.83/28.01  (step t957 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t945 t956))
% 27.83/28.01  (step t958 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t942 t957 a275))
% 27.83/28.01  (step t959 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t958))
% 27.83/28.01  (step t960 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t666 t709 t149 t163 t741 t149 t163 t756 t758 t776 t790 t792 t810 t824 t826 t844 t858 t860 t878 t885 t887 t905 t912 t914 t932 t939 t941 t959))
% 27.83/28.01  (step t961 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3))) :rule contraction :premises (t960))
% 27.83/28.01  (step t962 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule and_neg)
% 27.83/28.01  (step t963 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t964)
% 27.83/28.01  (assume t964.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t964.a1 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.83/28.01  (assume t964.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t964.a3 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.83/28.01  (assume t964.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (assume t964.a5 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t964.a6 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t964.a7 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.83/28.01  (step t964.t1 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t964.t2)
% 27.83/28.01  (assume t964.t2.a0 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (assume t964.t2.a1 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t964.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t964.t2.a3 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t964.t2.a4 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 27.83/28.01  (assume t964.t2.a5 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 27.83/28.01  (assume t964.t2.a6 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t964.t2.a7 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))
% 27.83/28.01  (step t964.t2.t1 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t964.t2.a7))
% 27.83/28.01  (step t964.t2.t2 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule symm :premises (t964.t2.t1))
% 27.83/28.01  (step t964.t2.t3 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t964.t2.a6))
% 27.83/28.01  (step t964.t2.t4 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t964.t2.t3))
% 27.83/28.01  (step t964.t2.t5 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t964.t2.t4))
% 27.83/28.01  (step t964.t2.t6 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.83/28.01  (step t964.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t964.t2.a3))
% 27.83/28.01  (step t964.t2.t8 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t964.t2.t7))
% 27.83/28.01  (step t964.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.01  (step t964.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t964.t2.t9 t964.t2.a2))
% 27.83/28.01  (step t964.t2.t11 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t964.t2.a1))
% 27.83/28.01  (step t964.t2.t12 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t964.t2.t11))
% 27.83/28.01  (step t964.t2.t13 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t964.t2.t12))
% 27.83/28.01  (step t964.t2.t14 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t964.t2.a2))
% 27.83/28.01  (step t964.t2.t15 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t964.t2.t13 t964.t2.t14))
% 27.83/28.01  (step t964.t2.t16 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t964.t2.a0))
% 27.83/28.01  (step t964.t2.t17 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t964.t2.t16))
% 27.83/28.01  (step t964.t2.t18 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t964.t2.t17))
% 27.83/28.01  (step t964.t2.t19 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t964.t2.t8 t964.t2.t10 t964.t2.t15 t964.t2.t18))
% 27.83/28.01  (step t964.t2.t20 (cl (= tptp.sk6 tptp.nil)) :rule symm :premises (t964.t2.t19))
% 27.83/28.01  (step t964.t2.t21 (cl (= (tptp.app tptp.sk3 tptp.sk6) (tptp.app tptp.sk3 tptp.nil))) :rule cong :premises (t964.t2.t6 t964.t2.t20))
% 27.83/28.01  (step t964.t2.t22 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t964.t2.a5))
% 27.83/28.01  (step t964.t2.t23 (cl (= (tptp.app tptp.sk3 tptp.sk6) tptp.sk3)) :rule trans :premises (t964.t2.t21 t964.t2.t22))
% 27.83/28.01  (step t964.t2.t24 (cl (= (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)) (tptp.app tptp.nil tptp.sk3))) :rule cong :premises (t964.t2.t5 t964.t2.t23))
% 27.83/28.01  (step t964.t2.t25 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t964.t2.a4))
% 27.83/28.01  (step t964.t2.t26 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t964.t2.t25))
% 27.83/28.01  (step t964.t2.t27 (cl (= (tptp.app tptp.nil tptp.sk3) (tptp.app tptp.sk6 tptp.sk3))) :rule cong :premises (t964.t2.t19 t964.t2.t6))
% 27.83/28.01  (step t964.t2.t28 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app tptp.sk6 tptp.sk3))) :rule trans :premises (t964.t2.t22 t964.t2.t26 t964.t2.t27))
% 27.83/28.01  (step t964.t2.t29 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk3))) :rule trans :premises (t964.t2.a5 t964.t2.t28))
% 27.83/28.01  (step t964.t2.t30 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule cong :premises (t964.t2.t29 t964.t2.t19))
% 27.83/28.01  (step t964.t2.t31 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule trans :premises (t964.t2.t2 t964.t2.t24 t964.t2.t25 t964.t2.a5 t964.t2.t30))
% 27.83/28.01  (step t964.t2 (cl (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule subproof :discharge (t964.t2.a0 t964.t2.a1 t964.t2.a2 t964.t2.a3 t964.t2.a4 t964.t2.a5 t964.t2.a6 t964.t2.a7))
% 27.83/28.01  (step t964.t3 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t964.t4 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t964.t5 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t964.t6 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t964.t7 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t964.t8 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t964.t9 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t964.t10 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.83/28.01  (step t964.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule resolution :premises (t964.t2 t964.t3 t964.t4 t964.t5 t964.t6 t964.t7 t964.t8 t964.t9 t964.t10))
% 27.83/28.01  (step t964.t12 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule reordering :premises (t964.t11))
% 27.83/28.01  (step t964.t13 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule contraction :premises (t964.t12))
% 27.83/28.01  (step t964.t14 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule resolution :premises (t964.t1 t964.t13))
% 27.83/28.01  (step t964.t15 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)))) :rule implies_neg2)
% 27.83/28.01  (step t964.t16 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t964.t14 t964.t15))
% 27.83/28.01  (step t964.t17 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t964.t16))
% 27.83/28.01  (step t964.t18 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule implies :premises (t964.t17))
% 27.83/28.01  (step t964.t19 (cl (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule and_neg)
% 27.83/28.01  (step t964.t20 (cl (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.nil tptp.sk5) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule resolution :premises (t964.t19 t964.a4 t964.a6 t964.a2 t964.a0 t964.a3 t964.a1 t964.a5 t964.a7))
% 27.83/28.01  (step t964.t21 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule resolution :premises (t964.t18 t964.t20))
% 27.83/28.01  (step t964 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule subproof :discharge (t964.a0 t964.a1 t964.a2 t964.a3 t964.a4 t964.a5 t964.a6 t964.a7))
% 27.83/28.01  (step t965 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t966 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t967 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t968 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t969 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t970 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t971 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t972 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) :rule and_pos)
% 27.83/28.01  (step t973 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))))) :rule resolution :premises (t964 t965 t966 t967 t968 t969 t970 t971 t972))
% 27.83/28.01  (step t974 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule reordering :premises (t973))
% 27.83/28.01  (step t975 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule contraction :premises (t974))
% 27.83/28.01  (step t976 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule resolution :premises (t963 t975))
% 27.83/28.01  (step t977 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)))) :rule implies_neg2)
% 27.83/28.01  (step t978 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t976 t977))
% 27.83/28.01  (step t979 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t978))
% 27.83/28.01  (step t980 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule implies :premises (t979))
% 27.83/28.01  (step t981 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6)))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) :rule resolution :premises (t962 t980))
% 27.83/28.01  (step t982 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6)) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app tptp.sk5 (tptp.app tptp.sk3 tptp.sk6))))) :rule reordering :premises (t981))
% 27.83/28.01  (step t983 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6))) :rule resolution :premises (t961 t982 t209 t216 t151 t158 t198 t205 t137 t144 t187 t194 a148))
% 27.83/28.01  (step t984 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5))) :rule contraction :premises (t983))
% 27.83/28.01  (step t985 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t984 t614 t621))
% 27.83/28.01  (step t986 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t985))
% 27.83/28.01  (step t987 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t986 t625 t627 t634 a84 t641))
% 27.83/28.01  (step t988 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t987))
% 27.83/28.01  (step t989 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk6) tptp.nil)))) :rule resolution :premises (t988 a194 t161 t147 a192 a187 a191 t646))
% 27.83/28.01  (step t990 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.01  (step t991 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t990))
% 27.83/28.01  (step t992 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.01  (step t993 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t992))
% 27.83/28.01  (step t994 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t70 t81 t991 a192 a191 t993 a192 a191))
% 27.83/28.01  (step t995 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (not (= tptp.sk5 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t994))
% 27.83/28.01  (step t996 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.01  (step t997 (cl (= (= (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) true) (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule equiv_simplify)
% 27.83/28.01  (step t998 (cl (not (= (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) true)) (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule equiv1 :premises (t997))
% 27.83/28.01  (step t999 (cl (= (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))))) :rule all_simplify)
% 27.83/28.01  (step t1000 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule refl)
% 27.83/28.01  (step t1001 (cl (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule all_simplify)
% 27.83/28.01  (step t1002 (cl (= (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule cong :premises (t1000 t1001))
% 27.83/28.01  (step t1003 (cl (= (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) true)) :rule all_simplify)
% 27.83/28.01  (step t1004 (cl (= (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) true)) :rule trans :premises (t1002 t1003))
% 27.83/28.01  (step t1005 (cl (= (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) true)) :rule trans :premises (t999 t1004))
% 27.83/28.01  (step t1006 (cl (= (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t998 t1005))
% 27.83/28.01  (step t1007 (cl (= (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule refl)
% 27.83/28.01  (step t1008 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t89 t90 t91 t92 t93 t1006 t1007))
% 27.83/28.01  (step t1009 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule and_neg)
% 27.83/28.01  (step t1010 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t1011)
% 27.83/28.01  (assume t1011.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t1011.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t1011.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (assume t1011.a3 (= tptp.nil tptp.sk5))
% 27.83/28.01  (assume t1011.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t1011.a5 (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))
% 27.83/28.01  (step t1011.t1 (cl (=> (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t1011.t2)
% 27.83/28.01  (assume t1011.t2.a0 (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))
% 27.83/28.01  (assume t1011.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.01  (assume t1011.t2.a2 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.01  (assume t1011.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.01  (assume t1011.t2.a4 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.01  (assume t1011.t2.a5 (= tptp.nil tptp.sk5))
% 27.83/28.01  (step t1011.t2.t1 (cl (= (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) false) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule equiv_simplify)
% 27.83/28.01  (step t1011.t2.t2 (cl (not (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) false)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule equiv1 :premises (t1011.t2.t1))
% 27.83/28.01  (step t1011.t2.t3 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.83/28.01  (step t1011.t2.t4 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t1011.t2.a5))
% 27.83/28.01  (step t1011.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t1011.t2.a4))
% 27.83/28.01  (step t1011.t2.t6 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t1011.t2.t5))
% 27.83/28.01  (step t1011.t2.t7 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.01  (step t1011.t2.t8 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t1011.t2.t7 t1011.t2.a3))
% 27.83/28.01  (step t1011.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t1011.t2.a2))
% 27.83/28.01  (step t1011.t2.t10 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t1011.t2.a3))
% 27.83/28.01  (step t1011.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t1011.t2.t9 t1011.t2.t10))
% 27.83/28.01  (step t1011.t2.t12 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t1011.t2.a1))
% 27.83/28.01  (step t1011.t2.t13 (cl (= tptp.sk5 tptp.sk6)) :rule trans :premises (t1011.t2.t4 t1011.t2.t6 t1011.t2.t8 t1011.t2.t11 t1011.t2.t12))
% 27.83/28.01  (step t1011.t2.t14 (cl (= (tptp.sk9 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule cong :premises (t1011.t2.t3 t1011.t2.t13))
% 27.83/28.01  (step t1011.t2.t15 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t1011.t2.t6 t1011.t2.t8 t1011.t2.t11 t1011.t2.t12))
% 27.83/28.01  (step t1011.t2.t16 (cl (= (tptp.sk9 tptp.nil tptp.nil) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule cong :premises (t1011.t2.t15 t1011.t2.t15))
% 27.83/28.01  (step t1011.t2.t17 (cl (= (tptp.sk9 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.nil tptp.nil))) :rule symm :premises (t1011.t2.t16))
% 27.83/28.01  (step t1011.t2.t18 (cl (= (tptp.sk9 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.nil tptp.nil))) :rule trans :premises (t1011.t2.t14 t1011.t2.t17))
% 27.83/28.01  (step t1011.t2.t19 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.nil tptp.nil)))) :rule cong :premises (t1011.t2.t18))
% 27.83/28.01  (step t1011.t2.t20 (cl (= (tptp.ssItem (tptp.sk9 tptp.nil tptp.nil)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule cong :premises (t1011.t2.t16))
% 27.83/28.01  (step t1011.t2.t21 (cl (= (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) false) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule equiv_simplify)
% 27.83/28.01  (step t1011.t2.t22 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) false) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule equiv2 :premises (t1011.t2.t21))
% 27.83/28.01  (step t1011.t2.t23 (cl (not (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) :rule not_not)
% 27.83/28.01  (step t1011.t2.t24 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) false) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) :rule resolution :premises (t1011.t2.t22 t1011.t2.t23))
% 27.83/28.01  (step t1011.t2.t25 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) false)) :rule resolution :premises (t1011.t2.t24 t1011.t2.a0))
% 27.83/28.01  (step t1011.t2.t26 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) false)) :rule trans :premises (t1011.t2.t19 t1011.t2.t20 t1011.t2.t25))
% 27.83/28.01  (step t1011.t2.t27 (cl (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1011.t2.t2 t1011.t2.t26))
% 27.83/28.01  (step t1011.t2 (cl (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1011.t2.a0 t1011.t2.a1 t1011.t2.a2 t1011.t2.a3 t1011.t2.a4 t1011.t2.a5))
% 27.83/28.01  (step t1011.t3 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.83/28.01  (step t1011.t4 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t1011.t5 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t1011.t6 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t1011.t7 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t1011.t8 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t1011.t9 (cl (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)))) :rule resolution :premises (t1011.t2 t1011.t3 t1011.t4 t1011.t5 t1011.t6 t1011.t7 t1011.t8))
% 27.83/28.01  (step t1011.t10 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1011.t9))
% 27.83/28.01  (step t1011.t11 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t1011.t10))
% 27.83/28.01  (step t1011.t12 (cl (=> (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1011.t1 t1011.t11))
% 27.83/28.01  (step t1011.t13 (cl (=> (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t1011.t14 (cl (=> (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (=> (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1011.t12 t1011.t13))
% 27.83/28.01  (step t1011.t15 (cl (=> (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1011.t14))
% 27.83/28.01  (step t1011.t16 (cl (not (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1011.t15))
% 27.83/28.01  (step t1011.t17 (cl (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5))) :rule and_neg)
% 27.83/28.01  (step t1011.t18 (cl (and (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) :rule resolution :premises (t1011.t17 t1011.a5 t1011.a2 t1011.a4 t1011.a1 t1011.a0 t1011.a3))
% 27.83/28.01  (step t1011.t19 (cl (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1011.t16 t1011.t18))
% 27.83/28.01  (step t1011 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1011.a0 t1011.a1 t1011.a2 t1011.a3 t1011.a4 t1011.a5))
% 27.83/28.01  (step t1012 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t1013 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.01  (step t1014 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.01  (step t1015 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.01  (step t1016 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.01  (step t1017 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.83/28.01  (step t1018 (cl (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1011 t1012 t1013 t1014 t1015 t1016 t1017))
% 27.83/28.01  (step t1019 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1018))
% 27.83/28.01  (step t1020 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t1019))
% 27.83/28.01  (step t1021 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1010 t1020))
% 27.83/28.01  (step t1022 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.01  (step t1023 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1021 t1022))
% 27.83/28.01  (step t1024 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1023))
% 27.83/28.01  (step t1025 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1024))
% 27.83/28.01  (step t1026 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1009 t1025))
% 27.83/28.01  (step t1027 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.83/28.01  (step t1028 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.83/28.01  (step t1029 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.83/28.01  (step t1030 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.83/28.01  (step t1031 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.83/28.01  (step t1032 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule or_neg)
% 27.83/28.01  (step t1033 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule or_neg)
% 27.83/28.01  (step t1034 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1026 t1027 t1028 t1029 t1030 t1031 t1032 t1033))
% 27.83/28.01  (step t1035 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1034))
% 27.83/28.01  (step t1036 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t996 t1008 t1035))
% 27.83/28.01  (step t1037 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule or :premises (t1036))
% 27.83/28.01  (step t1038 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1037))
% 27.83/28.01  (step t1039 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.01  (step t1040 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1039))
% 27.83/28.01  (step t1041 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1040))
% 27.83/28.01  (step t1042 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule or_pos)
% 27.83/28.01  (step t1043 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t1042))
% 27.83/28.01  (step t1044 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule reordering :premises (t1043))
% 27.83/28.01  (step t1045 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.01  (step t1046 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1045))
% 27.83/28.01  (step t1047 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1046))
% 27.83/28.01  (step t1048 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule or_pos)
% 27.83/28.01  (step t1049 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t1048))
% 27.83/28.01  (step t1050 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule reordering :premises (t1049))
% 27.83/28.01  (step t1051 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.01  (step t1052 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1051))
% 27.83/28.01  (step t1053 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1052))
% 27.83/28.01  (step t1054 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t1055)
% 27.83/28.01  (assume t1055.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.01  (step t1055.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.01  (step t1055.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t1055.t1))
% 27.83/28.01  (step t1055.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1055.t2 t1055.a0))
% 27.83/28.01  (step t1055 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1055.a0))
% 27.83/28.01  (step t1056 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1054 t1055))
% 27.83/28.01  (step t1057 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.01  (step t1058 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1056 t1057))
% 27.83/28.01  (step t1059 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1058))
% 27.83/28.01  (step t1060 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1059))
% 27.83/28.01  (step t1061 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.01  (step t1062 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t1061))
% 27.83/28.01  (step t1063 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.01  (anchor :step t1064 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t1064.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t1064.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t1064.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t1064.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t1064.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.01  (step t1064.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1064.t5))
% 27.83/28.01  (step t1064.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.01  (step t1064.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t1064.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.01  (step t1064.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.01  (step t1064.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1064.t3 t1064.t4 t1064.t6 t1064.t7 t1064.t8 t1064.t9 t1064.t10))
% 27.83/28.01  (step t1064 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.01  (step t1065 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.01  (step t1066 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1064 t1065))
% 27.83/28.01  (step t1067 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.01  (step t1068 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1067))
% 27.83/28.01  (step t1069 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1068))
% 27.83/28.01  (step t1070 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.01  (step t1071 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.01  (step t1072 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.01  (step t1073 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1071 t1072))
% 27.83/28.01  (step t1074 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1070 t1073))
% 27.83/28.01  (step t1075 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1074))
% 27.83/28.01  (anchor :step t1076 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.01  (step t1076.t1 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t1076.t2 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t1076.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.01  (step t1076.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.01  (step t1076.t5 (cl (= A A)) :rule refl)
% 27.83/28.01  (step t1076.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1076.t5 t1067))
% 27.83/28.01  (step t1076.t7 (cl (= B B)) :rule refl)
% 27.83/28.01  (step t1076.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1076.t6 t1076.t7))
% 27.83/28.01  (step t1076.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1073 t1076.t8))
% 27.83/28.01  (step t1076.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1076.t9))
% 27.83/28.01  (step t1076.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.01  (step t1076.t12 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.01  (step t1076.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t1076.t3 t1076.t4 t1076.t10 t1076.t11 t1076.t12))
% 27.83/28.01  (step t1076 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.01  (step t1077 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t1069 t1075 t1076))
% 27.83/28.01  (step t1078 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1066 t1077))
% 27.83/28.01  (step t1079 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t1063 t1078 a256))
% 27.83/28.01  (step t1080 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t1079))
% 27.83/28.01  (step t1081 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.01  (anchor :step t1082)
% 27.83/28.01  (assume t1082.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.01  (step t1082.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.01  (step t1082.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule or :premises (t1082.t1))
% 27.83/28.01  (step t1082.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1082.t2 t1082.a0))
% 27.83/28.01  (step t1082 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t1082.a0))
% 27.83/28.02  (step t1083 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1081 t1082))
% 27.83/28.02  (step t1084 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.83/28.02  (step t1085 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1083 t1084))
% 27.83/28.02  (step t1086 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t1085))
% 27.83/28.02  (step t1087 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule implies :premises (t1086))
% 27.83/28.02  (step t1088 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.02  (step t1089 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t1088))
% 27.83/28.02  (step t1090 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1091 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1091.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1091.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1091.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1091.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1091.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1091.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1091.t5))
% 27.83/28.02  (step t1091.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1091.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1091.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1091.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1091.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1091.t3 t1091.t4 t1091.t6 t1091.t7 t1091.t8 t1091.t9 t1091.t10))
% 27.83/28.02  (step t1091 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1092 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.02  (step t1093 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1091 t1092))
% 27.83/28.02  (step t1094 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1095 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1094))
% 27.83/28.02  (step t1096 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1095))
% 27.83/28.02  (step t1097 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1098 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1099 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1100 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1098 t1099))
% 27.83/28.02  (step t1101 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1097 t1100))
% 27.83/28.02  (step t1102 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1101))
% 27.83/28.02  (anchor :step t1103 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1103.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1103.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1103.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1103.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1103.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1103.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1103.t5 t1094))
% 27.83/28.02  (step t1103.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1103.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1103.t6 t1103.t7))
% 27.83/28.02  (step t1103.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1100 t1103.t8))
% 27.83/28.02  (step t1103.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1103.t9))
% 27.83/28.02  (step t1103.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1103.t12 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.02  (step t1103.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t1103.t3 t1103.t4 t1103.t10 t1103.t11 t1103.t12))
% 27.83/28.02  (step t1103 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.02  (step t1104 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t1096 t1102 t1103))
% 27.83/28.02  (step t1105 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1093 t1104))
% 27.83/28.02  (step t1106 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t1090 t1105 a276))
% 27.83/28.02  (step t1107 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t1106))
% 27.83/28.02  (step t1108 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1109)
% 27.83/28.02  (assume t1109.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.02  (step t1109.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1109.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule or :premises (t1109.t1))
% 27.83/28.02  (step t1109.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1109.t2 t1109.a0))
% 27.83/28.02  (step t1109 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1109.a0))
% 27.83/28.02  (step t1110 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1108 t1109))
% 27.83/28.02  (step t1111 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1112 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1110 t1111))
% 27.83/28.02  (step t1113 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1112))
% 27.83/28.02  (step t1114 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1113))
% 27.83/28.02  (step t1115 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1116 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t1115))
% 27.83/28.02  (step t1117 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1118 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1118.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1118.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1118.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1118.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1118.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1118.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1118.t5))
% 27.83/28.02  (step t1118.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1118.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1118.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1118.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1118.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1118.t3 t1118.t4 t1118.t6 t1118.t7 t1118.t8 t1118.t9 t1118.t10))
% 27.83/28.02  (step t1118 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1119 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1120 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1118 t1119))
% 27.83/28.02  (step t1121 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1122 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1121))
% 27.83/28.02  (step t1123 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1122))
% 27.83/28.02  (step t1124 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1125 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1126 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1127 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1125 t1126))
% 27.83/28.02  (step t1128 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1124 t1127))
% 27.83/28.02  (step t1129 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1128))
% 27.83/28.02  (anchor :step t1130 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1130.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1130.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1130.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1130.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1130.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1130.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1130.t5 t1121))
% 27.83/28.02  (step t1130.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1130.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1130.t6 t1130.t7))
% 27.83/28.02  (step t1130.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1127 t1130.t8))
% 27.83/28.02  (step t1130.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1130.t9))
% 27.83/28.02  (step t1130.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1130.t12 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1130.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t1130.t3 t1130.t4 t1130.t10 t1130.t11 t1130.t12))
% 27.83/28.02  (step t1130 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.02  (step t1131 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t1123 t1129 t1130))
% 27.83/28.02  (step t1132 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1120 t1131))
% 27.83/28.02  (step t1133 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t1117 t1132 a280))
% 27.83/28.02  (step t1134 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t1133))
% 27.83/28.02  (step t1135 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1136)
% 27.83/28.02  (assume t1136.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.02  (step t1136.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1136.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule or :premises (t1136.t1))
% 27.83/28.02  (step t1136.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t1136.t2 t1136.a0))
% 27.83/28.02  (step t1136 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule subproof :discharge (t1136.a0))
% 27.83/28.02  (step t1137 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t1135 t1136))
% 27.83/28.02  (step t1138 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.02  (step t1139 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t1137 t1138))
% 27.83/28.02  (step t1140 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t1139))
% 27.83/28.02  (step t1141 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies :premises (t1140))
% 27.83/28.02  (step t1142 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.02  (step t1143 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t1142))
% 27.83/28.02  (step t1144 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1145 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1145.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1145.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1145.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1145.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1145.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1145.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1145.t5))
% 27.83/28.02  (step t1145.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1145.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.02  (step t1145.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1145.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1145.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1145.t3 t1145.t4 t1145.t6 t1145.t7 t1145.t8 t1145.t9 t1145.t10))
% 27.83/28.02  (step t1145 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1146 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.02  (step t1147 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1145 t1146))
% 27.83/28.02  (step t1148 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1149 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1148))
% 27.83/28.02  (step t1150 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1149))
% 27.83/28.02  (step t1151 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1152 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1153 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1154 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1152 t1153))
% 27.83/28.02  (step t1155 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1151 t1154))
% 27.83/28.02  (step t1156 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1155))
% 27.83/28.02  (anchor :step t1157 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1157.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1157.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1157.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1157.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1157.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1157.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1157.t5 t1148))
% 27.83/28.02  (step t1157.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1157.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1157.t6 t1157.t7))
% 27.83/28.02  (step t1157.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1154 t1157.t8))
% 27.83/28.02  (step t1157.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1157.t9))
% 27.83/28.02  (step t1157.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1157.t12 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.02  (step t1157.t13 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t1148 t1157.t12))
% 27.83/28.02  (step t1157.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t1157.t3 t1157.t4 t1157.t10 t1157.t11 t1157.t13))
% 27.83/28.02  (step t1157 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.02  (step t1158 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t1150 t1156 t1157))
% 27.83/28.02  (step t1159 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1147 t1158))
% 27.83/28.02  (step t1160 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t1144 t1159 a282))
% 27.83/28.02  (step t1161 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t1160))
% 27.83/28.02  (step t1162 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1163)
% 27.83/28.02  (assume t1163.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.02  (step t1163.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1163.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t1163.t1))
% 27.83/28.02  (step t1163.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1163.t2 t1163.a0))
% 27.83/28.02  (step t1163 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1163.a0))
% 27.83/28.02  (step t1164 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1162 t1163))
% 27.83/28.02  (step t1165 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1166 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1164 t1165))
% 27.83/28.02  (step t1167 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1166))
% 27.83/28.02  (step t1168 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1167))
% 27.83/28.02  (step t1169 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1170 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t1169))
% 27.83/28.02  (step t1171 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1172 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1172.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1172.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1172.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1172.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1172.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1172.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1172.t5))
% 27.83/28.02  (step t1172.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1172.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1172.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1172.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1172.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1172.t3 t1172.t4 t1172.t6 t1172.t7 t1172.t8 t1172.t9 t1172.t10))
% 27.83/28.02  (step t1172 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1173 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1174 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t1172 t1173))
% 27.83/28.02  (step t1175 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1176 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1175))
% 27.83/28.02  (step t1177 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1176))
% 27.83/28.02  (step t1178 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1179 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1180 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1181 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1179 t1180))
% 27.83/28.02  (step t1182 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1178 t1181))
% 27.83/28.02  (step t1183 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1182))
% 27.83/28.02  (anchor :step t1184 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1184.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1184.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1184.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1184.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1184.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1184.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1184.t5 t1175))
% 27.83/28.02  (step t1184.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1184.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1184.t6 t1184.t7))
% 27.83/28.02  (step t1184.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1181 t1184.t8))
% 27.83/28.02  (step t1184.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1184.t9))
% 27.83/28.02  (step t1184.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1184.t12 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1184.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t1184.t3 t1184.t4 t1184.t10 t1184.t11 t1184.t12))
% 27.83/28.02  (step t1184 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.02  (step t1185 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t1177 t1183 t1184))
% 27.83/28.02  (step t1186 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t1174 t1185))
% 27.83/28.02  (step t1187 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t1171 t1186 a283))
% 27.83/28.02  (step t1188 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t1187))
% 27.83/28.02  (step t1189 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t995 t1038 t149 t163 t185 t196 t149 t207 t163 t218 t240 t196 t149 t207 t163 t218 t1041 a192 t1044 a192 t1047 a192 t1050 a192 t1053 a192 t1060 t1062 t1080 t1087 t1089 t1107 t1114 t1116 t1134 t1141 t1143 t1161 t1168 t1170 t1188))
% 27.83/28.02  (step t1190 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3))) :rule contraction :premises (t1189))
% 27.83/28.02  (step t1191 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6))) :rule resolution :premises (t1190 t982 t209 t216 t151 t158 t198 t205 t137 t144 t187 t194 a148))
% 27.83/28.02  (step t1192 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5))) :rule contraction :premises (t1191))
% 27.83/28.02  (step t1193 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t1192 t614 t621))
% 27.83/28.02  (step t1194 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t1193))
% 27.83/28.02  (step t1195 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1196 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.83/28.02  (step t1197 (cl (= (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.83/28.02  (step t1198 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1197 t418))
% 27.83/28.02  (step t1199 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1200 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1198 t1199))
% 27.83/28.02  (step t1201 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1196 t1200))
% 27.83/28.02  (step t1202 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1203)
% 27.83/28.02  (assume t1203.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))
% 27.83/28.02  (step t1203.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1203.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t1203.t1))
% 27.83/28.02  (step t1203.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1203.t2 t1203.a0))
% 27.83/28.02  (step t1203 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1203.a0))
% 27.83/28.02  (step t1204 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1202 t1203))
% 27.83/28.02  (step t1205 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1206 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1204 t1205))
% 27.83/28.02  (step t1207 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1206))
% 27.83/28.02  (step t1208 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1195 t1201 t1207))
% 27.83/28.02  (step t1209 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1208))
% 27.83/28.02  (step t1210 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1211 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t1210))
% 27.83/28.02  (step t1212 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1213 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1213.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1213.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1213.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1213.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1213.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1213.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1213.t5))
% 27.83/28.02  (step t1213.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1213.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.02  (step t1213.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1213.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1213.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1213.t3 t1213.t4 t1213.t6 t1213.t7 t1213.t8 t1213.t9 t1213.t10))
% 27.83/28.02  (step t1213 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1214 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1215 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t1213 t1214))
% 27.83/28.02  (step t1216 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1217 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1216))
% 27.83/28.02  (step t1218 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1217))
% 27.83/28.02  (step t1219 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1220 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1221 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1222 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1220 t1221))
% 27.83/28.02  (step t1223 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1219 t1222))
% 27.83/28.02  (step t1224 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1223))
% 27.83/28.02  (anchor :step t1225 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1225.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1225.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1225.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1225.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1225.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1225.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1225.t5 t1216))
% 27.83/28.02  (step t1225.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1225.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1225.t6 t1225.t7))
% 27.83/28.02  (step t1225.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1222 t1225.t8))
% 27.83/28.02  (step t1225.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1225.t9))
% 27.83/28.02  (step t1225.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1225.t12 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.02  (step t1225.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t1225.t3 t1225.t4 t1225.t10 t1225.t11 t1225.t12))
% 27.83/28.02  (step t1225 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.02  (step t1226 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t1218 t1224 t1225))
% 27.83/28.02  (step t1227 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t1215 t1226))
% 27.83/28.02  (step t1228 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t1212 t1227 a267))
% 27.83/28.02  (step t1229 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t1228))
% 27.83/28.02  (step t1230 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1231 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.02  (step t1232 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1197 t523))
% 27.83/28.02  (step t1233 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1234 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1232 t1233))
% 27.83/28.02  (step t1235 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1231 t1234))
% 27.83/28.02  (step t1236 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1237)
% 27.83/28.02  (assume t1237.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.02  (step t1237.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1237.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t1237.t1))
% 27.83/28.02  (step t1237.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1237.t2 t1237.a0))
% 27.83/28.02  (step t1237 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1237.a0))
% 27.83/28.02  (step t1238 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1236 t1237))
% 27.83/28.02  (step t1239 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1240 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1238 t1239))
% 27.83/28.02  (step t1241 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1240))
% 27.83/28.02  (step t1242 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1230 t1235 t1241))
% 27.83/28.02  (step t1243 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1242))
% 27.83/28.02  (step t1244 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1245 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t1244))
% 27.83/28.02  (step t1246 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1247 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1247.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1247.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1247.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1247.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1247.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1247.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1247.t5))
% 27.83/28.02  (step t1247.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1247.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.02  (step t1247.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1247.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1247.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1247.t3 t1247.t4 t1247.t6 t1247.t7 t1247.t8 t1247.t9 t1247.t10))
% 27.83/28.02  (step t1247 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1248 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1249 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t1247 t1248))
% 27.83/28.02  (step t1250 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1251 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1250))
% 27.83/28.02  (step t1252 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1251))
% 27.83/28.02  (step t1253 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1254 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1255 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1256 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1254 t1255))
% 27.83/28.02  (step t1257 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1253 t1256))
% 27.83/28.02  (step t1258 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1257))
% 27.83/28.02  (anchor :step t1259 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1259.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1259.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1259.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1259.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1259.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1259.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1259.t5 t1250))
% 27.83/28.02  (step t1259.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1259.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1259.t6 t1259.t7))
% 27.83/28.02  (step t1259.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1256 t1259.t8))
% 27.83/28.02  (step t1259.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1259.t9))
% 27.83/28.02  (step t1259.t11 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1259.t12 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.02  (step t1259.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t1259.t3 t1259.t4 t1259.t10 t1259.t11 t1259.t12))
% 27.83/28.02  (step t1259 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.02  (step t1260 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t1252 t1258 t1259))
% 27.83/28.02  (step t1261 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t1249 t1260))
% 27.83/28.02  (step t1262 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t1246 t1261 a281))
% 27.83/28.02  (step t1263 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t1262))
% 27.83/28.02  (step t1264 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t1194 t625 t627 t634 a84 t641 t1209 t1211 t1229 t1243 t1245 t1263))
% 27.83/28.02  (step t1265 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t1264))
% 27.83/28.02  (step t1266 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk6))) :rule resolution :premises (t1265 t161 t147 a192 a187 a191 t646 a194))
% 27.83/28.02  (step t1267 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1268 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1267))
% 27.83/28.02  (step t1269 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.83/28.02  (step t1270 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t1269))
% 27.83/28.02  (step t1271 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1272 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1271))
% 27.83/28.02  (step t1273 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1274 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1273))
% 27.83/28.02  (step t1275 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.83/28.02  (step t1276 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t1275))
% 27.83/28.02  (step t1277 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1278 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1277))
% 27.83/28.02  (step t1279 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1280 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1279))
% 27.83/28.02  (step t1281 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1282 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.02  (step t1283 (cl (= (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.83/28.02  (step t1284 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1283 t383))
% 27.83/28.02  (step t1285 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1286 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1284 t1285))
% 27.83/28.02  (step t1287 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1282 t1286))
% 27.83/28.02  (step t1288 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1289)
% 27.83/28.02  (assume t1289.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.02  (step t1289.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1289.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t1289.t1))
% 27.83/28.02  (step t1289.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1289.t2 t1289.a0))
% 27.83/28.02  (step t1289 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1289.a0))
% 27.83/28.02  (step t1290 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1288 t1289))
% 27.83/28.02  (step t1291 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1292 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1290 t1291))
% 27.83/28.02  (step t1293 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1292))
% 27.83/28.02  (step t1294 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1281 t1287 t1293))
% 27.83/28.02  (step t1295 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1294))
% 27.83/28.02  (step t1296 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1297 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t1296))
% 27.83/28.02  (step t1298 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1299 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1299.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1299.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1299.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1299.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1299.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1299.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1299.t5))
% 27.83/28.02  (step t1299.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1299.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1299.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1299.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1299.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1299.t3 t1299.t4 t1299.t6 t1299.t7 t1299.t8 t1299.t9 t1299.t10))
% 27.83/28.02  (step t1299 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1300 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1301 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1299 t1300))
% 27.83/28.02  (step t1302 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1303 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1302))
% 27.83/28.02  (step t1304 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1303))
% 27.83/28.02  (step t1305 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1306 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1307 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1308 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1306 t1307))
% 27.83/28.02  (step t1309 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1305 t1308))
% 27.83/28.02  (step t1310 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1309))
% 27.83/28.02  (anchor :step t1311 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1311.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1311.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1311.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1311.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1311.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1311.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1311.t5 t1302))
% 27.83/28.02  (step t1311.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1311.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1311.t6 t1311.t7))
% 27.83/28.02  (step t1311.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1308 t1311.t8))
% 27.83/28.02  (step t1311.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1311.t9))
% 27.83/28.02  (step t1311.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1311.t12 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1311.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t1311.t3 t1311.t4 t1311.t10 t1311.t11 t1311.t12))
% 27.83/28.02  (step t1311 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.02  (step t1312 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t1304 t1310 t1311))
% 27.83/28.02  (step t1313 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1301 t1312))
% 27.83/28.02  (step t1314 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t1298 t1313 a257))
% 27.83/28.02  (step t1315 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t1314))
% 27.83/28.02  (step t1316 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1317 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.83/28.02  (step t1318 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1283 t418))
% 27.83/28.02  (step t1319 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1320 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1318 t1319))
% 27.83/28.02  (step t1321 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1317 t1320))
% 27.83/28.02  (step t1322 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1323)
% 27.83/28.02  (assume t1323.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))
% 27.83/28.02  (step t1323.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1323.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t1323.t1))
% 27.83/28.02  (step t1323.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1323.t2 t1323.a0))
% 27.83/28.02  (step t1323 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1323.a0))
% 27.83/28.02  (step t1324 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1322 t1323))
% 27.83/28.02  (step t1325 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1326 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1324 t1325))
% 27.83/28.02  (step t1327 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1326))
% 27.83/28.02  (step t1328 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1316 t1321 t1327))
% 27.83/28.02  (step t1329 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1328))
% 27.83/28.02  (step t1330 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1331 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t1330))
% 27.83/28.02  (step t1332 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1333 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1333.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1333.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1333.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1333.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1333.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1333.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1333.t5))
% 27.83/28.02  (step t1333.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1333.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.02  (step t1333.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1333.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1333.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1333.t3 t1333.t4 t1333.t6 t1333.t7 t1333.t8 t1333.t9 t1333.t10))
% 27.83/28.02  (step t1333 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1334 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1335 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t1333 t1334))
% 27.83/28.02  (step t1336 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1337 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1336))
% 27.83/28.02  (step t1338 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1337))
% 27.83/28.02  (step t1339 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1340 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1341 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1342 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1340 t1341))
% 27.83/28.02  (step t1343 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1339 t1342))
% 27.83/28.02  (step t1344 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1343))
% 27.83/28.02  (anchor :step t1345 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1345.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1345.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1345.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1345.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1345.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1345.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1345.t5 t1336))
% 27.83/28.02  (step t1345.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1345.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1345.t6 t1345.t7))
% 27.83/28.02  (step t1345.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1342 t1345.t8))
% 27.83/28.02  (step t1345.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1345.t9))
% 27.83/28.02  (step t1345.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1345.t12 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.02  (step t1345.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t1345.t3 t1345.t4 t1345.t10 t1345.t11 t1345.t12))
% 27.83/28.02  (step t1345 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.02  (step t1346 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t1338 t1344 t1345))
% 27.83/28.02  (step t1347 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t1335 t1346))
% 27.83/28.02  (step t1348 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t1332 t1347 a268))
% 27.83/28.02  (step t1349 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t1348))
% 27.83/28.02  (step t1350 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.02  (step t1351 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.02  (step t1352 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t1283 t453))
% 27.83/28.02  (step t1353 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.02  (step t1354 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t1352 t1353))
% 27.83/28.02  (step t1355 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t1351 t1354))
% 27.83/28.02  (step t1356 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1357)
% 27.83/28.02  (assume t1357.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.02  (step t1357.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1357.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t1357.t1))
% 27.83/28.02  (step t1357.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1357.t2 t1357.a0))
% 27.83/28.02  (step t1357 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t1357.a0))
% 27.83/28.02  (step t1358 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1356 t1357))
% 27.83/28.02  (step t1359 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.02  (step t1360 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t1358 t1359))
% 27.83/28.02  (step t1361 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t1360))
% 27.83/28.02  (step t1362 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t1350 t1355 t1361))
% 27.83/28.02  (step t1363 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t1362))
% 27.83/28.02  (step t1364 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.02  (step t1365 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t1364))
% 27.83/28.02  (step t1366 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1367 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1367.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1367.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1367.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1367.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1367.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1367.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1367.t5))
% 27.83/28.02  (step t1367.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1367.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1367.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1367.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1367.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1367.t3 t1367.t4 t1367.t6 t1367.t7 t1367.t8 t1367.t9 t1367.t10))
% 27.83/28.02  (step t1367 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1368 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.02  (step t1369 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1367 t1368))
% 27.83/28.02  (step t1370 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1371 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1370))
% 27.83/28.02  (step t1372 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1371))
% 27.83/28.02  (step t1373 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1374 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1375 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1376 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1374 t1375))
% 27.83/28.02  (step t1377 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1373 t1376))
% 27.83/28.02  (step t1378 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1377))
% 27.83/28.02  (anchor :step t1379 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1379.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1379.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1379.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1379.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1379.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1379.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1379.t5 t1370))
% 27.83/28.02  (step t1379.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1379.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1379.t6 t1379.t7))
% 27.83/28.02  (step t1379.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1376 t1379.t8))
% 27.83/28.02  (step t1379.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1379.t9))
% 27.83/28.02  (step t1379.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1379.t12 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.02  (step t1379.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t1379.t3 t1379.t4 t1379.t10 t1379.t11 t1379.t12))
% 27.83/28.02  (step t1379 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.02  (step t1380 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t1372 t1378 t1379))
% 27.83/28.02  (step t1381 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1369 t1380))
% 27.83/28.02  (step t1382 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t1366 t1381 a277))
% 27.83/28.02  (step t1383 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t1382))
% 27.83/28.02  (step t1384 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1385 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.02  (step t1386 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1283 t488))
% 27.83/28.02  (step t1387 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1388 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1386 t1387))
% 27.83/28.02  (step t1389 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1385 t1388))
% 27.83/28.02  (step t1390 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1391)
% 27.83/28.02  (assume t1391.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.02  (step t1391.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1391.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t1391.t1))
% 27.83/28.02  (step t1391.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1391.t2 t1391.a0))
% 27.83/28.02  (step t1391 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1391.a0))
% 27.83/28.02  (step t1392 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1390 t1391))
% 27.83/28.02  (step t1393 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1394 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1392 t1393))
% 27.83/28.02  (step t1395 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1394))
% 27.83/28.02  (step t1396 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1384 t1389 t1395))
% 27.83/28.02  (step t1397 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1396))
% 27.83/28.02  (step t1398 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1399 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t1398))
% 27.83/28.02  (step t1400 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1401 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1401.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1401.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1401.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1401.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1401.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1401.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1401.t5))
% 27.83/28.02  (step t1401.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1401.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1401.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1401.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1401.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1401.t3 t1401.t4 t1401.t6 t1401.t7 t1401.t8 t1401.t9 t1401.t10))
% 27.83/28.02  (step t1401 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1402 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1403 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1401 t1402))
% 27.83/28.02  (step t1404 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1405 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1404))
% 27.83/28.02  (step t1406 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1405))
% 27.83/28.02  (step t1407 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1408 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1409 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1410 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1408 t1409))
% 27.83/28.02  (step t1411 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1407 t1410))
% 27.83/28.02  (step t1412 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1411))
% 27.83/28.02  (anchor :step t1413 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1413.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1413.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1413.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1413.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1413.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1413.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1413.t5 t1404))
% 27.83/28.02  (step t1413.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1413.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1413.t6 t1413.t7))
% 27.83/28.02  (step t1413.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1410 t1413.t8))
% 27.83/28.02  (step t1413.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1413.t9))
% 27.83/28.02  (step t1413.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1413.t12 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1413.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t1413.t3 t1413.t4 t1413.t10 t1413.t11 t1413.t12))
% 27.83/28.02  (step t1413 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.02  (step t1414 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t1406 t1412 t1413))
% 27.83/28.02  (step t1415 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1403 t1414))
% 27.83/28.02  (step t1416 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t1400 t1415 a284))
% 27.83/28.02  (step t1417 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t1416))
% 27.83/28.02  (step t1418 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1419 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.02  (step t1420 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1283 t523))
% 27.83/28.02  (step t1421 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1422 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1420 t1421))
% 27.83/28.02  (step t1423 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1419 t1422))
% 27.83/28.02  (step t1424 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1425)
% 27.83/28.02  (assume t1425.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.02  (step t1425.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1425.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t1425.t1))
% 27.83/28.02  (step t1425.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1425.t2 t1425.a0))
% 27.83/28.02  (step t1425 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1425.a0))
% 27.83/28.02  (step t1426 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1424 t1425))
% 27.83/28.02  (step t1427 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1428 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1426 t1427))
% 27.83/28.02  (step t1429 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1428))
% 27.83/28.02  (step t1430 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1418 t1423 t1429))
% 27.83/28.02  (step t1431 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1430))
% 27.83/28.02  (step t1432 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1433 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t1432))
% 27.83/28.02  (step t1434 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1435 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1435.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1435.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1435.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1435.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1435.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1435.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1435.t5))
% 27.83/28.02  (step t1435.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1435.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.02  (step t1435.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1435.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1435.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1435.t3 t1435.t4 t1435.t6 t1435.t7 t1435.t8 t1435.t9 t1435.t10))
% 27.83/28.02  (step t1435 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1436 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1437 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t1435 t1436))
% 27.83/28.02  (step t1438 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1439 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1438))
% 27.83/28.02  (step t1440 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1439))
% 27.83/28.02  (step t1441 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1442 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1443 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1444 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1442 t1443))
% 27.83/28.02  (step t1445 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1441 t1444))
% 27.83/28.02  (step t1446 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1445))
% 27.83/28.02  (anchor :step t1447 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1447.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1447.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1447.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1447.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1447.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1447.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1447.t5 t1438))
% 27.83/28.02  (step t1447.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1447.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1447.t6 t1447.t7))
% 27.83/28.02  (step t1447.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1444 t1447.t8))
% 27.83/28.02  (step t1447.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1447.t9))
% 27.83/28.02  (step t1447.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1447.t12 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.02  (step t1447.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t1447.t3 t1447.t4 t1447.t10 t1447.t11 t1447.t12))
% 27.83/28.02  (step t1447 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.02  (step t1448 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t1440 t1446 t1447))
% 27.83/28.02  (step t1449 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t1437 t1448))
% 27.83/28.02  (step t1450 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t1434 t1449 a287))
% 27.83/28.02  (step t1451 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t1450))
% 27.83/28.02  (step t1452 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.02  (step t1453 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.02  (step t1454 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t1283 t558))
% 27.83/28.02  (step t1455 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.02  (step t1456 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t1454 t1455))
% 27.83/28.02  (step t1457 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t1453 t1456))
% 27.83/28.02  (step t1458 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1459)
% 27.83/28.02  (assume t1459.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.02  (step t1459.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1459.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t1459.t1))
% 27.83/28.02  (step t1459.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t1459.t2 t1459.a0))
% 27.83/28.02  (step t1459 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t1459.a0))
% 27.83/28.02  (step t1460 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t1458 t1459))
% 27.83/28.02  (step t1461 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.02  (step t1462 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t1460 t1461))
% 27.83/28.02  (step t1463 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t1462))
% 27.83/28.02  (step t1464 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t1452 t1457 t1463))
% 27.83/28.02  (step t1465 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t1464))
% 27.83/28.02  (step t1466 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.02  (step t1467 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t1466))
% 27.83/28.02  (step t1468 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1469 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1469.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1469.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1469.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1469.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1469.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1469.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1469.t5))
% 27.83/28.02  (step t1469.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1469.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.02  (step t1469.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1469.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1469.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1469.t3 t1469.t4 t1469.t6 t1469.t7 t1469.t8 t1469.t9 t1469.t10))
% 27.83/28.02  (step t1469 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1470 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.02  (step t1471 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1469 t1470))
% 27.83/28.02  (step t1472 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1473 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1472))
% 27.83/28.02  (step t1474 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1473))
% 27.83/28.02  (step t1475 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1476 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1477 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1478 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1476 t1477))
% 27.83/28.02  (step t1479 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1475 t1478))
% 27.83/28.02  (step t1480 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1479))
% 27.83/28.02  (anchor :step t1481 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1481.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1481.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1481.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1481.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1481.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1481.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1481.t5 t1472))
% 27.83/28.02  (step t1481.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1481.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1481.t6 t1481.t7))
% 27.83/28.02  (step t1481.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1478 t1481.t8))
% 27.83/28.02  (step t1481.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1481.t9))
% 27.83/28.02  (step t1481.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1481.t12 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.02  (step t1481.t13 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t1472 t1481.t12))
% 27.83/28.02  (step t1481.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t1481.t3 t1481.t4 t1481.t10 t1481.t11 t1481.t13))
% 27.83/28.02  (step t1481 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.02  (step t1482 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t1474 t1480 t1481))
% 27.83/28.02  (step t1483 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1471 t1482))
% 27.83/28.02  (step t1484 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t1468 t1483 a288))
% 27.83/28.02  (step t1485 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t1484))
% 27.83/28.02  (step t1486 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1487 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.02  (step t1488 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1283 t29))
% 27.83/28.02  (step t1489 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1490 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1488 t1489))
% 27.83/28.02  (step t1491 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1487 t1490))
% 27.83/28.02  (step t1492 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1493)
% 27.83/28.02  (assume t1493.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.02  (step t1493.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1493.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t1493.t1))
% 27.83/28.02  (step t1493.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1493.t2 t1493.a0))
% 27.83/28.02  (step t1493 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1493.a0))
% 27.83/28.02  (step t1494 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1492 t1493))
% 27.83/28.02  (step t1495 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1496 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1494 t1495))
% 27.83/28.02  (step t1497 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1496))
% 27.83/28.02  (step t1498 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1486 t1491 t1497))
% 27.83/28.02  (step t1499 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1498))
% 27.83/28.02  (step t1500 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1501 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t1500))
% 27.83/28.02  (step t1502 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1503 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1503.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1503.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1503.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1503.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1503.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1503.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1503.t5))
% 27.83/28.02  (step t1503.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1503.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1503.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1503.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1503.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1503.t3 t1503.t4 t1503.t6 t1503.t7 t1503.t8 t1503.t9 t1503.t10))
% 27.83/28.02  (step t1503 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1504 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1505 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t1503 t1504))
% 27.83/28.02  (step t1506 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1507 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1506))
% 27.83/28.02  (step t1508 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1507))
% 27.83/28.02  (step t1509 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1510 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1511 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1512 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1510 t1511))
% 27.83/28.02  (step t1513 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1509 t1512))
% 27.83/28.02  (step t1514 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1513))
% 27.83/28.02  (anchor :step t1515 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1515.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1515.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1515.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1515.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1515.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1515.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1515.t5 t1506))
% 27.83/28.02  (step t1515.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1515.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1515.t6 t1515.t7))
% 27.83/28.02  (step t1515.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1512 t1515.t8))
% 27.83/28.02  (step t1515.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1515.t9))
% 27.83/28.02  (step t1515.t11 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1515.t12 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1515.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t1515.t3 t1515.t4 t1515.t10 t1515.t11 t1515.t12))
% 27.83/28.02  (step t1515 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.02  (step t1516 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t1508 t1514 t1515))
% 27.83/28.02  (step t1517 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t1505 t1516))
% 27.83/28.02  (step t1518 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t1502 t1517 a289))
% 27.83/28.02  (step t1519 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t1518))
% 27.83/28.02  (step t1520 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t70 t81 t286 t149 t163 t308 t196 t149 t207 t163 t218 t327 t149 t163 t349 t196 t149 t207 t163 t218 t368 t149 t163 t1268 a192 a191 t1270 a192 a191 t1272 a192 a191 t1274 a192 a191 t1276 a192 a191 t1278 a192 a191 t1280 a192 a191 t1295 t1297 t1315 t1329 t1331 t1349 t1363 t1365 t1383 t1397 t1399 t1417 t1431 t1433 t1451 t1465 t1467 t1485 t1499 t1501 t1519))
% 27.83/28.02  (step t1521 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3))) :rule contraction :premises (t1520))
% 27.83/28.02  (step t1522 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t1521 t614 t621))
% 27.83/28.02  (step t1523 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t1522))
% 27.83/28.02  (step t1524 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t1523 t625 a192 t627 t634 a84 t641))
% 27.83/28.02  (step t1525 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t1524))
% 27.83/28.02  (step t1526 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) :rule resolution :premises (t1525 a194 a187 a191 t646))
% 27.83/28.02  (step t1527 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1528 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1527))
% 27.83/28.02  (step t1529 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1530 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1529))
% 27.83/28.02  (step t1531 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.02  (step t1532 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1531))
% 27.83/28.02  (step t1533 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1532))
% 27.83/28.02  (step t1534 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule or_pos)
% 27.83/28.02  (step t1535 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t1534))
% 27.83/28.02  (step t1536 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule reordering :premises (t1535))
% 27.83/28.02  (step t1537 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.02  (step t1538 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1537))
% 27.83/28.02  (step t1539 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1538))
% 27.83/28.02  (step t1540 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule or_pos)
% 27.83/28.02  (step t1541 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t1540))
% 27.83/28.02  (step t1542 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule reordering :premises (t1541))
% 27.83/28.02  (step t1543 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.02  (step t1544 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1543))
% 27.83/28.02  (step t1545 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1544))
% 27.83/28.02  (step t1546 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t70 t81 t185 t196 t149 t207 t163 t218 t240 t196 t149 t207 t163 t218 t1528 a192 a191 t1530 a192 a191 t1533 a192 t1536 a192 t1539 a192 t1542 a192 t1545 a192))
% 27.83/28.02  (step t1547 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1546))
% 27.83/28.02  (step t1548 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.02  (step t1549 (cl (= (= (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) true) (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv_simplify)
% 27.83/28.02  (step t1550 (cl (not (= (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) true)) (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule equiv1 :premises (t1549))
% 27.83/28.02  (step t1551 (cl (= (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))))) :rule all_simplify)
% 27.83/28.02  (step t1552 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule refl)
% 27.83/28.02  (step t1553 (cl (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1554 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1552 t1553))
% 27.83/28.02  (step t1555 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) true)) :rule all_simplify)
% 27.83/28.02  (step t1556 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) true)) :rule trans :premises (t1554 t1555))
% 27.83/28.02  (step t1557 (cl (= (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) true)) :rule trans :premises (t1551 t1556))
% 27.83/28.02  (step t1558 (cl (= (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1550 t1557))
% 27.83/28.02  (step t1559 (cl (= (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule refl)
% 27.83/28.02  (step t1560 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t89 t90 t91 t92 t93 t1558 t1559))
% 27.83/28.02  (step t1561 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule and_neg)
% 27.83/28.02  (step t1562 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1563)
% 27.83/28.02  (assume t1563.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.02  (assume t1563.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.02  (assume t1563.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.02  (assume t1563.a3 (= tptp.nil tptp.sk5))
% 27.83/28.02  (assume t1563.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.02  (assume t1563.a5 (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))
% 27.83/28.02  (step t1563.t1 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1563.t2)
% 27.83/28.02  (assume t1563.t2.a0 (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))
% 27.83/28.02  (assume t1563.t2.a1 (= tptp.nil tptp.sk5))
% 27.83/28.02  (assume t1563.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.02  (assume t1563.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.02  (assume t1563.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.02  (assume t1563.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.02  (step t1563.t2.t1 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv_simplify)
% 27.83/28.02  (step t1563.t2.t2 (cl (not (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule equiv1 :premises (t1563.t2.t1))
% 27.83/28.02  (step t1563.t2.t3 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.83/28.02  (step t1563.t2.t4 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.02  (step t1563.t2.t5 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t1563.t2.a3))
% 27.83/28.02  (step t1563.t2.t6 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t1563.t2.t4 t1563.t2.t5))
% 27.83/28.02  (step t1563.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t1563.t2.t6))
% 27.83/28.02  (step t1563.t2.t8 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t1563.t2.a4))
% 27.83/28.02  (step t1563.t2.t9 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t1563.t2.t8))
% 27.83/28.02  (step t1563.t2.t10 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t1563.t2.t9 t1563.t2.a3))
% 27.83/28.02  (step t1563.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t1563.t2.t10))
% 27.83/28.02  (step t1563.t2.t12 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t1563.t2.a5))
% 27.83/28.02  (step t1563.t2.t13 (cl (= tptp.nil tptp.sk6)) :rule trans :premises (t1563.t2.a2 t1563.t2.t7 t1563.t2.t11 t1563.t2.t12))
% 27.83/28.02  (step t1563.t2.t14 (cl (= (tptp.sk9 tptp.nil tptp.nil) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule cong :premises (t1563.t2.t13 t1563.t2.t13))
% 27.83/28.02  (step t1563.t2.t15 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1563.t2.t16 (cl (= (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil))) :rule cong :premises (t1563.t2.t14 t1563.t2.t15))
% 27.83/28.02  (step t1563.t2.t17 (cl (= (tptp.sk10 tptp.nil tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) :rule cong :premises (t1563.t2.t13 t1563.t2.t13))
% 27.83/28.02  (step t1563.t2.t18 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.sk10 tptp.nil tptp.nil)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))) :rule cong :premises (t1563.t2.t16 t1563.t2.t17))
% 27.83/28.02  (step t1563.t2.t19 (cl (= (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil))) :rule refl)
% 27.83/28.02  (step t1563.t2.t20 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.83/28.02  (step t1563.t2.t21 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t1563.t2.t12))
% 27.83/28.02  (step t1563.t2.t22 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t1563.t2.a2))
% 27.83/28.02  (step t1563.t2.t23 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t1563.t2.a1))
% 27.83/28.02  (step t1563.t2.t24 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t1563.t2.t23))
% 27.83/28.02  (step t1563.t2.t25 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t1563.t2.t21 t1563.t2.t10 t1563.t2.t6 t1563.t2.t22 t1563.t2.t24))
% 27.83/28.02  (step t1563.t2.t26 (cl (= (tptp.sk10 tptp.sk6 tptp.sk6) (tptp.sk10 tptp.sk6 tptp.sk5))) :rule cong :premises (t1563.t2.t20 t1563.t2.t25))
% 27.83/28.02  (step t1563.t2.t27 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule cong :premises (t1563.t2.t19 t1563.t2.t26))
% 27.83/28.02  (step t1563.t2.t28 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.sk10 tptp.nil tptp.nil)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule trans :premises (t1563.t2.t18 t1563.t2.t27))
% 27.83/28.02  (step t1563.t2.t29 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.app (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.sk10 tptp.nil tptp.nil)))) :rule symm :premises (t1563.t2.t28))
% 27.83/28.02  (step t1563.t2.t30 (cl (= tptp.sk5 tptp.sk6)) :rule symm :premises (t1563.t2.t25))
% 27.83/28.02  (step t1563.t2.t31 (cl (= (tptp.sk9 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule cong :premises (t1563.t2.t20 t1563.t2.t30))
% 27.83/28.02  (step t1563.t2.t32 (cl (= (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil))) :rule cong :premises (t1563.t2.t31 t1563.t2.t15))
% 27.83/28.02  (step t1563.t2.t33 (cl (= (tptp.sk10 tptp.sk6 tptp.sk5) (tptp.sk10 tptp.sk6 tptp.sk6))) :rule symm :premises (t1563.t2.t26))
% 27.83/28.02  (step t1563.t2.t34 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))) :rule cong :premises (t1563.t2.t32 t1563.t2.t33))
% 27.83/28.02  (step t1563.t2.t35 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)) (tptp.app (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.sk10 tptp.nil tptp.nil)))) :rule symm :premises (t1563.t2.t18))
% 27.83/28.02  (step t1563.t2.t36 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.app (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.sk10 tptp.nil tptp.nil)))) :rule trans :premises (t1563.t2.t34 t1563.t2.t35))
% 27.83/28.02  (step t1563.t2.t37 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.nil tptp.nil) tptp.nil) (tptp.sk10 tptp.nil tptp.nil)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule symm :premises (t1563.t2.t36))
% 27.83/28.02  (step t1563.t2.t38 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule trans :premises (t1563.t2.t29 t1563.t2.t37))
% 27.83/28.02  (step t1563.t2.t39 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule symm :premises (t1563.t2.t38))
% 27.83/28.02  (step t1563.t2.t40 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule cong :premises (t1563.t2.t3 t1563.t2.t39))
% 27.83/28.02  (step t1563.t2.t41 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv_simplify)
% 27.83/28.02  (step t1563.t2.t42 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv2 :premises (t1563.t2.t41))
% 27.83/28.02  (step t1563.t2.t43 (cl (not (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule not_not)
% 27.83/28.02  (step t1563.t2.t44 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1563.t2.t42 t1563.t2.t43))
% 27.83/28.02  (step t1563.t2.t45 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false)) :rule resolution :premises (t1563.t2.t44 t1563.t2.a0))
% 27.83/28.02  (step t1563.t2.t46 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false)) :rule trans :premises (t1563.t2.t40 t1563.t2.t45))
% 27.83/28.02  (step t1563.t2.t47 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1563.t2.t2 t1563.t2.t46))
% 27.83/28.02  (step t1563.t2 (cl (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t1563.t2.a0 t1563.t2.a1 t1563.t2.a2 t1563.t2.a3 t1563.t2.a4 t1563.t2.a5))
% 27.83/28.02  (step t1563.t3 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule and_pos)
% 27.83/28.02  (step t1563.t4 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.02  (step t1563.t5 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1563.t6 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.02  (step t1563.t7 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.02  (step t1563.t8 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1563.t9 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t1563.t2 t1563.t3 t1563.t4 t1563.t5 t1563.t6 t1563.t7 t1563.t8))
% 27.83/28.02  (step t1563.t10 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1563.t9))
% 27.83/28.02  (step t1563.t11 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1563.t10))
% 27.83/28.02  (step t1563.t12 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1563.t1 t1563.t11))
% 27.83/28.02  (step t1563.t13 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.02  (step t1563.t14 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t1563.t12 t1563.t13))
% 27.83/28.02  (step t1563.t15 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t1563.t14))
% 27.83/28.02  (step t1563.t16 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule implies :premises (t1563.t15))
% 27.83/28.02  (step t1563.t17 (cl (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.83/28.02  (step t1563.t18 (cl (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t1563.t17 t1563.a5 t1563.a3 t1563.a0 t1563.a1 t1563.a4 t1563.a2))
% 27.83/28.02  (step t1563.t19 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1563.t16 t1563.t18))
% 27.83/28.02  (step t1563 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t1563.a0 t1563.a1 t1563.a2 t1563.a3 t1563.a4 t1563.a5))
% 27.83/28.02  (step t1564 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1565 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.02  (step t1566 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1567 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.02  (step t1568 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.02  (step t1569 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule and_pos)
% 27.83/28.02  (step t1570 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))))) :rule resolution :premises (t1563 t1564 t1565 t1566 t1567 t1568 t1569))
% 27.83/28.02  (step t1571 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1570))
% 27.83/28.02  (step t1572 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1571))
% 27.83/28.02  (step t1573 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1562 t1572))
% 27.83/28.02  (step t1574 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.02  (step t1575 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t1573 t1574))
% 27.83/28.02  (step t1576 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t1575))
% 27.83/28.02  (step t1577 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule implies :premises (t1576))
% 27.83/28.02  (step t1578 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1561 t1577))
% 27.83/28.02  (step t1579 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.83/28.02  (step t1580 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.83/28.02  (step t1581 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.83/28.02  (step t1582 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.83/28.02  (step t1583 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.83/28.02  (step t1584 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))))) :rule or_neg)
% 27.83/28.02  (step t1585 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule or_neg)
% 27.83/28.02  (step t1586 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t1578 t1579 t1580 t1581 t1582 t1583 t1584 t1585))
% 27.83/28.02  (step t1587 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t1586))
% 27.83/28.02  (step t1588 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t1548 t1560 t1587))
% 27.83/28.02  (step t1589 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule or :premises (t1588))
% 27.83/28.02  (step t1590 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1589))
% 27.83/28.02  (step t1591 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule equiv_pos2)
% 27.83/28.02  (step t1592 (cl (= (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule refl)
% 27.83/28.02  (step t1593 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))))) :rule cong :premises (t89 t90 t91 t92 t93 t1558 t1592))
% 27.83/28.02  (step t1594 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1595)
% 27.83/28.02  (assume t1595.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.02  (assume t1595.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.02  (assume t1595.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.02  (assume t1595.a3 (= tptp.nil tptp.sk5))
% 27.83/28.02  (assume t1595.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.02  (assume t1595.a5 (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))
% 27.83/28.02  (step t1595.t1 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1595.t2)
% 27.83/28.02  (assume t1595.t2.a0 (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))
% 27.83/28.02  (assume t1595.t2.a1 (= tptp.nil tptp.sk5))
% 27.83/28.02  (assume t1595.t2.a2 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.02  (assume t1595.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.02  (assume t1595.t2.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.02  (assume t1595.t2.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.02  (step t1595.t2.t1 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) false) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule equiv_simplify)
% 27.83/28.02  (step t1595.t2.t2 (cl (not (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) false)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule equiv1 :premises (t1595.t2.t1))
% 27.83/28.02  (step t1595.t2.t3 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 27.83/28.02  (step t1595.t2.t4 (cl (= (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil))) :rule refl)
% 27.83/28.02  (step t1595.t2.t5 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.83/28.02  (step t1595.t2.t6 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t1595.t2.a5))
% 27.83/28.02  (step t1595.t2.t7 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t1595.t2.t6))
% 27.83/28.02  (step t1595.t2.t8 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t1595.t2.a4))
% 27.83/28.02  (step t1595.t2.t9 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t1595.t2.t8))
% 27.83/28.02  (step t1595.t2.t10 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t1595.t2.t9 t1595.t2.a3))
% 27.83/28.02  (step t1595.t2.t11 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.02  (step t1595.t2.t12 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t1595.t2.a3))
% 27.83/28.02  (step t1595.t2.t13 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule cong :premises (t1595.t2.t11 t1595.t2.t12))
% 27.83/28.02  (step t1595.t2.t14 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t1595.t2.a2))
% 27.83/28.02  (step t1595.t2.t15 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t1595.t2.a1))
% 27.83/28.02  (step t1595.t2.t16 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t1595.t2.t15))
% 27.83/28.02  (step t1595.t2.t17 (cl (= tptp.sk6 tptp.sk5)) :rule trans :premises (t1595.t2.t7 t1595.t2.t10 t1595.t2.t13 t1595.t2.t14 t1595.t2.t16))
% 27.83/28.02  (step t1595.t2.t18 (cl (= (tptp.sk10 tptp.sk6 tptp.sk6) (tptp.sk10 tptp.sk6 tptp.sk5))) :rule cong :premises (t1595.t2.t5 t1595.t2.t17))
% 27.83/28.02  (step t1595.t2.t19 (cl (= (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)) (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule cong :premises (t1595.t2.t4 t1595.t2.t18))
% 27.83/28.02  (step t1595.t2.t20 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule cong :premises (t1595.t2.t3 t1595.t2.t19))
% 27.83/28.02  (step t1595.t2.t21 (cl (= (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv_simplify)
% 27.83/28.02  (step t1595.t2.t22 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) :rule equiv2 :premises (t1595.t2.t21))
% 27.83/28.02  (step t1595.t2.t23 (cl (not (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule not_not)
% 27.83/28.02  (step t1595.t2.t24 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1595.t2.t22 t1595.t2.t23))
% 27.83/28.02  (step t1595.t2.t25 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) false)) :rule resolution :premises (t1595.t2.t24 t1595.t2.a0))
% 27.83/28.02  (step t1595.t2.t26 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) false)) :rule trans :premises (t1595.t2.t20 t1595.t2.t25))
% 27.83/28.02  (step t1595.t2.t27 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1595.t2.t2 t1595.t2.t26))
% 27.83/28.02  (step t1595.t2 (cl (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t1595.t2.a0 t1595.t2.a1 t1595.t2.a2 t1595.t2.a3 t1595.t2.a4 t1595.t2.a5))
% 27.83/28.02  (step t1595.t3 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule and_pos)
% 27.83/28.02  (step t1595.t4 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.02  (step t1595.t5 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1595.t6 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.02  (step t1595.t7 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.02  (step t1595.t8 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1595.t9 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t1595.t2 t1595.t3 t1595.t4 t1595.t5 t1595.t6 t1595.t7 t1595.t8))
% 27.83/28.02  (step t1595.t10 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1595.t9))
% 27.83/28.02  (step t1595.t11 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1595.t10))
% 27.83/28.02  (step t1595.t12 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1595.t1 t1595.t11))
% 27.83/28.02  (step t1595.t13 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.83/28.02  (step t1595.t14 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1595.t12 t1595.t13))
% 27.83/28.02  (step t1595.t15 (cl (=> (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t1595.t14))
% 27.83/28.02  (step t1595.t16 (cl (not (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule implies :premises (t1595.t15))
% 27.83/28.02  (step t1595.t17 (cl (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule and_neg)
% 27.83/28.02  (step t1595.t18 (cl (and (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t1595.t17 t1595.a5 t1595.a3 t1595.a0 t1595.a1 t1595.a4 t1595.a2))
% 27.83/28.02  (step t1595.t19 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1595.t16 t1595.t18))
% 27.83/28.02  (step t1595 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t1595.a0 t1595.a1 t1595.a2 t1595.a3 t1595.a4 t1595.a5))
% 27.83/28.02  (step t1596 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1597 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.02  (step t1598 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1599 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.02  (step t1600 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.02  (step t1601 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule and_pos)
% 27.83/28.02  (step t1602 (cl (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))))) :rule resolution :premises (t1595 t1596 t1597 t1598 t1599 t1600 t1601))
% 27.83/28.02  (step t1603 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1602))
% 27.83/28.02  (step t1604 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1603))
% 27.83/28.02  (step t1605 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1594 t1604))
% 27.83/28.02  (step t1606 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.83/28.02  (step t1607 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1605 t1606))
% 27.83/28.02  (step t1608 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t1607))
% 27.83/28.02  (step t1609 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule implies :premises (t1608))
% 27.83/28.02  (step t1610 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1561 t1609))
% 27.83/28.02  (step t1611 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.83/28.02  (step t1612 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.83/28.02  (step t1613 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.83/28.02  (step t1614 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.83/28.02  (step t1615 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.83/28.02  (step t1616 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))))) :rule or_neg)
% 27.83/28.02  (step t1617 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule or_neg)
% 27.83/28.02  (step t1618 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1610 t1611 t1612 t1613 t1614 t1615 t1616 t1617))
% 27.83/28.02  (step t1619 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t1618))
% 27.83/28.02  (step t1620 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1591 t1593 t1619))
% 27.83/28.02  (step t1621 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))))) :rule or :premises (t1620))
% 27.83/28.02  (step t1622 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1621))
% 27.83/28.02  (step t1623 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1624)
% 27.83/28.02  (assume t1624.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.02  (step t1624.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1624.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t1624.t1))
% 27.83/28.02  (step t1624.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1624.t2 t1624.a0))
% 27.83/28.02  (step t1624 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1624.a0))
% 27.83/28.02  (step t1625 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1623 t1624))
% 27.83/28.02  (step t1626 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1627 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1625 t1626))
% 27.83/28.02  (step t1628 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1627))
% 27.83/28.02  (step t1629 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1628))
% 27.83/28.02  (step t1630 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1631 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t1630))
% 27.83/28.02  (step t1632 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1633 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1633.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1633.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1633.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1633.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1633.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1633.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1633.t5))
% 27.83/28.02  (step t1633.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1633.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1633.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1633.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1633.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1633.t3 t1633.t4 t1633.t6 t1633.t7 t1633.t8 t1633.t9 t1633.t10))
% 27.83/28.02  (step t1633 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1634 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1635 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1633 t1634))
% 27.83/28.02  (step t1636 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1637 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1636))
% 27.83/28.02  (step t1638 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1637))
% 27.83/28.02  (step t1639 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1640 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1641 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1642 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1640 t1641))
% 27.83/28.02  (step t1643 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1639 t1642))
% 27.83/28.02  (step t1644 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1643))
% 27.83/28.02  (anchor :step t1645 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1645.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1645.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1645.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1645.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1645.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1645.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1645.t5 t1636))
% 27.83/28.02  (step t1645.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1645.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1645.t6 t1645.t7))
% 27.83/28.02  (step t1645.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1642 t1645.t8))
% 27.83/28.02  (step t1645.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1645.t9))
% 27.83/28.02  (step t1645.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1645.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1636 t1645.t11))
% 27.83/28.02  (step t1645.t13 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1645.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t1645.t3 t1645.t4 t1645.t10 t1645.t12 t1645.t13))
% 27.83/28.02  (step t1645 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.02  (step t1646 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t1638 t1644 t1645))
% 27.83/28.02  (step t1647 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1635 t1646))
% 27.83/28.02  (step t1648 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t1632 t1647 a258))
% 27.83/28.02  (step t1649 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t1648))
% 27.83/28.02  (step t1650 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1651)
% 27.83/28.02  (assume t1651.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.02  (step t1651.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1651.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule or :premises (t1651.t1))
% 27.83/28.02  (step t1651.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1651.t2 t1651.a0))
% 27.83/28.02  (step t1651 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t1651.a0))
% 27.83/28.02  (step t1652 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1650 t1651))
% 27.83/28.02  (step t1653 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.83/28.02  (step t1654 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1652 t1653))
% 27.83/28.02  (step t1655 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t1654))
% 27.83/28.02  (step t1656 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule implies :premises (t1655))
% 27.83/28.02  (step t1657 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.02  (step t1658 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t1657))
% 27.83/28.02  (step t1659 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1660 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1660.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1660.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1660.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1660.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1660.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1660.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1660.t5))
% 27.83/28.02  (step t1660.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1660.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1660.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1660.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1660.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1660.t3 t1660.t4 t1660.t6 t1660.t7 t1660.t8 t1660.t9 t1660.t10))
% 27.83/28.02  (step t1660 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1661 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.02  (step t1662 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1660 t1661))
% 27.83/28.02  (step t1663 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1664 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1663))
% 27.83/28.02  (step t1665 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1664))
% 27.83/28.02  (step t1666 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1667 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1668 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1669 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1667 t1668))
% 27.83/28.02  (step t1670 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1666 t1669))
% 27.83/28.02  (step t1671 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1670))
% 27.83/28.02  (anchor :step t1672 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1672.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1672.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1672.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1672.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1672.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1672.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1672.t5 t1663))
% 27.83/28.02  (step t1672.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1672.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1672.t6 t1672.t7))
% 27.83/28.02  (step t1672.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1669 t1672.t8))
% 27.83/28.02  (step t1672.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1672.t9))
% 27.83/28.02  (step t1672.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1672.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1663 t1672.t11))
% 27.83/28.02  (step t1672.t13 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.02  (step t1672.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t1672.t3 t1672.t4 t1672.t10 t1672.t12 t1672.t13))
% 27.83/28.02  (step t1672 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.02  (step t1673 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t1665 t1671 t1672))
% 27.83/28.02  (step t1674 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1662 t1673))
% 27.83/28.02  (step t1675 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t1659 t1674 a278))
% 27.83/28.02  (step t1676 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t1675))
% 27.83/28.02  (step t1677 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1678)
% 27.83/28.02  (assume t1678.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.02  (step t1678.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1678.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule or :premises (t1678.t1))
% 27.83/28.02  (step t1678.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1678.t2 t1678.a0))
% 27.83/28.02  (step t1678 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1678.a0))
% 27.83/28.02  (step t1679 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1677 t1678))
% 27.83/28.02  (step t1680 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1681 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1679 t1680))
% 27.83/28.02  (step t1682 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1681))
% 27.83/28.02  (step t1683 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1682))
% 27.83/28.02  (step t1684 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1685 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t1684))
% 27.83/28.02  (step t1686 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1687 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1687.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1687.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1687.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1687.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1687.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1687.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1687.t5))
% 27.83/28.02  (step t1687.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1687.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1687.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1687.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1687.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1687.t3 t1687.t4 t1687.t6 t1687.t7 t1687.t8 t1687.t9 t1687.t10))
% 27.83/28.02  (step t1687 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1688 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1689 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1687 t1688))
% 27.83/28.02  (step t1690 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1691 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1690))
% 27.83/28.02  (step t1692 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1691))
% 27.83/28.02  (step t1693 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1694 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1695 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1696 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1694 t1695))
% 27.83/28.02  (step t1697 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1693 t1696))
% 27.83/28.02  (step t1698 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1697))
% 27.83/28.02  (anchor :step t1699 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1699.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1699.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1699.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1699.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1699.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1699.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1699.t5 t1690))
% 27.83/28.02  (step t1699.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1699.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1699.t6 t1699.t7))
% 27.83/28.02  (step t1699.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1696 t1699.t8))
% 27.83/28.02  (step t1699.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1699.t9))
% 27.83/28.02  (step t1699.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1699.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1690 t1699.t11))
% 27.83/28.02  (step t1699.t13 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1699.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t1699.t3 t1699.t4 t1699.t10 t1699.t12 t1699.t13))
% 27.83/28.02  (step t1699 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.02  (step t1700 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t1692 t1698 t1699))
% 27.83/28.02  (step t1701 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1689 t1700))
% 27.83/28.02  (step t1702 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t1686 t1701 a285))
% 27.83/28.02  (step t1703 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t1702))
% 27.83/28.02  (step t1704 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1705)
% 27.83/28.02  (assume t1705.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.02  (step t1705.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1705.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule or :premises (t1705.t1))
% 27.83/28.02  (step t1705.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t1705.t2 t1705.a0))
% 27.83/28.02  (step t1705 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule subproof :discharge (t1705.a0))
% 27.83/28.02  (step t1706 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t1704 t1705))
% 27.83/28.02  (step t1707 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.02  (step t1708 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t1706 t1707))
% 27.83/28.02  (step t1709 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t1708))
% 27.83/28.02  (step t1710 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies :premises (t1709))
% 27.83/28.02  (step t1711 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.02  (step t1712 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t1711))
% 27.83/28.02  (step t1713 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1714 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1714.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1714.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1714.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1714.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1714.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1714.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1714.t5))
% 27.83/28.02  (step t1714.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1714.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.02  (step t1714.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1714.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1714.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1714.t3 t1714.t4 t1714.t6 t1714.t7 t1714.t8 t1714.t9 t1714.t10))
% 27.83/28.02  (step t1714 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1715 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.02  (step t1716 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1714 t1715))
% 27.83/28.02  (step t1717 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1718 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1717))
% 27.83/28.02  (step t1719 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1718))
% 27.83/28.02  (step t1720 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1721 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1722 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1723 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1721 t1722))
% 27.83/28.02  (step t1724 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1720 t1723))
% 27.83/28.02  (step t1725 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1724))
% 27.83/28.02  (anchor :step t1726 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1726.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1726.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1726.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1726.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1726.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1726.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1726.t5 t1717))
% 27.83/28.02  (step t1726.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1726.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1726.t6 t1726.t7))
% 27.83/28.02  (step t1726.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1723 t1726.t8))
% 27.83/28.02  (step t1726.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1726.t9))
% 27.83/28.02  (step t1726.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1726.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1717 t1726.t11))
% 27.83/28.02  (step t1726.t13 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.02  (step t1726.t14 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t1717 t1726.t13))
% 27.83/28.02  (step t1726.t15 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t1726.t3 t1726.t4 t1726.t10 t1726.t12 t1726.t14))
% 27.83/28.02  (step t1726 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.02  (step t1727 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t1719 t1725 t1726))
% 27.83/28.02  (step t1728 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1716 t1727))
% 27.83/28.02  (step t1729 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t1713 t1728 a292))
% 27.83/28.02  (step t1730 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t1729))
% 27.83/28.02  (step t1731 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1732)
% 27.83/28.02  (assume t1732.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.02  (step t1732.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1732.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t1732.t1))
% 27.83/28.02  (step t1732.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1732.t2 t1732.a0))
% 27.83/28.02  (step t1732 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1732.a0))
% 27.83/28.02  (step t1733 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1731 t1732))
% 27.83/28.02  (step t1734 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1735 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1733 t1734))
% 27.83/28.02  (step t1736 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1735))
% 27.83/28.02  (step t1737 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1736))
% 27.83/28.02  (step t1738 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1739 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t1738))
% 27.83/28.02  (step t1740 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1741 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1741.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1741.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1741.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1741.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1741.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1741.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1741.t5))
% 27.83/28.02  (step t1741.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1741.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1741.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1741.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1741.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1741.t3 t1741.t4 t1741.t6 t1741.t7 t1741.t8 t1741.t9 t1741.t10))
% 27.83/28.02  (step t1741 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1742 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1743 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t1741 t1742))
% 27.83/28.02  (step t1744 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1745 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1744))
% 27.83/28.02  (step t1746 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1745))
% 27.83/28.02  (step t1747 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1748 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1749 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1750 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1748 t1749))
% 27.83/28.02  (step t1751 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1747 t1750))
% 27.83/28.02  (step t1752 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1751))
% 27.83/28.02  (anchor :step t1753 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1753.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1753.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1753.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1753.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1753.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1753.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1753.t5 t1744))
% 27.83/28.02  (step t1753.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1753.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1753.t6 t1753.t7))
% 27.83/28.02  (step t1753.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1750 t1753.t8))
% 27.83/28.02  (step t1753.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1753.t9))
% 27.83/28.02  (step t1753.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1753.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1744 t1753.t11))
% 27.83/28.02  (step t1753.t13 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1753.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t1753.t3 t1753.t4 t1753.t10 t1753.t12 t1753.t13))
% 27.83/28.02  (step t1753 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.02  (step t1754 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t1746 t1752 t1753))
% 27.83/28.02  (step t1755 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t1743 t1754))
% 27.83/28.02  (step t1756 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t1740 t1755 a293))
% 27.83/28.02  (step t1757 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t1756))
% 27.83/28.02  (step t1758 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1759 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.83/28.02  (step t1760 (cl (= (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))))) :rule refl)
% 27.83/28.02  (step t1761 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1760 t418))
% 27.83/28.02  (step t1762 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1763 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1761 t1762))
% 27.83/28.02  (step t1764 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1759 t1763))
% 27.83/28.02  (step t1765 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1766)
% 27.83/28.02  (assume t1766.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))
% 27.83/28.02  (step t1766.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1766.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t1766.t1))
% 27.83/28.02  (step t1766.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1766.t2 t1766.a0))
% 27.83/28.02  (step t1766 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1766.a0))
% 27.83/28.02  (step t1767 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1765 t1766))
% 27.83/28.02  (step t1768 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1769 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1767 t1768))
% 27.83/28.02  (step t1770 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1769))
% 27.83/28.02  (step t1771 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1758 t1764 t1770))
% 27.83/28.02  (step t1772 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1771))
% 27.83/28.02  (step t1773 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1774 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t1773))
% 27.83/28.02  (step t1775 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1776 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1776.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1776.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1776.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1776.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1776.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1776.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1776.t5))
% 27.83/28.02  (step t1776.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1776.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.02  (step t1776.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1776.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1776.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1776.t3 t1776.t4 t1776.t6 t1776.t7 t1776.t8 t1776.t9 t1776.t10))
% 27.83/28.02  (step t1776 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1777 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1778 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t1776 t1777))
% 27.83/28.02  (step t1779 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1780 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1779))
% 27.83/28.02  (step t1781 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1780))
% 27.83/28.02  (step t1782 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1783 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1784 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1785 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1783 t1784))
% 27.83/28.02  (step t1786 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1782 t1785))
% 27.83/28.02  (step t1787 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1786))
% 27.83/28.02  (anchor :step t1788 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1788.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1788.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1788.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1788.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1788.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1788.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1788.t5 t1779))
% 27.83/28.02  (step t1788.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1788.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1788.t6 t1788.t7))
% 27.83/28.02  (step t1788.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1785 t1788.t8))
% 27.83/28.02  (step t1788.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1788.t9))
% 27.83/28.02  (step t1788.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1788.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1779 t1788.t11))
% 27.83/28.02  (step t1788.t13 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.02  (step t1788.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t1788.t3 t1788.t4 t1788.t10 t1788.t12 t1788.t13))
% 27.83/28.02  (step t1788 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.02  (step t1789 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t1781 t1787 t1788))
% 27.83/28.02  (step t1790 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t1778 t1789))
% 27.83/28.02  (step t1791 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t1775 t1790 a269))
% 27.83/28.02  (step t1792 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t1791))
% 27.83/28.02  (step t1793 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1794 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.02  (step t1795 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1760 t523))
% 27.83/28.02  (step t1796 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.02  (step t1797 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t1795 t1796))
% 27.83/28.02  (step t1798 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t1794 t1797))
% 27.83/28.02  (step t1799 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1800)
% 27.83/28.02  (assume t1800.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.02  (step t1800.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.02  (step t1800.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t1800.t1))
% 27.83/28.02  (step t1800.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1800.t2 t1800.a0))
% 27.83/28.02  (step t1800 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1800.a0))
% 27.83/28.02  (step t1801 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1799 t1800))
% 27.83/28.02  (step t1802 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1803 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1801 t1802))
% 27.83/28.02  (step t1804 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1803))
% 27.83/28.02  (step t1805 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1793 t1798 t1804))
% 27.83/28.02  (step t1806 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1805))
% 27.83/28.02  (step t1807 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1808 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t1807))
% 27.83/28.02  (step t1809 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1810 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1810.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1810.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1810.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1810.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1810.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1810.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1810.t5))
% 27.83/28.02  (step t1810.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1810.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.02  (step t1810.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1810.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1810.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1810.t3 t1810.t4 t1810.t6 t1810.t7 t1810.t8 t1810.t9 t1810.t10))
% 27.83/28.02  (step t1810 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1811 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1812 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t1810 t1811))
% 27.83/28.02  (step t1813 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1814 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1813))
% 27.83/28.02  (step t1815 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1814))
% 27.83/28.02  (step t1816 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1817 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1818 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1819 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1817 t1818))
% 27.83/28.02  (step t1820 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1816 t1819))
% 27.83/28.02  (step t1821 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1820))
% 27.83/28.02  (anchor :step t1822 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1822.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1822.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1822.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1822.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1822.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1822.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1822.t5 t1813))
% 27.83/28.02  (step t1822.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1822.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1822.t6 t1822.t7))
% 27.83/28.02  (step t1822.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1819 t1822.t8))
% 27.83/28.02  (step t1822.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1822.t9))
% 27.83/28.02  (step t1822.t11 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.02  (step t1822.t12 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t1813 t1822.t11))
% 27.83/28.02  (step t1822.t13 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.02  (step t1822.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t1822.t3 t1822.t4 t1822.t10 t1822.t12 t1822.t13))
% 27.83/28.02  (step t1822 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.02  (step t1823 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t1815 t1821 t1822))
% 27.83/28.02  (step t1824 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t1812 t1823))
% 27.83/28.02  (step t1825 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t1809 t1824 a290))
% 27.83/28.02  (step t1826 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t1825))
% 27.83/28.02  (step t1827 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t1547 t1590 t149 t163 t1622 t149 t163 t1629 t1631 t1649 t1656 t1658 t1676 t1683 t1685 t1703 t1710 t1712 t1730 t1737 t1739 t1757 t982 t209 t216 t151 t158 t198 t205 t137 t144 t187 t194 a148 t1772 t1774 t1792 t1806 t1808 t1826))
% 27.83/28.02  (step t1828 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5))) :rule contraction :premises (t1827))
% 27.83/28.02  (step t1829 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t1828 t614 t621))
% 27.83/28.02  (step t1830 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t1829))
% 27.83/28.02  (step t1831 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t1830 t625 t627 t634 a84 t641))
% 27.83/28.02  (step t1832 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t1831))
% 27.83/28.02  (step t1833 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1832 t161 t147 a194 a192 a187 a191 t646))
% 27.83/28.02  (step t1834 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1835 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1834))
% 27.83/28.02  (step t1836 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.02  (step t1837 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t1836))
% 27.83/28.02  (step t1838 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t70 t81 t1835 a192 a191 t1837 a192 a191 t185 t196 t149 t207 t163 t218 t240 t196 t149 t207 t163 t218))
% 27.83/28.02  (step t1839 (cl (not (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) (not (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) (not (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) (not (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1838))
% 27.83/28.02  (step t1840 (cl (not (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.02  (step t1841 (cl (= (= (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) true) (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule equiv_simplify)
% 27.83/28.02  (step t1842 (cl (not (= (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) true)) (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule equiv1 :premises (t1841))
% 27.83/28.02  (step t1843 (cl (= (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))))) :rule all_simplify)
% 27.83/28.02  (step t1844 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule refl)
% 27.83/28.02  (step t1845 (cl (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule all_simplify)
% 27.83/28.02  (step t1846 (cl (= (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule cong :premises (t1844 t1845))
% 27.83/28.02  (step t1847 (cl (= (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) true)) :rule all_simplify)
% 27.83/28.02  (step t1848 (cl (= (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) true)) :rule trans :premises (t1846 t1847))
% 27.83/28.02  (step t1849 (cl (= (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) true)) :rule trans :premises (t1843 t1848))
% 27.83/28.02  (step t1850 (cl (= (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1842 t1849))
% 27.83/28.02  (step t1851 (cl (= (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule refl)
% 27.83/28.02  (step t1852 (cl (= (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t89 t90 t91 t92 t93 t1850 t1851))
% 27.83/28.02  (step t1853 (cl (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule and_neg)
% 27.83/28.02  (step t1854 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1855)
% 27.83/28.02  (assume t1855.a0 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.02  (assume t1855.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.02  (assume t1855.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.02  (assume t1855.a3 (= tptp.nil tptp.sk5))
% 27.83/28.02  (assume t1855.a4 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.02  (assume t1855.a5 (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))
% 27.83/28.02  (step t1855.t1 (cl (=> (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1855.t2)
% 27.83/28.02  (assume t1855.t2.a0 (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))
% 27.83/28.02  (assume t1855.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 27.83/28.02  (assume t1855.t2.a2 (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))
% 27.83/28.02  (assume t1855.t2.a3 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 27.83/28.02  (assume t1855.t2.a4 (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 27.83/28.02  (assume t1855.t2.a5 (= tptp.nil tptp.sk5))
% 27.83/28.02  (step t1855.t2.t1 (cl (= (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) false) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule equiv_simplify)
% 27.83/28.02  (step t1855.t2.t2 (cl (not (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) false)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule equiv1 :premises (t1855.t2.t1))
% 27.83/28.02  (step t1855.t2.t3 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 27.83/28.02  (step t1855.t2.t4 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t1855.t2.a5))
% 27.83/28.02  (step t1855.t2.t5 (cl (= tptp.nil tptp.sk5)) :rule symm :premises (t1855.t2.t4))
% 27.83/28.02  (step t1855.t2.t6 (cl (= tptp.sk5 tptp.nil)) :rule symm :premises (t1855.t2.t5))
% 27.83/28.02  (step t1855.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.nil)) :rule symm :premises (t1855.t2.a4))
% 27.83/28.02  (step t1855.t2.t8 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t1855.t2.t7))
% 27.83/28.02  (step t1855.t2.t9 (cl (= (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk5 tptp.sk3))) :rule refl)
% 27.83/28.02  (step t1855.t2.t10 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t1855.t2.t9 t1855.t2.a3))
% 27.83/28.02  (step t1855.t2.t11 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t1855.t2.a2))
% 27.83/28.02  (step t1855.t2.t12 (cl (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule symm :premises (t1855.t2.t11))
% 27.83/28.02  (step t1855.t2.t13 (cl (= (tptp.app tptp.sk5 tptp.sk3) tptp.nil)) :rule symm :premises (t1855.t2.t12))
% 27.83/28.02  (step t1855.t2.t14 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t1855.t2.a3))
% 27.83/28.02  (step t1855.t2.t15 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) (tptp.app tptp.sk6 tptp.nil)) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t1855.t2.t13 t1855.t2.t14))
% 27.83/28.02  (step t1855.t2.t16 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t1855.t2.a1))
% 27.83/28.02  (step t1855.t2.t17 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t1855.t2.t16))
% 27.83/28.02  (step t1855.t2.t18 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t1855.t2.t17))
% 27.83/28.02  (step t1855.t2.t19 (cl (= tptp.sk5 tptp.sk6)) :rule trans :premises (t1855.t2.t6 t1855.t2.t8 t1855.t2.t10 t1855.t2.t15 t1855.t2.t18))
% 27.83/28.02  (step t1855.t2.t20 (cl (= (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk7 tptp.sk6 tptp.sk6))) :rule cong :premises (t1855.t2.t3 t1855.t2.t19))
% 27.83/28.02  (step t1855.t2.t21 (cl (= (tptp.sk9 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule cong :premises (t1855.t2.t3 t1855.t2.t19))
% 27.83/28.02  (step t1855.t2.t22 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule cong :premises (t1855.t2.t20 t1855.t2.t21))
% 27.83/28.02  (step t1855.t2.t23 (cl (= (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) false) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule equiv_simplify)
% 27.83/28.02  (step t1855.t2.t24 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) false) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) :rule equiv2 :premises (t1855.t2.t23))
% 27.83/28.02  (step t1855.t2.t25 (cl (not (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule not_not)
% 27.83/28.02  (step t1855.t2.t26 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) false) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule resolution :premises (t1855.t2.t24 t1855.t2.t25))
% 27.83/28.02  (step t1855.t2.t27 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) false)) :rule resolution :premises (t1855.t2.t26 t1855.t2.a0))
% 27.83/28.02  (step t1855.t2.t28 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) false)) :rule trans :premises (t1855.t2.t22 t1855.t2.t27))
% 27.83/28.02  (step t1855.t2.t29 (cl (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1855.t2.t2 t1855.t2.t28))
% 27.83/28.02  (step t1855.t2 (cl (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1855.t2.a0 t1855.t2.a1 t1855.t2.a2 t1855.t2.a3 t1855.t2.a4 t1855.t2.a5))
% 27.83/28.02  (step t1855.t3 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.83/28.02  (step t1855.t4 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1855.t5 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.02  (step t1855.t6 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.02  (step t1855.t7 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1855.t8 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.02  (step t1855.t9 (cl (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)))) :rule resolution :premises (t1855.t2 t1855.t3 t1855.t4 t1855.t5 t1855.t6 t1855.t7 t1855.t8))
% 27.83/28.02  (step t1855.t10 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1855.t9))
% 27.83/28.02  (step t1855.t11 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t1855.t10))
% 27.83/28.02  (step t1855.t12 (cl (=> (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1855.t1 t1855.t11))
% 27.83/28.02  (step t1855.t13 (cl (=> (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1855.t14 (cl (=> (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (=> (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1855.t12 t1855.t13))
% 27.83/28.02  (step t1855.t15 (cl (=> (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1855.t14))
% 27.83/28.02  (step t1855.t16 (cl (not (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1855.t15))
% 27.83/28.02  (step t1855.t17 (cl (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5)) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil tptp.sk5))) :rule and_neg)
% 27.83/28.02  (step t1855.t18 (cl (and (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.nil tptp.sk5))) :rule resolution :premises (t1855.t17 t1855.a5 t1855.a2 t1855.a4 t1855.a1 t1855.a0 t1855.a3))
% 27.83/28.02  (step t1855.t19 (cl (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1855.t16 t1855.t18))
% 27.83/28.02  (step t1855 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t1855.a0 t1855.a1 t1855.a2 t1855.a3 t1855.a4 t1855.a5))
% 27.83/28.02  (step t1856 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1857 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 27.83/28.02  (step t1858 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 27.83/28.02  (step t1859 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.nil tptp.sk5)) :rule and_pos)
% 27.83/28.02  (step t1860 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) :rule and_pos)
% 27.83/28.02  (step t1861 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) :rule and_pos)
% 27.83/28.02  (step t1862 (cl (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1855 t1856 t1857 t1858 t1859 t1860 t1861))
% 27.83/28.02  (step t1863 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1862))
% 27.83/28.02  (step t1864 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t1863))
% 27.83/28.02  (step t1865 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1854 t1864))
% 27.83/28.02  (step t1866 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.02  (step t1867 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1865 t1866))
% 27.83/28.02  (step t1868 (cl (=> (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1867))
% 27.83/28.02  (step t1869 (cl (not (and (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk5) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule implies :premises (t1868))
% 27.83/28.02  (step t1870 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1853 t1869))
% 27.83/28.02  (step t1871 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 27.83/28.02  (step t1872 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule or_neg)
% 27.83/28.02  (step t1873 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 27.83/28.02  (step t1874 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil tptp.sk5)))) :rule or_neg)
% 27.83/28.02  (step t1875 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))))) :rule or_neg)
% 27.83/28.02  (step t1876 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))))) :rule or_neg)
% 27.83/28.02  (step t1877 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule or_neg)
% 27.83/28.02  (step t1878 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1870 t1871 t1872 t1873 t1874 t1875 t1876 t1877))
% 27.83/28.02  (step t1879 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t1878))
% 27.83/28.02  (step t1880 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1840 t1852 t1879))
% 27.83/28.02  (step t1881 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule or :premises (t1880))
% 27.83/28.02  (step t1882 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk5)) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule reordering :premises (t1881))
% 27.83/28.02  (step t1883 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.02  (step t1884 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1883))
% 27.83/28.02  (step t1885 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1884))
% 27.83/28.02  (step t1886 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule or_pos)
% 27.83/28.02  (step t1887 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))) :rule contraction :premises (t1886))
% 27.83/28.02  (step t1888 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule reordering :premises (t1887))
% 27.83/28.02  (step t1889 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.02  (step t1890 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1889))
% 27.83/28.02  (step t1891 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1890))
% 27.83/28.02  (step t1892 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule or_pos)
% 27.83/28.02  (step t1893 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))) :rule contraction :premises (t1892))
% 27.83/28.02  (step t1894 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule reordering :premises (t1893))
% 27.83/28.02  (step t1895 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule or_pos)
% 27.83/28.02  (step t1896 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))) :rule contraction :premises (t1895))
% 27.83/28.02  (step t1897 (cl (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule reordering :premises (t1896))
% 27.83/28.02  (step t1898 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1899)
% 27.83/28.02  (assume t1899.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.02  (step t1899.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1899.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t1899.t1))
% 27.83/28.02  (step t1899.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1899.t2 t1899.a0))
% 27.83/28.02  (step t1899 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1899.a0))
% 27.83/28.02  (step t1900 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1898 t1899))
% 27.83/28.02  (step t1901 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1902 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1900 t1901))
% 27.83/28.02  (step t1903 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1902))
% 27.83/28.02  (step t1904 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1903))
% 27.83/28.02  (step t1905 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1906 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t1905))
% 27.83/28.02  (step t1907 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1908 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1908.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1908.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1908.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1908.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1908.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1908.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1908.t5))
% 27.83/28.02  (step t1908.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1908.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1908.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1908.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1908.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1908.t3 t1908.t4 t1908.t6 t1908.t7 t1908.t8 t1908.t9 t1908.t10))
% 27.83/28.02  (step t1908 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1909 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1910 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1908 t1909))
% 27.83/28.02  (step t1911 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1912 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1911))
% 27.83/28.02  (step t1913 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1912))
% 27.83/28.02  (step t1914 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1915 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1916 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1917 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1915 t1916))
% 27.83/28.02  (step t1918 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1914 t1917))
% 27.83/28.02  (step t1919 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1918))
% 27.83/28.02  (anchor :step t1920 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1920.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1920.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1920.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1920.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1920.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1920.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1920.t5 t1911))
% 27.83/28.02  (step t1920.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1920.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1920.t6 t1920.t7))
% 27.83/28.02  (step t1920.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1917 t1920.t8))
% 27.83/28.02  (step t1920.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1920.t9))
% 27.83/28.02  (step t1920.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1920.t12 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.02  (step t1920.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t1920.t3 t1920.t4 t1920.t10 t1920.t11 t1920.t12))
% 27.83/28.02  (step t1920 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.02  (step t1921 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t1913 t1919 t1920))
% 27.83/28.02  (step t1922 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t1910 t1921))
% 27.83/28.02  (step t1923 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t1907 t1922 a259))
% 27.83/28.02  (step t1924 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t1923))
% 27.83/28.02  (step t1925 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1926)
% 27.83/28.02  (assume t1926.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.02  (step t1926.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1926.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule or :premises (t1926.t1))
% 27.83/28.02  (step t1926.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1926.t2 t1926.a0))
% 27.83/28.02  (step t1926 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t1926.a0))
% 27.83/28.02  (step t1927 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1925 t1926))
% 27.83/28.02  (step t1928 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.83/28.02  (step t1929 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t1927 t1928))
% 27.83/28.02  (step t1930 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t1929))
% 27.83/28.02  (step t1931 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule implies :premises (t1930))
% 27.83/28.02  (step t1932 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.02  (step t1933 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t1932))
% 27.83/28.02  (step t1934 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1935 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1935.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1935.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1935.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1935.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1935.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1935.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1935.t5))
% 27.83/28.02  (step t1935.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1935.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.02  (step t1935.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1935.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1935.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1935.t3 t1935.t4 t1935.t6 t1935.t7 t1935.t8 t1935.t9 t1935.t10))
% 27.83/28.02  (step t1935 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1936 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.02  (step t1937 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1935 t1936))
% 27.83/28.02  (step t1938 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1939 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1938))
% 27.83/28.02  (step t1940 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1939))
% 27.83/28.02  (step t1941 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1942 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1943 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1944 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1942 t1943))
% 27.83/28.02  (step t1945 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1941 t1944))
% 27.83/28.02  (step t1946 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1945))
% 27.83/28.02  (anchor :step t1947 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1947.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1947.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1947.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1947.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1947.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1947.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1947.t5 t1938))
% 27.83/28.02  (step t1947.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1947.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1947.t6 t1947.t7))
% 27.83/28.02  (step t1947.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1944 t1947.t8))
% 27.83/28.02  (step t1947.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1947.t9))
% 27.83/28.02  (step t1947.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1947.t12 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.02  (step t1947.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t1947.t3 t1947.t4 t1947.t10 t1947.t11 t1947.t12))
% 27.83/28.02  (step t1947 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.02  (step t1948 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t1940 t1946 t1947))
% 27.83/28.02  (step t1949 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t1937 t1948))
% 27.83/28.02  (step t1950 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t1934 t1949 a279))
% 27.83/28.02  (step t1951 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t1950))
% 27.83/28.02  (step t1952 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.02  (anchor :step t1953)
% 27.83/28.02  (assume t1953.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.02  (step t1953.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.02  (step t1953.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule or :premises (t1953.t1))
% 27.83/28.02  (step t1953.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1953.t2 t1953.a0))
% 27.83/28.02  (step t1953 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t1953.a0))
% 27.83/28.02  (step t1954 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t1952 t1953))
% 27.83/28.02  (step t1955 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.02  (step t1956 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t1954 t1955))
% 27.83/28.02  (step t1957 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t1956))
% 27.83/28.02  (step t1958 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies :premises (t1957))
% 27.83/28.02  (step t1959 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.02  (step t1960 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t1959))
% 27.83/28.02  (step t1961 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.02  (anchor :step t1962 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1962.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1962.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1962.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1962.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1962.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.02  (step t1962.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1962.t5))
% 27.83/28.02  (step t1962.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1962.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1962.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.02  (step t1962.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.02  (step t1962.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1962.t3 t1962.t4 t1962.t6 t1962.t7 t1962.t8 t1962.t9 t1962.t10))
% 27.83/28.02  (step t1962 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.02  (step t1963 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.02  (step t1964 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1962 t1963))
% 27.83/28.02  (step t1965 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.02  (step t1966 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1965))
% 27.83/28.02  (step t1967 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1966))
% 27.83/28.02  (step t1968 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.02  (step t1969 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.02  (step t1970 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.02  (step t1971 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1969 t1970))
% 27.83/28.02  (step t1972 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1968 t1971))
% 27.83/28.02  (step t1973 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1972))
% 27.83/28.02  (anchor :step t1974 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.02  (step t1974.t1 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1974.t2 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1974.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.02  (step t1974.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.02  (step t1974.t5 (cl (= A A)) :rule refl)
% 27.83/28.02  (step t1974.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t1974.t5 t1965))
% 27.83/28.02  (step t1974.t7 (cl (= B B)) :rule refl)
% 27.83/28.02  (step t1974.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t1974.t6 t1974.t7))
% 27.83/28.02  (step t1974.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1971 t1974.t8))
% 27.83/28.02  (step t1974.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t1974.t9))
% 27.83/28.02  (step t1974.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.02  (step t1974.t12 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.02  (step t1974.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t1974.t3 t1974.t4 t1974.t10 t1974.t11 t1974.t12))
% 27.83/28.02  (step t1974 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.02  (step t1975 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t1967 t1973 t1974))
% 27.83/28.02  (step t1976 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t1964 t1975))
% 27.83/28.03  (step t1977 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t1961 t1976 a286))
% 27.83/28.03  (step t1978 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t1977))
% 27.83/28.03  (step t1979 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t1980)
% 27.83/28.03  (assume t1980.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.03  (step t1980.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t1980.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule or :premises (t1980.t1))
% 27.83/28.03  (step t1980.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t1980.t2 t1980.a0))
% 27.83/28.03  (step t1980 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule subproof :discharge (t1980.a0))
% 27.83/28.03  (step t1981 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t1979 t1980))
% 27.83/28.03  (step t1982 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.03  (step t1983 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t1981 t1982))
% 27.83/28.03  (step t1984 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t1983))
% 27.83/28.03  (step t1985 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies :premises (t1984))
% 27.83/28.03  (step t1986 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.03  (step t1987 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t1986))
% 27.83/28.03  (step t1988 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t1989 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t1989.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t1989.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t1989.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t1989.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t1989.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t1989.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t1989.t5))
% 27.83/28.03  (step t1989.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t1989.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t1989.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t1989.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t1989.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t1989.t3 t1989.t4 t1989.t6 t1989.t7 t1989.t8 t1989.t9 t1989.t10))
% 27.83/28.03  (step t1989 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t1990 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.03  (step t1991 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1989 t1990))
% 27.83/28.03  (step t1992 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t1993 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t1992))
% 27.83/28.03  (step t1994 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t1993))
% 27.83/28.03  (step t1995 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t1996 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t1997 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t1998 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t1996 t1997))
% 27.83/28.03  (step t1999 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t1995 t1998))
% 27.83/28.03  (step t2000 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t1999))
% 27.83/28.03  (anchor :step t2001 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2001.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2001.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2001.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2001.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2001.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2001.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2001.t5 t1992))
% 27.83/28.03  (step t2001.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2001.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2001.t6 t2001.t7))
% 27.83/28.03  (step t2001.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t1998 t2001.t8))
% 27.83/28.03  (step t2001.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2001.t9))
% 27.83/28.03  (step t2001.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2001.t12 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.03  (step t2001.t13 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t1992 t2001.t12))
% 27.83/28.03  (step t2001.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2001.t3 t2001.t4 t2001.t10 t2001.t11 t2001.t13))
% 27.83/28.03  (step t2001 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.03  (step t2002 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t1994 t2000 t2001))
% 27.83/28.03  (step t2003 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t1991 t2002))
% 27.83/28.03  (step t2004 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t1988 t2003 a294))
% 27.83/28.03  (step t2005 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2004))
% 27.83/28.03  (step t2006 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2007)
% 27.83/28.03  (assume t2007.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.03  (step t2007.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t2007.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t2007.t1))
% 27.83/28.03  (step t2007.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2007.t2 t2007.a0))
% 27.83/28.03  (step t2007 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t2007.a0))
% 27.83/28.03  (step t2008 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2006 t2007))
% 27.83/28.03  (step t2009 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.03  (step t2010 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t2008 t2009))
% 27.83/28.03  (step t2011 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t2010))
% 27.83/28.03  (step t2012 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t2011))
% 27.83/28.03  (step t2013 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2014 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t2013))
% 27.83/28.03  (step t2015 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2016 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2016.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2016.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2016.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2016.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2016.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2016.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2016.t5))
% 27.83/28.03  (step t2016.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2016.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2016.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2016.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2016.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2016.t3 t2016.t4 t2016.t6 t2016.t7 t2016.t8 t2016.t9 t2016.t10))
% 27.83/28.03  (step t2016 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2017 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2018 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2016 t2017))
% 27.83/28.03  (step t2019 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2020 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2019))
% 27.83/28.03  (step t2021 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2020))
% 27.83/28.03  (step t2022 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2023 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2024 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2025 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2023 t2024))
% 27.83/28.03  (step t2026 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2022 t2025))
% 27.83/28.03  (step t2027 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2026))
% 27.83/28.03  (anchor :step t2028 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2028.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2028.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2028.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2028.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2028.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2028.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2028.t5 t2019))
% 27.83/28.03  (step t2028.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2028.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2028.t6 t2028.t7))
% 27.83/28.03  (step t2028.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2025 t2028.t8))
% 27.83/28.03  (step t2028.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2028.t9))
% 27.83/28.03  (step t2028.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2028.t12 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2028.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t2028.t3 t2028.t4 t2028.t10 t2028.t11 t2028.t12))
% 27.83/28.03  (step t2028 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2029 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t2021 t2027 t2028))
% 27.83/28.03  (step t2030 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2018 t2029))
% 27.83/28.03  (step t2031 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t2015 t2030 a295))
% 27.83/28.03  (step t2032 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t2031))
% 27.83/28.03  (step t2033 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= tptp.nil tptp.sk5)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t1839 t1882 t149 t163 t1885 a192 t1888 a192 t1891 a192 t1894 a192 t1897 a192 t1904 t1906 t1924 t1931 t1933 t1951 t1958 t1960 t1978 t1985 t1987 t2005 t2012 t2014 t2032))
% 27.83/28.03  (step t2034 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3))) :rule contraction :premises (t2033))
% 27.83/28.03  (step t2035 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6))) :rule resolution :premises (t2034 t982 t209 t216 t151 t158 t198 t205 t137 t144 t187 t194 a148))
% 27.83/28.03  (step t2036 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5))) :rule contraction :premises (t2035))
% 27.83/28.03  (step t2037 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule resolution :premises (t2036 t614 t621))
% 27.83/28.03  (step t2038 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t2037))
% 27.83/28.03  (step t2039 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2040 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.83/28.03  (step t2041 (cl (= (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.83/28.03  (step t2042 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2041 t418))
% 27.83/28.03  (step t2043 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2044 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2042 t2043))
% 27.83/28.03  (step t2045 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2040 t2044))
% 27.83/28.03  (step t2046 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2047)
% 27.83/28.03  (assume t2047.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))
% 27.83/28.03  (step t2047.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2047.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t2047.t1))
% 27.83/28.03  (step t2047.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2047.t2 t2047.a0))
% 27.83/28.03  (step t2047 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2047.a0))
% 27.83/28.03  (step t2048 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2046 t2047))
% 27.83/28.03  (step t2049 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2050 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2048 t2049))
% 27.83/28.03  (step t2051 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2050))
% 27.83/28.03  (step t2052 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2039 t2045 t2051))
% 27.83/28.03  (step t2053 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2052))
% 27.83/28.03  (step t2054 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2055 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t2054))
% 27.83/28.03  (step t2056 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2057 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2057.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2057.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2057.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2057.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2057.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2057.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2057.t5))
% 27.83/28.03  (step t2057.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2057.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2057.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2057.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2057.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2057.t3 t2057.t4 t2057.t6 t2057.t7 t2057.t8 t2057.t9 t2057.t10))
% 27.83/28.03  (step t2057 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2058 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2059 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2057 t2058))
% 27.83/28.03  (step t2060 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2061 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2060))
% 27.83/28.03  (step t2062 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2061))
% 27.83/28.03  (step t2063 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2064 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2065 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2066 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2064 t2065))
% 27.83/28.03  (step t2067 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2063 t2066))
% 27.83/28.03  (step t2068 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2067))
% 27.83/28.03  (anchor :step t2069 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2069.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2069.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2069.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2069.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2069.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2069.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2069.t5 t2060))
% 27.83/28.03  (step t2069.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2069.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2069.t6 t2069.t7))
% 27.83/28.03  (step t2069.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2066 t2069.t8))
% 27.83/28.03  (step t2069.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2069.t9))
% 27.83/28.03  (step t2069.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2069.t12 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2069.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t2069.t3 t2069.t4 t2069.t10 t2069.t11 t2069.t12))
% 27.83/28.03  (step t2069 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.03  (step t2070 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t2062 t2068 t2069))
% 27.83/28.03  (step t2071 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2059 t2070))
% 27.83/28.03  (step t2072 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t2056 t2071 a270))
% 27.83/28.03  (step t2073 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t2072))
% 27.83/28.03  (step t2074 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2075 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.03  (step t2076 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2041 t523))
% 27.83/28.03  (step t2077 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2078 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2076 t2077))
% 27.83/28.03  (step t2079 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2075 t2078))
% 27.83/28.03  (step t2080 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2081)
% 27.83/28.03  (assume t2081.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.03  (step t2081.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2081.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t2081.t1))
% 27.83/28.03  (step t2081.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2081.t2 t2081.a0))
% 27.83/28.03  (step t2081 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2081.a0))
% 27.83/28.03  (step t2082 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2080 t2081))
% 27.83/28.03  (step t2083 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2084 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2082 t2083))
% 27.83/28.03  (step t2085 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2084))
% 27.83/28.03  (step t2086 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2074 t2079 t2085))
% 27.83/28.03  (step t2087 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2086))
% 27.83/28.03  (step t2088 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2089 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t2088))
% 27.83/28.03  (step t2090 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2091 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2091.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2091.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2091.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2091.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2091.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2091.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2091.t5))
% 27.83/28.03  (step t2091.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2091.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2091.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2091.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2091.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2091.t3 t2091.t4 t2091.t6 t2091.t7 t2091.t8 t2091.t9 t2091.t10))
% 27.83/28.03  (step t2091 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2092 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2093 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2091 t2092))
% 27.83/28.03  (step t2094 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2095 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2094))
% 27.83/28.03  (step t2096 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2095))
% 27.83/28.03  (step t2097 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2098 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2099 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2100 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2098 t2099))
% 27.83/28.03  (step t2101 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2097 t2100))
% 27.83/28.03  (step t2102 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2101))
% 27.83/28.03  (anchor :step t2103 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2103.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2103.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2103.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2103.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2103.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2103.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2103.t5 t2094))
% 27.83/28.03  (step t2103.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2103.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2103.t6 t2103.t7))
% 27.83/28.03  (step t2103.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2100 t2103.t8))
% 27.83/28.03  (step t2103.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2103.t9))
% 27.83/28.03  (step t2103.t11 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2103.t12 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2103.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2103.t3 t2103.t4 t2103.t10 t2103.t11 t2103.t12))
% 27.83/28.03  (step t2103 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.03  (step t2104 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2096 t2102 t2103))
% 27.83/28.03  (step t2105 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2093 t2104))
% 27.83/28.03  (step t2106 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2090 t2105 a291))
% 27.83/28.03  (step t2107 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t2106))
% 27.83/28.03  (step t2108 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t2038 t625 t627 t634 a84 t641 t2053 t2055 t2073 t2087 t2089 t2107))
% 27.83/28.03  (step t2109 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6)) (not (tptp.strictorderedP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (not (tptp.ssList tptp.sk6)) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (not (tptp.ssList tptp.sk5)) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule contraction :premises (t2108))
% 27.83/28.03  (step t2110 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk6) (tptp.sk9 tptp.sk6 tptp.sk6))) :rule resolution :premises (t2109 t161 t147 a192 a187 a191 t646 a194))
% 27.83/28.03  (step t2111 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2112)
% 27.83/28.03  (assume t2112.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.03  (step t2112.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t2112.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t2112.t1))
% 27.83/28.03  (step t2112.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2112.t2 t2112.a0))
% 27.83/28.03  (step t2112 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t2112.a0))
% 27.83/28.03  (step t2113 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2111 t2112))
% 27.83/28.03  (step t2114 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.03  (step t2115 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t2113 t2114))
% 27.83/28.03  (step t2116 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t2115))
% 27.83/28.03  (step t2117 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk6) (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t2116))
% 27.83/28.03  (step t2118 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2119)
% 27.83/28.03  (assume t2119.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.03  (step t2119.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t2119.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule or :premises (t2119.t1))
% 27.83/28.03  (step t2119.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t2119.t2 t2119.a0))
% 27.83/28.03  (step t2119 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule subproof :discharge (t2119.a0))
% 27.83/28.03  (step t2120 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule resolution :premises (t2118 t2119))
% 27.83/28.03  (step t2121 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.03  (step t2122 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule resolution :premises (t2120 t2121))
% 27.83/28.03  (step t2123 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil)))))) :rule contraction :premises (t2122))
% 27.83/28.03  (step t2124 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk6) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk6) tptp.nil))))) :rule implies :premises (t2123))
% 27.83/28.03  (step t2125 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2126 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule refl)
% 27.83/28.03  (step t2127 (cl (= (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule refl)
% 27.83/28.03  (step t2128 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2127 t523))
% 27.83/28.03  (step t2129 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2130 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2128 t2129))
% 27.83/28.03  (step t2131 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2126 t2130))
% 27.83/28.03  (step t2132 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2133)
% 27.83/28.03  (assume t2133.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))
% 27.83/28.03  (step t2133.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2133.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule or :premises (t2133.t1))
% 27.83/28.03  (step t2133.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2133.t2 t2133.a0))
% 27.83/28.03  (step t2133 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2133.a0))
% 27.83/28.03  (step t2134 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2132 t2133))
% 27.83/28.03  (step t2135 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2136 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2134 t2135))
% 27.83/28.03  (step t2137 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2136))
% 27.83/28.03  (step t2138 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2125 t2131 t2137))
% 27.83/28.03  (step t2139 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2138))
% 27.83/28.03  (step t2140 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2141)
% 27.83/28.03  (assume t2141.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.03  (step t2141.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t2141.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule or :premises (t2141.t1))
% 27.83/28.03  (step t2141.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2141.t2 t2141.a0))
% 27.83/28.03  (step t2141 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t2141.a0))
% 27.83/28.03  (step t2142 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2140 t2141))
% 27.83/28.03  (step t2143 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.03  (step t2144 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t2142 t2143))
% 27.83/28.03  (step t2145 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t2144))
% 27.83/28.03  (step t2146 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk6)))) :rule implies :premises (t2145))
% 27.83/28.03  (step t2147 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2148)
% 27.83/28.03  (assume t2148.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.03  (step t2148.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t2148.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule or :premises (t2148.t1))
% 27.83/28.03  (step t2148.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t2148.t2 t2148.a0))
% 27.83/28.03  (step t2148 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule subproof :discharge (t2148.a0))
% 27.83/28.03  (step t2149 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t2147 t2148))
% 27.83/28.03  (step t2150 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule implies_neg2)
% 27.83/28.03  (step t2151 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule resolution :premises (t2149 t2150))
% 27.83/28.03  (step t2152 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6)))))) :rule contraction :premises (t2151))
% 27.83/28.03  (step t2153 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk6) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk6))))) :rule implies :premises (t2152))
% 27.83/28.03  (step t2154 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2155 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule refl)
% 27.83/28.03  (step t2156 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2127 t418))
% 27.83/28.03  (step t2157 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2158 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2156 t2157))
% 27.83/28.03  (step t2159 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2155 t2158))
% 27.83/28.03  (step t2160 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2161)
% 27.83/28.03  (assume t2161.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))
% 27.83/28.03  (step t2161.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2161.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or :premises (t2161.t1))
% 27.83/28.03  (step t2161.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2161.t2 t2161.a0))
% 27.83/28.03  (step t2161 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2161.a0))
% 27.83/28.03  (step t2162 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2160 t2161))
% 27.83/28.03  (step t2163 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2164 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2162 t2163))
% 27.83/28.03  (step t2165 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2164))
% 27.83/28.03  (step t2166 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2154 t2159 t2165))
% 27.83/28.03  (step t2167 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2166))
% 27.83/28.03  (step t2168 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2169)
% 27.83/28.03  (assume t2169.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.03  (step t2169.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk6)))
% 27.83/28.03  (step t2169.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule or :premises (t2169.t1))
% 27.83/28.03  (step t2169.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2169.t2 t2169.a0))
% 27.83/28.03  (step t2169 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule subproof :discharge (t2169.a0))
% 27.83/28.03  (step t2170 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule resolution :premises (t2168 t2169))
% 27.83/28.03  (step t2171 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule implies_neg2)
% 27.83/28.03  (step t2172 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule resolution :premises (t2170 t2171))
% 27.83/28.03  (step t2173 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6))))) :rule contraction :premises (t2172))
% 27.83/28.03  (step t2174 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk6 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk6)))) :rule implies :premises (t2173))
% 27.83/28.03  (step t2175 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t257 t259 t267 t647 t989 t1266 t1526 t1833 t2110 t982 t196 t149 t207 t163 t218 t2117 t2124 t2139 t2146 t2153 t2167 t2174))
% 27.83/28.03  (step t2176 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil tptp.sk5)) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule contraction :premises (t2175))
% 27.83/28.03  (step t2177 (cl (or (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (= tptp.nil tptp.sk5))) :rule resolution :premises (t621 t646))
% 27.83/28.03  (step t2178 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2179 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv2 :premises (t2178))
% 27.83/28.03  (step t2180 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (= A A) (= B B)))
% 27.83/28.03  (step t2181 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv2 :premises (t2180))
% 27.83/28.03  (step t2182 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2183 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv2 :premises (t2182))
% 27.83/28.03  (step t2184 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2185 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv2 :premises (t2184))
% 27.83/28.03  (step t2186 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (= A A) (= B B)))
% 27.83/28.03  (step t2187 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv2 :premises (t2186))
% 27.83/28.03  (step t2188 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2189 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv2 :premises (t2188))
% 27.83/28.03  (step t2190 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (= A A) (= B B)))
% 27.83/28.03  (step t2191 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv2 :premises (t2190))
% 27.83/28.03  (step t2192 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t2176 t614 t2177 a191 a187 t2179 t2181 t2183 t2185 t2187 t2189 t2191))
% 27.83/28.03  (step t2193 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app tptp.sk5 tptp.sk3))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule contraction :premises (t2192))
% 27.83/28.03  (step t2194 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (= tptp.nil (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t641 t646))
% 27.83/28.03  (step t2195 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t634 a84))
% 27.83/28.03  (step t2196 (cl (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) :rule resolution :premises (t627 a187 a191 t2195))
% 27.83/28.03  (step t2197 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2198 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2198.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2198.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2198.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2198.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2198.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2198.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2198.t5))
% 27.83/28.03  (step t2198.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2198.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2198.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2198.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2198.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2198.t3 t2198.t4 t2198.t6 t2198.t7 t2198.t8 t2198.t9 t2198.t10))
% 27.83/28.03  (step t2198 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2199 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2200 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2198 t2199))
% 27.83/28.03  (step t2201 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2202 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2201))
% 27.83/28.03  (step t2203 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2202))
% 27.83/28.03  (step t2204 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2205 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2206 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2207 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2205 t2206))
% 27.83/28.03  (step t2208 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2204 t2207))
% 27.83/28.03  (step t2209 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2208))
% 27.83/28.03  (anchor :step t2210 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2210.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2210.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2210.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2210.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2210.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2210.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2210.t5 t2201))
% 27.83/28.03  (step t2210.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2210.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2210.t6 t2210.t7))
% 27.83/28.03  (step t2210.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2207 t2210.t8))
% 27.83/28.03  (step t2210.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2210.t9))
% 27.83/28.03  (step t2210.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2210.t12 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2210.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t2210.t3 t2210.t4 t2210.t10 t2210.t11 t2210.t12))
% 27.83/28.03  (step t2210 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2211 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t2203 t2209 t2210))
% 27.83/28.03  (step t2212 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2200 t2211))
% 27.83/28.03  (step t2213 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t2197 t2212 a253))
% 27.83/28.03  (step t2214 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t2213))
% 27.83/28.03  (step t2215 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2216 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2216.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2216.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2216.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2216.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2216.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2216.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2216.t5))
% 27.83/28.03  (step t2216.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2216.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2216.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2216.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2216.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2216.t3 t2216.t4 t2216.t6 t2216.t7 t2216.t8 t2216.t9 t2216.t10))
% 27.83/28.03  (step t2216 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2217 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.03  (step t2218 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2216 t2217))
% 27.83/28.03  (step t2219 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2220 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2219))
% 27.83/28.03  (step t2221 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2220))
% 27.83/28.03  (step t2222 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2223 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2224 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2225 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2223 t2224))
% 27.83/28.03  (step t2226 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2222 t2225))
% 27.83/28.03  (step t2227 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2226))
% 27.83/28.03  (anchor :step t2228 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2228.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2228.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2228.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2228.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2228.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2228.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2228.t5 t2219))
% 27.83/28.03  (step t2228.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2228.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2228.t6 t2228.t7))
% 27.83/28.03  (step t2228.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2225 t2228.t8))
% 27.83/28.03  (step t2228.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2228.t9))
% 27.83/28.03  (step t2228.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2228.t12 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.03  (step t2228.t13 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t2219 t2228.t12))
% 27.83/28.03  (step t2228.t14 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2228.t3 t2228.t4 t2228.t10 t2228.t11 t2228.t13))
% 27.83/28.03  (step t2228 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.03  (step t2229 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t2221 t2227 t2228))
% 27.83/28.03  (step t2230 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2218 t2229))
% 27.83/28.03  (step t2231 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t2215 t2230 a252))
% 27.83/28.03  (step t2232 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2231))
% 27.83/28.03  (step t2233 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2234 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2234.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2234.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2234.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2234.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2234.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2234.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2234.t5))
% 27.83/28.03  (step t2234.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2234.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2234.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2234.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2234.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2234.t3 t2234.t4 t2234.t6 t2234.t7 t2234.t8 t2234.t9 t2234.t10))
% 27.83/28.03  (step t2234 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2235 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2236 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2234 t2235))
% 27.83/28.03  (step t2237 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2238 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2237))
% 27.83/28.03  (step t2239 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2238))
% 27.83/28.03  (step t2240 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2241 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2242 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2243 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2241 t2242))
% 27.83/28.03  (step t2244 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2240 t2243))
% 27.83/28.03  (step t2245 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2244))
% 27.83/28.03  (anchor :step t2246 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2246.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2246.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2246.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2246.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2246.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2246.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2246.t5 t2237))
% 27.83/28.03  (step t2246.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2246.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2246.t6 t2246.t7))
% 27.83/28.03  (step t2246.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2243 t2246.t8))
% 27.83/28.03  (step t2246.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2246.t9))
% 27.83/28.03  (step t2246.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2246.t12 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2246.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2246.t3 t2246.t4 t2246.t10 t2246.t11 t2246.t12))
% 27.83/28.03  (step t2246 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.03  (step t2247 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2239 t2245 t2246))
% 27.83/28.03  (step t2248 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2236 t2247))
% 27.83/28.03  (step t2249 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2233 t2248 a251))
% 27.83/28.03  (step t2250 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t2249))
% 27.83/28.03  (step t2251 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2252 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2252.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2252.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2252.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2252.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2252.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2252.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2252.t5))
% 27.83/28.03  (step t2252.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2252.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2252.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2252.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2252.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2252.t3 t2252.t4 t2252.t6 t2252.t7 t2252.t8 t2252.t9 t2252.t10))
% 27.83/28.03  (step t2252 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2253 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2254 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2252 t2253))
% 27.83/28.03  (step t2255 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2256 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2255))
% 27.83/28.03  (step t2257 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2256))
% 27.83/28.03  (step t2258 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2259 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2260 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2261 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2259 t2260))
% 27.83/28.03  (step t2262 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2258 t2261))
% 27.83/28.03  (step t2263 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2262))
% 27.83/28.03  (anchor :step t2264 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2264.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2264.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2264.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2264.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2264.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2264.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2264.t5 t2255))
% 27.83/28.03  (step t2264.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2264.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2264.t6 t2264.t7))
% 27.83/28.03  (step t2264.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2261 t2264.t8))
% 27.83/28.03  (step t2264.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2264.t9))
% 27.83/28.03  (step t2264.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2264.t12 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2264.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t2264.t3 t2264.t4 t2264.t10 t2264.t11 t2264.t12))
% 27.83/28.03  (step t2264 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.03  (step t2265 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t2257 t2263 t2264))
% 27.83/28.03  (step t2266 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2254 t2265))
% 27.83/28.03  (step t2267 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t2251 t2266 a250))
% 27.83/28.03  (step t2268 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t2267))
% 27.83/28.03  (step t2269 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2270 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2270.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2270.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2270.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2270.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2270.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2270.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2270.t5))
% 27.83/28.03  (step t2270.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2270.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.03  (step t2270.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2270.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2270.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2270.t3 t2270.t4 t2270.t6 t2270.t7 t2270.t8 t2270.t9 t2270.t10))
% 27.83/28.03  (step t2270 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2271 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.03  (step t2272 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2270 t2271))
% 27.83/28.03  (step t2273 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2274 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2273))
% 27.83/28.03  (step t2275 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2274))
% 27.83/28.03  (step t2276 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2277 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2278 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2279 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2277 t2278))
% 27.83/28.03  (step t2280 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2276 t2279))
% 27.83/28.03  (step t2281 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2280))
% 27.83/28.03  (anchor :step t2282 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2282.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2282.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2282.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2282.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2282.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2282.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2282.t5 t2273))
% 27.83/28.03  (step t2282.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2282.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2282.t6 t2282.t7))
% 27.83/28.03  (step t2282.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2279 t2282.t8))
% 27.83/28.03  (step t2282.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2282.t9))
% 27.83/28.03  (step t2282.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2282.t12 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.03  (step t2282.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t2282.t3 t2282.t4 t2282.t10 t2282.t11 t2282.t12))
% 27.83/28.03  (step t2282 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.03  (step t2283 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t2275 t2281 t2282))
% 27.83/28.03  (step t2284 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2272 t2283))
% 27.83/28.03  (step t2285 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t2269 t2284 a249))
% 27.83/28.03  (step t2286 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t2285))
% 27.83/28.03  (step t2287 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2288 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2288.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2288.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2288.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2288.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2288.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2288.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2288.t5))
% 27.83/28.03  (step t2288.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2288.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2288.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2288.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2288.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2288.t3 t2288.t4 t2288.t6 t2288.t7 t2288.t8 t2288.t9 t2288.t10))
% 27.83/28.03  (step t2288 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2289 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2290 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2288 t2289))
% 27.83/28.03  (step t2291 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2292 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2291))
% 27.83/28.03  (step t2293 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2292))
% 27.83/28.03  (step t2294 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2295 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2296 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2297 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2295 t2296))
% 27.83/28.03  (step t2298 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2294 t2297))
% 27.83/28.03  (step t2299 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2298))
% 27.83/28.03  (anchor :step t2300 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2300.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2300.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2300.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2300.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2300.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2300.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2300.t5 t2291))
% 27.83/28.03  (step t2300.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2300.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2300.t6 t2300.t7))
% 27.83/28.03  (step t2300.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2297 t2300.t8))
% 27.83/28.03  (step t2300.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2300.t9))
% 27.83/28.03  (step t2300.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2300.t12 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2300.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t2300.t3 t2300.t4 t2300.t10 t2300.t11 t2300.t12))
% 27.83/28.03  (step t2300 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.03  (step t2301 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t2293 t2299 t2300))
% 27.83/28.03  (step t2302 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2290 t2301))
% 27.83/28.03  (step t2303 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t2287 t2302 a248))
% 27.83/28.03  (step t2304 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t2303))
% 27.83/28.03  (step t2305 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2306 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2306.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2306.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2306.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2306.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2306.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2306.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2306.t5))
% 27.83/28.03  (step t2306.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2306.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2306.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2306.t10 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 27.83/28.03  (step t2306.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2))))) :rule cong :premises (t2306.t3 t2306.t4 t2306.t6 t2306.t7 t2306.t8 t2306.t9 t2306.t10))
% 27.83/28.03  (step t2306 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))))) :rule bind)
% 27.83/28.03  (step t2307 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2308 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2306 t2307))
% 27.83/28.03  (step t2309 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2310 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2309))
% 27.83/28.03  (step t2311 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2310))
% 27.83/28.03  (step t2312 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2313 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2314 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2315 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2313 t2314))
% 27.83/28.03  (step t2316 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule cong :premises (t2312 t2315))
% 27.83/28.03  (step t2317 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule cong :premises (t2316))
% 27.83/28.03  (anchor :step t2318 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2318.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2318.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2318.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2318.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2318.t5 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2318.t6 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2318.t5 t2309))
% 27.83/28.03  (step t2318.t7 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2318.t8 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2318.t6 t2318.t7))
% 27.83/28.03  (step t2318.t9 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2315 t2318.t8))
% 27.83/28.03  (step t2318.t10 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2318.t9))
% 27.83/28.03  (step t2318.t11 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.03  (step t2318.t12 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2318.t13 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t2318.t3 t2318.t4 t2318.t10 t2318.t11 t2318.t12))
% 27.83/28.03  (step t2318 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2319 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t2311 t2317 t2318))
% 27.83/28.03  (step t2320 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (not (= tptp.nil tptp.sk2)))) (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2308 t2319))
% 27.83/28.03  (step t2321 (cl (or (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t2305 t2320 a199))
% 27.83/28.03  (step t2322 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t2321))
% 27.83/28.03  (step t2323 (cl (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule reordering :premises (t2322))
% 27.83/28.03  (step t2324 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t2193 t625 t2194 t2196 a192 t2214 a194 t2232 a194 t2250 a194 t2268 a194 t2286 a194 t2304 a194 t2323 a194))
% 27.83/28.03  (step t2325 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t2324))
% 27.83/28.03  (step t2326 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t68 t2325))
% 27.83/28.03  (step t2327 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t59 t2326 a194))
% 27.83/28.03  (step t2328 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t41 t2327))
% 27.83/28.03  (step t2329 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2330 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2330.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2330.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2330.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2330.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2330.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2330.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2330.t5))
% 27.83/28.03  (step t2330.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2330.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2330.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2330.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2330.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2330.t3 t2330.t4 t2330.t6 t2330.t7 t2330.t8 t2330.t9 t2330.t10))
% 27.83/28.03  (step t2330 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2331 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.03  (step t2332 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2330 t2331))
% 27.83/28.03  (step t2333 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2334 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2333))
% 27.83/28.03  (step t2335 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2334))
% 27.83/28.03  (step t2336 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2337 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2336 t2333))
% 27.83/28.03  (anchor :step t2338 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2338.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2338.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2338.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2338.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2338.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2338.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2338.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2338.t5 t2338.t6))
% 27.83/28.03  (step t2338.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2338.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2338.t8 t2333))
% 27.83/28.03  (step t2338.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2338.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2338.t9 t2338.t10))
% 27.83/28.03  (step t2338.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2338.t7 t2338.t11))
% 27.83/28.03  (step t2338.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2338.t12))
% 27.83/28.03  (step t2338.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2338.t15 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.03  (step t2338.t16 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t2333 t2338.t15))
% 27.83/28.03  (step t2338.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2338.t3 t2338.t4 t2338.t13 t2338.t14 t2338.t16))
% 27.83/28.03  (step t2338 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.03  (step t2339 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t2335 t2337 t2338))
% 27.83/28.03  (step t2340 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2332 t2339))
% 27.83/28.03  (step t2341 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t2329 t2340 a216))
% 27.83/28.03  (step t2342 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2341))
% 27.83/28.03  (step t2343 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t2342))
% 27.83/28.03  (step t2344 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t2343 t2326 a194))
% 27.83/28.03  (step t2345 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t570 t2344))
% 27.83/28.03  (step t2346 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2347 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2347.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2347.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2347.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2347.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2347.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2347.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2347.t5))
% 27.83/28.03  (step t2347.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2347.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2347.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2347.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2347.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2347.t3 t2347.t4 t2347.t6 t2347.t7 t2347.t8 t2347.t9 t2347.t10))
% 27.83/28.03  (step t2347 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2348 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2349 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2347 t2348))
% 27.83/28.03  (step t2350 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2351 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2350))
% 27.83/28.03  (step t2352 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2351))
% 27.83/28.03  (step t2353 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2354 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2353 t2350))
% 27.83/28.03  (anchor :step t2355 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2355.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2355.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2355.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2355.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2355.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2355.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2355.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2355.t5 t2355.t6))
% 27.83/28.03  (step t2355.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2355.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2355.t8 t2350))
% 27.83/28.03  (step t2355.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2355.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2355.t9 t2355.t10))
% 27.83/28.03  (step t2355.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2355.t7 t2355.t11))
% 27.83/28.03  (step t2355.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2355.t12))
% 27.83/28.03  (step t2355.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2355.t15 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2355.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2355.t3 t2355.t4 t2355.t13 t2355.t14 t2355.t15))
% 27.83/28.03  (step t2355 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.03  (step t2356 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2352 t2354 t2355))
% 27.83/28.03  (step t2357 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2349 t2356))
% 27.83/28.03  (step t2358 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2346 t2357 a215))
% 27.83/28.03  (step t2359 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t2358))
% 27.83/28.03  (step t2360 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t2359))
% 27.83/28.03  (step t2361 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t2360 t2326 a194))
% 27.83/28.03  (step t2362 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t535 t2361))
% 27.83/28.03  (step t2363 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2364 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2364.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2364.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2364.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2364.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2364.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2364.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2364.t5))
% 27.83/28.03  (step t2364.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2364.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2364.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2364.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2364.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2364.t3 t2364.t4 t2364.t6 t2364.t7 t2364.t8 t2364.t9 t2364.t10))
% 27.83/28.03  (step t2364 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2365 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2366 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2364 t2365))
% 27.83/28.03  (step t2367 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2368 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2367))
% 27.83/28.03  (step t2369 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2368))
% 27.83/28.03  (step t2370 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2371 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2370 t2367))
% 27.83/28.03  (anchor :step t2372 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2372.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2372.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2372.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2372.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2372.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2372.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2372.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2372.t5 t2372.t6))
% 27.83/28.03  (step t2372.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2372.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2372.t8 t2367))
% 27.83/28.03  (step t2372.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2372.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2372.t9 t2372.t10))
% 27.83/28.03  (step t2372.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2372.t7 t2372.t11))
% 27.83/28.03  (step t2372.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2372.t12))
% 27.83/28.03  (step t2372.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2372.t15 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2372.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t2372.t3 t2372.t4 t2372.t13 t2372.t14 t2372.t15))
% 27.83/28.03  (step t2372 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.03  (step t2373 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t2369 t2371 t2372))
% 27.83/28.03  (step t2374 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2366 t2373))
% 27.83/28.03  (step t2375 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t2363 t2374 a214))
% 27.83/28.03  (step t2376 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t2375))
% 27.83/28.03  (step t2377 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t2376))
% 27.83/28.03  (step t2378 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t2377 t2326 a194))
% 27.83/28.03  (step t2379 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t500 t2378))
% 27.83/28.03  (step t2380 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2381 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2381.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2381.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2381.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2381.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2381.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2381.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2381.t5))
% 27.83/28.03  (step t2381.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2381.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.03  (step t2381.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2381.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2381.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2381.t3 t2381.t4 t2381.t6 t2381.t7 t2381.t8 t2381.t9 t2381.t10))
% 27.83/28.03  (step t2381 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2382 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.03  (step t2383 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2381 t2382))
% 27.83/28.03  (step t2384 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2385 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2384))
% 27.83/28.03  (step t2386 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2385))
% 27.83/28.03  (step t2387 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2388 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2387 t2384))
% 27.83/28.03  (anchor :step t2389 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2389.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2389.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2389.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2389.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2389.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2389.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2389.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2389.t5 t2389.t6))
% 27.83/28.03  (step t2389.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2389.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2389.t8 t2384))
% 27.83/28.03  (step t2389.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2389.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2389.t9 t2389.t10))
% 27.83/28.03  (step t2389.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2389.t7 t2389.t11))
% 27.83/28.03  (step t2389.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2389.t12))
% 27.83/28.03  (step t2389.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2389.t15 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.03  (step t2389.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t2389.t3 t2389.t4 t2389.t13 t2389.t14 t2389.t15))
% 27.83/28.03  (step t2389 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.03  (step t2390 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t2386 t2388 t2389))
% 27.83/28.03  (step t2391 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2383 t2390))
% 27.83/28.03  (step t2392 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t2380 t2391 a213))
% 27.83/28.03  (step t2393 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t2392))
% 27.83/28.03  (step t2394 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t2393))
% 27.83/28.03  (step t2395 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t2394 t2326 a194))
% 27.83/28.03  (step t2396 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t465 t2395))
% 27.83/28.03  (step t2397 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2398 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2398.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2398.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2398.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2398.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2398.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2398.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2398.t5))
% 27.83/28.03  (step t2398.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2398.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2398.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2398.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2398.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2398.t3 t2398.t4 t2398.t6 t2398.t7 t2398.t8 t2398.t9 t2398.t10))
% 27.83/28.03  (step t2398 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2399 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2400 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2398 t2399))
% 27.83/28.03  (step t2401 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2402 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2401))
% 27.83/28.03  (step t2403 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2402))
% 27.83/28.03  (step t2404 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2405 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2404 t2401))
% 27.83/28.03  (anchor :step t2406 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2406.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2406.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2406.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2406.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2406.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2406.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2406.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2406.t5 t2406.t6))
% 27.83/28.03  (step t2406.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2406.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2406.t8 t2401))
% 27.83/28.03  (step t2406.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2406.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2406.t9 t2406.t10))
% 27.83/28.03  (step t2406.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2406.t7 t2406.t11))
% 27.83/28.03  (step t2406.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2406.t12))
% 27.83/28.03  (step t2406.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2406.t15 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2406.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t2406.t3 t2406.t4 t2406.t13 t2406.t14 t2406.t15))
% 27.83/28.03  (step t2406 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.03  (step t2407 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t2403 t2405 t2406))
% 27.83/28.03  (step t2408 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2400 t2407))
% 27.83/28.03  (step t2409 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t2397 t2408 a212))
% 27.83/28.03  (step t2410 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t2409))
% 27.83/28.03  (step t2411 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t2410))
% 27.83/28.03  (step t2412 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t2411 t2326 a194))
% 27.83/28.03  (step t2413 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t430 t2412))
% 27.83/28.03  (step t2414 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2415 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2415.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2415.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2415.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2415.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2415.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2415.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2415.t5))
% 27.83/28.03  (step t2415.t7 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2415.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2415.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2415.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2415.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2415.t3 t2415.t4 t2415.t6 t2415.t7 t2415.t8 t2415.t9 t2415.t10))
% 27.83/28.03  (step t2415 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2416 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2417 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2415 t2416))
% 27.83/28.03  (step t2418 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2419 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2418))
% 27.83/28.03  (step t2420 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2419))
% 27.83/28.03  (step t2421 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2422 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2421 t2418))
% 27.83/28.03  (anchor :step t2423 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2423.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2423.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2423.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2423.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2423.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2423.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2423.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2423.t5 t2423.t6))
% 27.83/28.03  (step t2423.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2423.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2423.t8 t2418))
% 27.83/28.03  (step t2423.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2423.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2423.t9 t2423.t10))
% 27.83/28.03  (step t2423.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2423.t7 t2423.t11))
% 27.83/28.03  (step t2423.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2423.t12))
% 27.83/28.03  (step t2423.t14 (cl (= (tptp.ssList (tptp.sk8 B A)) (tptp.ssList (tptp.sk8 B A)))) :rule refl)
% 27.83/28.03  (step t2423.t15 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2423.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t2423.t3 t2423.t4 t2423.t13 t2423.t14 t2423.t15))
% 27.83/28.03  (step t2423 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2424 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t2420 t2422 t2423))
% 27.83/28.03  (step t2425 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2417 t2424))
% 27.83/28.03  (step t2426 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t2414 t2425 a206))
% 27.83/28.03  (step t2427 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t2426))
% 27.83/28.03  (step t2428 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule reordering :premises (t2427))
% 27.83/28.03  (step t2429 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk8 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t2428 t2326 a194))
% 27.83/28.03  (step t2430 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t395 t2429))
% 27.83/28.03  (step t2431 (cl (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) :rule resolution :premises (t2 t17 t19 t2328 a192 a191 t370 t2345 a192 a191 t372 t2362 a192 a191 t374 t2379 a192 a191 t376 t2396 a192 a191 t378 t2413 a192 a191 t380 t2430 a192 a191))
% 27.83/28.03  (step t2432 (cl (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) :rule contraction :premises (t2431))
% 27.83/28.03  (step t2433 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.03  (step t2434 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2433))
% 27.83/28.03  (step t2435 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2436 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.03  (step t2437 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t744 t29))
% 27.83/28.03  (step t2438 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2439 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2437 t2438))
% 27.83/28.03  (step t2440 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2436 t2439))
% 27.83/28.03  (step t2441 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2442)
% 27.83/28.03  (assume t2442.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.03  (step t2442.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2442.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t2442.t1))
% 27.83/28.03  (step t2442.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2442.t2 t2442.a0))
% 27.83/28.03  (step t2442 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2442.a0))
% 27.83/28.03  (step t2443 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2441 t2442))
% 27.83/28.03  (step t2444 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2445 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2443 t2444))
% 27.83/28.03  (step t2446 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2445))
% 27.83/28.03  (step t2447 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2435 t2440 t2446))
% 27.83/28.03  (step t2448 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2447))
% 27.83/28.03  (step t2449 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2450 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2450.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2450.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2450.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2450.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2450.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2450.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2450.t5))
% 27.83/28.03  (step t2450.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2450.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2450.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2450.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2450.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2450.t3 t2450.t4 t2450.t6 t2450.t7 t2450.t8 t2450.t9 t2450.t10))
% 27.83/28.03  (step t2450 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2451 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2452 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2450 t2451))
% 27.83/28.03  (step t2453 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2454 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2453))
% 27.83/28.03  (step t2455 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2454))
% 27.83/28.03  (step t2456 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2457 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2456 t2453))
% 27.83/28.03  (anchor :step t2458 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2458.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2458.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2458.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2458.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2458.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2458.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2458.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2458.t5 t2458.t6))
% 27.83/28.03  (step t2458.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2458.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2458.t8 t2453))
% 27.83/28.03  (step t2458.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2458.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2458.t9 t2458.t10))
% 27.83/28.03  (step t2458.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2458.t7 t2458.t11))
% 27.83/28.03  (step t2458.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2458.t12))
% 27.83/28.03  (step t2458.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2458.t15 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2458.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t2458.t3 t2458.t4 t2458.t13 t2458.t14 t2458.t15))
% 27.83/28.03  (step t2458 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2459 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t2455 t2457 t2458))
% 27.83/28.03  (step t2460 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2452 t2459))
% 27.83/28.03  (step t2461 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t2449 t2460 a227))
% 27.83/28.03  (step t2462 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t2461))
% 27.83/28.03  (step t2463 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t2462))
% 27.83/28.03  (step t2464 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t2463 t2326 a194))
% 27.83/28.03  (step t2465 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2448 t2464))
% 27.83/28.03  (step t2466 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2467 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2467.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2467.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2467.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2467.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2467.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2467.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2467.t5))
% 27.83/28.03  (step t2467.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2467.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2467.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2467.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2467.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2467.t3 t2467.t4 t2467.t6 t2467.t7 t2467.t8 t2467.t9 t2467.t10))
% 27.83/28.03  (step t2467 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2468 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.03  (step t2469 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2467 t2468))
% 27.83/28.03  (step t2470 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2471 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2470))
% 27.83/28.03  (step t2472 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2471))
% 27.83/28.03  (step t2473 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2474 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2473 t2470))
% 27.83/28.03  (anchor :step t2475 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2475.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2475.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2475.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2475.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2475.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2475.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2475.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2475.t5 t2475.t6))
% 27.83/28.03  (step t2475.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2475.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2475.t8 t2470))
% 27.83/28.03  (step t2475.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2475.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2475.t9 t2475.t10))
% 27.83/28.03  (step t2475.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2475.t7 t2475.t11))
% 27.83/28.03  (step t2475.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2475.t12))
% 27.83/28.03  (step t2475.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2475.t15 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.03  (step t2475.t16 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t2470 t2475.t15))
% 27.83/28.03  (step t2475.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2475.t3 t2475.t4 t2475.t13 t2475.t14 t2475.t16))
% 27.83/28.03  (step t2475 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.03  (step t2476 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t2472 t2474 t2475))
% 27.83/28.03  (step t2477 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2469 t2476))
% 27.83/28.03  (step t2478 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t2466 t2477 a226))
% 27.83/28.03  (step t2479 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2478))
% 27.83/28.03  (step t2480 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t2479))
% 27.83/28.03  (step t2481 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t2480 t2326 a194))
% 27.83/28.03  (step t2482 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t858 t2481))
% 27.83/28.03  (step t2483 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2484 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2484.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2484.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2484.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2484.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2484.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2484.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2484.t5))
% 27.83/28.03  (step t2484.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2484.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2484.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2484.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2484.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2484.t3 t2484.t4 t2484.t6 t2484.t7 t2484.t8 t2484.t9 t2484.t10))
% 27.83/28.03  (step t2484 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2485 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2486 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2484 t2485))
% 27.83/28.03  (step t2487 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2488 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2487))
% 27.83/28.03  (step t2489 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2488))
% 27.83/28.03  (step t2490 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2491 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2490 t2487))
% 27.83/28.03  (anchor :step t2492 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2492.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2492.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2492.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2492.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2492.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2492.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2492.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2492.t5 t2492.t6))
% 27.83/28.03  (step t2492.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2492.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2492.t8 t2487))
% 27.83/28.03  (step t2492.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2492.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2492.t9 t2492.t10))
% 27.83/28.03  (step t2492.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2492.t7 t2492.t11))
% 27.83/28.03  (step t2492.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2492.t12))
% 27.83/28.03  (step t2492.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2492.t15 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2492.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2492.t3 t2492.t4 t2492.t13 t2492.t14 t2492.t15))
% 27.83/28.03  (step t2492 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.03  (step t2493 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2489 t2491 t2492))
% 27.83/28.03  (step t2494 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2486 t2493))
% 27.83/28.03  (step t2495 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2483 t2494 a225))
% 27.83/28.03  (step t2496 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t2495))
% 27.83/28.03  (step t2497 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t2496))
% 27.83/28.03  (step t2498 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t2497 t2326 a194))
% 27.83/28.03  (step t2499 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t824 t2498))
% 27.83/28.03  (step t2500 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.03  (step t2501 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2500))
% 27.83/28.03  (step t2502 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2503 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.03  (step t2504 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t744 t488))
% 27.83/28.03  (step t2505 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2506 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2504 t2505))
% 27.83/28.03  (step t2507 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2503 t2506))
% 27.83/28.03  (step t2508 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2509)
% 27.83/28.03  (assume t2509.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.03  (step t2509.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2509.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t2509.t1))
% 27.83/28.03  (step t2509.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2509.t2 t2509.a0))
% 27.83/28.03  (step t2509 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2509.a0))
% 27.83/28.03  (step t2510 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2508 t2509))
% 27.83/28.03  (step t2511 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2512 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2510 t2511))
% 27.83/28.03  (step t2513 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2512))
% 27.83/28.03  (step t2514 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2502 t2507 t2513))
% 27.83/28.03  (step t2515 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2514))
% 27.83/28.03  (step t2516 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2517 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2517.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2517.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2517.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2517.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2517.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2517.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2517.t5))
% 27.83/28.03  (step t2517.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2517.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2517.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2517.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2517.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2517.t3 t2517.t4 t2517.t6 t2517.t7 t2517.t8 t2517.t9 t2517.t10))
% 27.83/28.03  (step t2517 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2518 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2519 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2517 t2518))
% 27.83/28.03  (step t2520 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2521 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2520))
% 27.83/28.03  (step t2522 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2521))
% 27.83/28.03  (step t2523 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2524 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2523 t2520))
% 27.83/28.03  (anchor :step t2525 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2525.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2525.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2525.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2525.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2525.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2525.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2525.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2525.t5 t2525.t6))
% 27.83/28.03  (step t2525.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2525.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2525.t8 t2520))
% 27.83/28.03  (step t2525.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2525.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2525.t9 t2525.t10))
% 27.83/28.03  (step t2525.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2525.t7 t2525.t11))
% 27.83/28.03  (step t2525.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2525.t12))
% 27.83/28.03  (step t2525.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2525.t15 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2525.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t2525.t3 t2525.t4 t2525.t13 t2525.t14 t2525.t15))
% 27.83/28.03  (step t2525 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.03  (step t2526 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t2522 t2524 t2525))
% 27.83/28.03  (step t2527 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2519 t2526))
% 27.83/28.03  (step t2528 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t2516 t2527 a224))
% 27.83/28.03  (step t2529 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t2528))
% 27.83/28.03  (step t2530 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t2529))
% 27.83/28.03  (step t2531 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t2530 t2326 a194))
% 27.83/28.03  (step t2532 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2515 t2531))
% 27.83/28.03  (step t2533 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2534 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2534.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2534.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2534.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2534.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2534.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2534.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2534.t5))
% 27.83/28.03  (step t2534.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2534.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.03  (step t2534.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2534.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2534.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2534.t3 t2534.t4 t2534.t6 t2534.t7 t2534.t8 t2534.t9 t2534.t10))
% 27.83/28.03  (step t2534 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2535 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.03  (step t2536 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2534 t2535))
% 27.83/28.03  (step t2537 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2538 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2537))
% 27.83/28.03  (step t2539 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2538))
% 27.83/28.03  (step t2540 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2541 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2540 t2537))
% 27.83/28.03  (anchor :step t2542 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2542.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2542.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2542.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2542.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2542.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2542.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2542.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2542.t5 t2542.t6))
% 27.83/28.03  (step t2542.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2542.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2542.t8 t2537))
% 27.83/28.03  (step t2542.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2542.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2542.t9 t2542.t10))
% 27.83/28.03  (step t2542.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2542.t7 t2542.t11))
% 27.83/28.03  (step t2542.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2542.t12))
% 27.83/28.03  (step t2542.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2542.t15 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.03  (step t2542.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t2542.t3 t2542.t4 t2542.t13 t2542.t14 t2542.t15))
% 27.83/28.03  (step t2542 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.03  (step t2543 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t2539 t2541 t2542))
% 27.83/28.03  (step t2544 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2536 t2543))
% 27.83/28.03  (step t2545 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t2533 t2544 a223))
% 27.83/28.03  (step t2546 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t2545))
% 27.83/28.03  (step t2547 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t2546))
% 27.83/28.03  (step t2548 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t2547 t2326 a194))
% 27.83/28.03  (step t2549 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t790 t2548))
% 27.83/28.03  (step t2550 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2551 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2551.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2551.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2551.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2551.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2551.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2551.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2551.t5))
% 27.83/28.03  (step t2551.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2551.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2551.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2551.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2551.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2551.t3 t2551.t4 t2551.t6 t2551.t7 t2551.t8 t2551.t9 t2551.t10))
% 27.83/28.03  (step t2551 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2552 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2553 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2551 t2552))
% 27.83/28.03  (step t2554 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2555 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2554))
% 27.83/28.03  (step t2556 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2555))
% 27.83/28.03  (step t2557 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2558 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2557 t2554))
% 27.83/28.03  (anchor :step t2559 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2559.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2559.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2559.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2559.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2559.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2559.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2559.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2559.t5 t2559.t6))
% 27.83/28.03  (step t2559.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2559.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2559.t8 t2554))
% 27.83/28.03  (step t2559.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2559.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2559.t9 t2559.t10))
% 27.83/28.03  (step t2559.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2559.t7 t2559.t11))
% 27.83/28.03  (step t2559.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2559.t12))
% 27.83/28.03  (step t2559.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2559.t15 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2559.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t2559.t3 t2559.t4 t2559.t13 t2559.t14 t2559.t15))
% 27.83/28.03  (step t2559 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.03  (step t2560 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t2556 t2558 t2559))
% 27.83/28.03  (step t2561 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2553 t2560))
% 27.83/28.03  (step t2562 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t2550 t2561 a218))
% 27.83/28.03  (step t2563 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t2562))
% 27.83/28.03  (step t2564 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t2563))
% 27.83/28.03  (step t2565 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t2564 t2326 a194))
% 27.83/28.03  (step t2566 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t756 t2565))
% 27.83/28.03  (step t2567 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.03  (step t2568 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2567))
% 27.83/28.03  (step t2569 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2570 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.03  (step t2571 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t744 t383))
% 27.83/28.03  (step t2572 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2573 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2571 t2572))
% 27.83/28.03  (step t2574 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2570 t2573))
% 27.83/28.03  (step t2575 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2576)
% 27.83/28.03  (assume t2576.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.03  (step t2576.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2576.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t2576.t1))
% 27.83/28.03  (step t2576.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2576.t2 t2576.a0))
% 27.83/28.03  (step t2576 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2576.a0))
% 27.83/28.03  (step t2577 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2575 t2576))
% 27.83/28.03  (step t2578 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2579 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2577 t2578))
% 27.83/28.03  (step t2580 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2579))
% 27.83/28.03  (step t2581 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2569 t2574 t2580))
% 27.83/28.03  (step t2582 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2581))
% 27.83/28.03  (step t2583 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2584 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2584.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2584.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2584.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2584.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2584.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2584.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2584.t5))
% 27.83/28.03  (step t2584.t7 (cl (= (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2584.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2584.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2584.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2584.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2584.t3 t2584.t4 t2584.t6 t2584.t7 t2584.t8 t2584.t9 t2584.t10))
% 27.83/28.03  (step t2584 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2585 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2586 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2584 t2585))
% 27.83/28.03  (step t2587 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2588 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2587))
% 27.83/28.03  (step t2589 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2588))
% 27.83/28.03  (step t2590 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2591 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2590 t2587))
% 27.83/28.03  (anchor :step t2592 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2592.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2592.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2592.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2592.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2592.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2592.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2592.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2592.t5 t2592.t6))
% 27.83/28.03  (step t2592.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2592.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2592.t8 t2587))
% 27.83/28.03  (step t2592.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2592.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2592.t9 t2592.t10))
% 27.83/28.03  (step t2592.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2592.t7 t2592.t11))
% 27.83/28.03  (step t2592.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2592.t12))
% 27.83/28.03  (step t2592.t14 (cl (= (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))))) :rule refl)
% 27.83/28.03  (step t2592.t15 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2592.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t2592.t3 t2592.t4 t2592.t13 t2592.t14 t2592.t15))
% 27.83/28.03  (step t2592 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2593 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t2589 t2591 t2592))
% 27.83/28.03  (step t2594 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil)) A) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2586 t2593))
% 27.83/28.03  (step t2595 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t2583 t2594 a207))
% 27.83/28.03  (step t2596 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t2595))
% 27.83/28.03  (step t2597 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule reordering :premises (t2596))
% 27.83/28.03  (step t2598 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= A (tptp.app (tptp.sk8 B A) (tptp.cons (tptp.sk7 B A) tptp.nil))) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t2597 t2326 a194))
% 27.83/28.03  (step t2599 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2582 t2598))
% 27.83/28.03  (step t2600 (cl (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) :rule resolution :premises (t2 t17 t2434 t2465 a192 a191 t658 t2482 a192 a191 t660 t2499 a192 a191 t2501 t2532 a192 a191 t662 t2549 a192 a191 t664 t2566 a192 a191 t2568 t2599 a192 a191))
% 27.83/28.03  (step t2601 (cl (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) :rule contraction :premises (t2600))
% 27.83/28.03  (step t2602 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.03  (step t2603 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2602))
% 27.83/28.03  (step t2604 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2605 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.03  (step t2606 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1197 t29))
% 27.83/28.03  (step t2607 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2608 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2606 t2607))
% 27.83/28.03  (step t2609 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2605 t2608))
% 27.83/28.03  (step t2610 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2611)
% 27.83/28.03  (assume t2611.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.03  (step t2611.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2611.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t2611.t1))
% 27.83/28.03  (step t2611.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2611.t2 t2611.a0))
% 27.83/28.03  (step t2611 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2611.a0))
% 27.83/28.03  (step t2612 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2610 t2611))
% 27.83/28.03  (step t2613 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2614 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2612 t2613))
% 27.83/28.03  (step t2615 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2614))
% 27.83/28.03  (step t2616 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2604 t2609 t2615))
% 27.83/28.03  (step t2617 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2616))
% 27.83/28.03  (step t2618 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2619 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2619.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2619.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2619.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2619.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2619.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2619.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2619.t5))
% 27.83/28.03  (step t2619.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2619.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2619.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2619.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2619.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2619.t3 t2619.t4 t2619.t6 t2619.t7 t2619.t8 t2619.t9 t2619.t10))
% 27.83/28.03  (step t2619 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2620 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2621 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2619 t2620))
% 27.83/28.03  (step t2622 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2623 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2622))
% 27.83/28.03  (step t2624 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2623))
% 27.83/28.03  (step t2625 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2626 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2625 t2622))
% 27.83/28.03  (anchor :step t2627 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2627.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2627.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2627.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2627.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2627.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2627.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2627.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2627.t5 t2627.t6))
% 27.83/28.03  (step t2627.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2627.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2627.t8 t2622))
% 27.83/28.03  (step t2627.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2627.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2627.t9 t2627.t10))
% 27.83/28.03  (step t2627.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2627.t7 t2627.t11))
% 27.83/28.03  (step t2627.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2627.t12))
% 27.83/28.03  (step t2627.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2627.t15 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2627.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t2627.t3 t2627.t4 t2627.t13 t2627.t14 t2627.t15))
% 27.83/28.03  (step t2627 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2628 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t2624 t2626 t2627))
% 27.83/28.03  (step t2629 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2621 t2628))
% 27.83/28.03  (step t2630 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t2618 t2629 a235))
% 27.83/28.03  (step t2631 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t2630))
% 27.83/28.03  (step t2632 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t2631))
% 27.83/28.03  (step t2633 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t2632 t2326 a194))
% 27.83/28.03  (step t2634 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2617 t2633))
% 27.83/28.03  (step t2635 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.83/28.03  (step t2636 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t2635))
% 27.83/28.03  (step t2637 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.03  (step t2638 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.03  (step t2639 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t1197 t558))
% 27.83/28.03  (step t2640 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.03  (step t2641 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t2639 t2640))
% 27.83/28.03  (step t2642 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t2638 t2641))
% 27.83/28.03  (step t2643 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2644)
% 27.83/28.03  (assume t2644.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.03  (step t2644.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2644.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t2644.t1))
% 27.83/28.03  (step t2644.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t2644.t2 t2644.a0))
% 27.83/28.03  (step t2644 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t2644.a0))
% 27.83/28.03  (step t2645 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t2643 t2644))
% 27.83/28.03  (step t2646 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.03  (step t2647 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t2645 t2646))
% 27.83/28.03  (step t2648 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t2647))
% 27.83/28.03  (step t2649 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t2637 t2642 t2648))
% 27.83/28.03  (step t2650 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t2649))
% 27.83/28.03  (step t2651 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2652 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2652.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2652.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2652.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2652.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2652.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2652.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2652.t5))
% 27.83/28.03  (step t2652.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2652.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2652.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2652.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2652.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2652.t3 t2652.t4 t2652.t6 t2652.t7 t2652.t8 t2652.t9 t2652.t10))
% 27.83/28.03  (step t2652 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2653 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.03  (step t2654 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2652 t2653))
% 27.83/28.03  (step t2655 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2656 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2655))
% 27.83/28.03  (step t2657 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2656))
% 27.83/28.03  (step t2658 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2659 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2658 t2655))
% 27.83/28.03  (anchor :step t2660 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2660.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2660.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2660.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2660.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2660.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2660.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2660.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2660.t5 t2660.t6))
% 27.83/28.03  (step t2660.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2660.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2660.t8 t2655))
% 27.83/28.03  (step t2660.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2660.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2660.t9 t2660.t10))
% 27.83/28.03  (step t2660.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2660.t7 t2660.t11))
% 27.83/28.03  (step t2660.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2660.t12))
% 27.83/28.03  (step t2660.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2660.t15 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.03  (step t2660.t16 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t2655 t2660.t15))
% 27.83/28.03  (step t2660.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2660.t3 t2660.t4 t2660.t13 t2660.t14 t2660.t16))
% 27.83/28.03  (step t2660 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.03  (step t2661 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t2657 t2659 t2660))
% 27.83/28.03  (step t2662 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2654 t2661))
% 27.83/28.03  (step t2663 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t2651 t2662 a234))
% 27.83/28.03  (step t2664 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2663))
% 27.83/28.03  (step t2665 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t2664))
% 27.83/28.03  (step t2666 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t2665 t2326 a194))
% 27.83/28.03  (step t2667 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t2650 t2666))
% 27.83/28.03  (step t2668 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2669 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2669.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2669.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2669.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2669.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2669.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2669.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2669.t5))
% 27.83/28.03  (step t2669.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2669.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2669.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2669.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2669.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2669.t3 t2669.t4 t2669.t6 t2669.t7 t2669.t8 t2669.t9 t2669.t10))
% 27.83/28.03  (step t2669 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2670 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2671 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2669 t2670))
% 27.83/28.03  (step t2672 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2673 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2672))
% 27.83/28.03  (step t2674 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2673))
% 27.83/28.03  (step t2675 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2676 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2675 t2672))
% 27.83/28.03  (anchor :step t2677 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2677.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2677.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2677.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2677.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2677.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2677.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2677.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2677.t5 t2677.t6))
% 27.83/28.03  (step t2677.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2677.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2677.t8 t2672))
% 27.83/28.03  (step t2677.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2677.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2677.t9 t2677.t10))
% 27.83/28.03  (step t2677.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2677.t7 t2677.t11))
% 27.83/28.03  (step t2677.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2677.t12))
% 27.83/28.03  (step t2677.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2677.t15 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2677.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2677.t3 t2677.t4 t2677.t13 t2677.t14 t2677.t15))
% 27.83/28.03  (step t2677 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.03  (step t2678 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2674 t2676 t2677))
% 27.83/28.03  (step t2679 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2671 t2678))
% 27.83/28.03  (step t2680 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2668 t2679 a233))
% 27.83/28.03  (step t2681 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t2680))
% 27.83/28.03  (step t2682 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t2681))
% 27.83/28.03  (step t2683 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t2682 t2326 a194))
% 27.83/28.03  (step t2684 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1243 t2683))
% 27.83/28.03  (step t2685 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.03  (step t2686 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2685))
% 27.83/28.03  (step t2687 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2688 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.03  (step t2689 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1197 t488))
% 27.83/28.03  (step t2690 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2691 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2689 t2690))
% 27.83/28.03  (step t2692 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2688 t2691))
% 27.83/28.03  (step t2693 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2694)
% 27.83/28.03  (assume t2694.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.03  (step t2694.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2694.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t2694.t1))
% 27.83/28.03  (step t2694.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2694.t2 t2694.a0))
% 27.83/28.03  (step t2694 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2694.a0))
% 27.83/28.03  (step t2695 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2693 t2694))
% 27.83/28.03  (step t2696 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2697 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2695 t2696))
% 27.83/28.03  (step t2698 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2697))
% 27.83/28.03  (step t2699 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2687 t2692 t2698))
% 27.83/28.03  (step t2700 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2699))
% 27.83/28.03  (step t2701 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2702 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2702.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2702.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2702.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2702.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2702.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2702.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2702.t5))
% 27.83/28.03  (step t2702.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2702.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2702.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2702.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2702.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2702.t3 t2702.t4 t2702.t6 t2702.t7 t2702.t8 t2702.t9 t2702.t10))
% 27.83/28.03  (step t2702 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2703 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2704 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2702 t2703))
% 27.83/28.03  (step t2705 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2706 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2705))
% 27.83/28.03  (step t2707 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2706))
% 27.83/28.03  (step t2708 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2709 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2708 t2705))
% 27.83/28.03  (anchor :step t2710 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2710.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2710.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2710.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2710.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2710.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2710.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2710.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2710.t5 t2710.t6))
% 27.83/28.03  (step t2710.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2710.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2710.t8 t2705))
% 27.83/28.03  (step t2710.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2710.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2710.t9 t2710.t10))
% 27.83/28.03  (step t2710.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2710.t7 t2710.t11))
% 27.83/28.03  (step t2710.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2710.t12))
% 27.83/28.03  (step t2710.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2710.t15 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2710.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t2710.t3 t2710.t4 t2710.t13 t2710.t14 t2710.t15))
% 27.83/28.03  (step t2710 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.03  (step t2711 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t2707 t2709 t2710))
% 27.83/28.03  (step t2712 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2704 t2711))
% 27.83/28.03  (step t2713 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t2701 t2712 a232))
% 27.83/28.03  (step t2714 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t2713))
% 27.83/28.03  (step t2715 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t2714))
% 27.83/28.03  (step t2716 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t2715 t2326 a194))
% 27.83/28.03  (step t2717 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2700 t2716))
% 27.83/28.03  (step t2718 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.83/28.03  (step t2719 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t2718))
% 27.83/28.03  (step t2720 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.03  (step t2721 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.03  (step t2722 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t1197 t453))
% 27.83/28.03  (step t2723 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.03  (step t2724 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t2722 t2723))
% 27.83/28.03  (step t2725 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t2721 t2724))
% 27.83/28.03  (step t2726 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2727)
% 27.83/28.03  (assume t2727.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.03  (step t2727.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2727.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t2727.t1))
% 27.83/28.03  (step t2727.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2727.t2 t2727.a0))
% 27.83/28.03  (step t2727 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t2727.a0))
% 27.83/28.03  (step t2728 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2726 t2727))
% 27.83/28.03  (step t2729 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.03  (step t2730 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t2728 t2729))
% 27.83/28.03  (step t2731 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t2730))
% 27.83/28.03  (step t2732 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t2720 t2725 t2731))
% 27.83/28.03  (step t2733 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t2732))
% 27.83/28.03  (step t2734 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2735 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2735.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2735.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2735.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2735.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2735.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2735.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2735.t5))
% 27.83/28.03  (step t2735.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2735.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.03  (step t2735.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2735.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2735.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2735.t3 t2735.t4 t2735.t6 t2735.t7 t2735.t8 t2735.t9 t2735.t10))
% 27.83/28.03  (step t2735 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2736 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.03  (step t2737 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2735 t2736))
% 27.83/28.03  (step t2738 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2739 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2738))
% 27.83/28.03  (step t2740 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2739))
% 27.83/28.03  (step t2741 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2742 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2741 t2738))
% 27.83/28.03  (anchor :step t2743 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2743.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2743.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2743.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2743.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2743.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2743.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2743.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2743.t5 t2743.t6))
% 27.83/28.03  (step t2743.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2743.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2743.t8 t2738))
% 27.83/28.03  (step t2743.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2743.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2743.t9 t2743.t10))
% 27.83/28.03  (step t2743.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2743.t7 t2743.t11))
% 27.83/28.03  (step t2743.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2743.t12))
% 27.83/28.03  (step t2743.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2743.t15 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.03  (step t2743.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t2743.t3 t2743.t4 t2743.t13 t2743.t14 t2743.t15))
% 27.83/28.03  (step t2743 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.03  (step t2744 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t2740 t2742 t2743))
% 27.83/28.03  (step t2745 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2737 t2744))
% 27.83/28.03  (step t2746 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t2734 t2745 a228))
% 27.83/28.03  (step t2747 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t2746))
% 27.83/28.03  (step t2748 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t2747))
% 27.83/28.03  (step t2749 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t2748 t2326 a194))
% 27.83/28.03  (step t2750 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2733 t2749))
% 27.83/28.03  (step t2751 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2752 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2752.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2752.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2752.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2752.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2752.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2752.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2752.t5))
% 27.83/28.03  (step t2752.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2752.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2752.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2752.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2752.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2752.t3 t2752.t4 t2752.t6 t2752.t7 t2752.t8 t2752.t9 t2752.t10))
% 27.83/28.03  (step t2752 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2753 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2754 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2752 t2753))
% 27.83/28.03  (step t2755 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2756 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2755))
% 27.83/28.03  (step t2757 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2756))
% 27.83/28.03  (step t2758 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2759 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2758 t2755))
% 27.83/28.03  (anchor :step t2760 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2760.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2760.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2760.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2760.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2760.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2760.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2760.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2760.t5 t2760.t6))
% 27.83/28.03  (step t2760.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2760.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2760.t8 t2755))
% 27.83/28.03  (step t2760.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2760.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2760.t9 t2760.t10))
% 27.83/28.03  (step t2760.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2760.t7 t2760.t11))
% 27.83/28.03  (step t2760.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2760.t12))
% 27.83/28.03  (step t2760.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2760.t15 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.03  (step t2760.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t2760.t3 t2760.t4 t2760.t13 t2760.t14 t2760.t15))
% 27.83/28.03  (step t2760 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.03  (step t2761 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t2757 t2759 t2760))
% 27.83/28.03  (step t2762 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2754 t2761))
% 27.83/28.03  (step t2763 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t2751 t2762 a219))
% 27.83/28.03  (step t2764 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t2763))
% 27.83/28.03  (step t2765 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t2764))
% 27.83/28.03  (step t2766 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t2765 t2326 a194))
% 27.83/28.03  (step t2767 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1209 t2766))
% 27.83/28.03  (step t2768 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.03  (step t2769 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2768))
% 27.83/28.03  (step t2770 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.03  (step t2771 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.03  (step t2772 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1197 t383))
% 27.83/28.03  (step t2773 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.03  (step t2774 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2772 t2773))
% 27.83/28.03  (step t2775 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2771 t2774))
% 27.83/28.03  (step t2776 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.03  (anchor :step t2777)
% 27.83/28.03  (assume t2777.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.03  (step t2777.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.03  (step t2777.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t2777.t1))
% 27.83/28.03  (step t2777.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2777.t2 t2777.a0))
% 27.83/28.03  (step t2777 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2777.a0))
% 27.83/28.03  (step t2778 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2776 t2777))
% 27.83/28.03  (step t2779 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.03  (step t2780 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2778 t2779))
% 27.83/28.03  (step t2781 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2780))
% 27.83/28.03  (step t2782 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2770 t2775 t2781))
% 27.83/28.03  (step t2783 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2782))
% 27.83/28.03  (step t2784 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2785 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2785.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2785.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2785.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2785.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2785.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2785.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2785.t5))
% 27.83/28.03  (step t2785.t7 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2785.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2785.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2785.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2785.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2785.t3 t2785.t4 t2785.t6 t2785.t7 t2785.t8 t2785.t9 t2785.t10))
% 27.83/28.03  (step t2785 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2786 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2787 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2785 t2786))
% 27.83/28.03  (step t2788 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2789 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2788))
% 27.83/28.03  (step t2790 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2789))
% 27.83/28.03  (step t2791 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2792 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2791 t2788))
% 27.83/28.03  (anchor :step t2793 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2793.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2793.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2793.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2793.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2793.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2793.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2793.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2793.t5 t2793.t6))
% 27.83/28.03  (step t2793.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2793.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2793.t8 t2788))
% 27.83/28.03  (step t2793.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2793.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2793.t9 t2793.t10))
% 27.83/28.03  (step t2793.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2793.t7 t2793.t11))
% 27.83/28.03  (step t2793.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2793.t12))
% 27.83/28.03  (step t2793.t14 (cl (= (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk9 B A)))) :rule refl)
% 27.83/28.03  (step t2793.t15 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2793.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t2793.t3 t2793.t4 t2793.t13 t2793.t14 t2793.t15))
% 27.83/28.03  (step t2793 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2794 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t2790 t2792 t2793))
% 27.83/28.03  (step t2795 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2787 t2794))
% 27.83/28.03  (step t2796 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t2784 t2795 a208))
% 27.83/28.03  (step t2797 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t2796))
% 27.83/28.03  (step t2798 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule reordering :premises (t2797))
% 27.83/28.03  (step t2799 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t2798 t2326 a194))
% 27.83/28.03  (step t2800 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2783 t2799))
% 27.83/28.03  (step t2801 (cl (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) :rule resolution :premises (t2 t17 t2603 t2634 a192 a191 t2636 t2667 a192 a191 t991 t2684 a192 a191 t2686 t2717 a192 a191 t2719 t2750 a192 a191 t993 t2767 a192 a191 t2769 t2800 a192 a191))
% 27.83/28.03  (step t2802 (cl (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) :rule contraction :premises (t2801))
% 27.83/28.03  (step t2803 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2804 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2804.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2804.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2804.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2804.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2804.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2804.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2804.t5))
% 27.83/28.03  (step t2804.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2804.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2804.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2804.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2804.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2804.t3 t2804.t4 t2804.t6 t2804.t7 t2804.t8 t2804.t9 t2804.t10))
% 27.83/28.03  (step t2804 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2805 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2806 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2804 t2805))
% 27.83/28.03  (step t2807 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2808 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2807))
% 27.83/28.03  (step t2809 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2808))
% 27.83/28.03  (step t2810 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2811 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2810 t2807))
% 27.83/28.03  (anchor :step t2812 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2812.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2812.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2812.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2812.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2812.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2812.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2812.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2812.t5 t2812.t6))
% 27.83/28.03  (step t2812.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2812.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2812.t8 t2807))
% 27.83/28.03  (step t2812.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2812.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2812.t9 t2812.t10))
% 27.83/28.03  (step t2812.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2812.t7 t2812.t11))
% 27.83/28.03  (step t2812.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2812.t12))
% 27.83/28.03  (step t2812.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2812.t15 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.03  (step t2812.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t2812.t3 t2812.t4 t2812.t13 t2812.t14 t2812.t15))
% 27.83/28.03  (step t2812 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.03  (step t2813 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t2809 t2811 t2812))
% 27.83/28.03  (step t2814 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2806 t2813))
% 27.83/28.03  (step t2815 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t2803 t2814 a241))
% 27.83/28.03  (step t2816 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t2815))
% 27.83/28.03  (step t2817 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t2816))
% 27.83/28.03  (step t2818 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t2817 t2326 a194))
% 27.83/28.03  (step t2819 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1499 t2818))
% 27.83/28.03  (step t2820 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2821 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2821.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2821.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2821.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2821.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2821.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2821.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2821.t5))
% 27.83/28.03  (step t2821.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2821.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.03  (step t2821.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2821.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2821.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2821.t3 t2821.t4 t2821.t6 t2821.t7 t2821.t8 t2821.t9 t2821.t10))
% 27.83/28.03  (step t2821 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2822 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.03  (step t2823 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2821 t2822))
% 27.83/28.03  (step t2824 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2825 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2824))
% 27.83/28.03  (step t2826 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2825))
% 27.83/28.03  (step t2827 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2828 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2827 t2824))
% 27.83/28.03  (anchor :step t2829 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2829.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2829.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2829.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2829.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2829.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2829.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2829.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2829.t5 t2829.t6))
% 27.83/28.03  (step t2829.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2829.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2829.t8 t2824))
% 27.83/28.03  (step t2829.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2829.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2829.t9 t2829.t10))
% 27.83/28.03  (step t2829.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2829.t7 t2829.t11))
% 27.83/28.03  (step t2829.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2829.t12))
% 27.83/28.03  (step t2829.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2829.t15 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.03  (step t2829.t16 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t2824 t2829.t15))
% 27.83/28.03  (step t2829.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2829.t3 t2829.t4 t2829.t13 t2829.t14 t2829.t16))
% 27.83/28.03  (step t2829 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.03  (step t2830 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t2826 t2828 t2829))
% 27.83/28.03  (step t2831 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2823 t2830))
% 27.83/28.03  (step t2832 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t2820 t2831 a240))
% 27.83/28.03  (step t2833 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2832))
% 27.83/28.03  (step t2834 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t2833))
% 27.83/28.03  (step t2835 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t2834 t2326 a194))
% 27.83/28.03  (step t2836 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t1465 t2835))
% 27.83/28.03  (step t2837 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2838 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2838.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2838.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2838.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2838.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2838.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2838.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2838.t5))
% 27.83/28.03  (step t2838.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2838.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2838.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2838.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2838.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2838.t3 t2838.t4 t2838.t6 t2838.t7 t2838.t8 t2838.t9 t2838.t10))
% 27.83/28.03  (step t2838 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2839 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2840 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2838 t2839))
% 27.83/28.03  (step t2841 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2842 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2841))
% 27.83/28.03  (step t2843 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2842))
% 27.83/28.03  (step t2844 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2845 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2844 t2841))
% 27.83/28.03  (anchor :step t2846 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2846.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2846.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2846.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2846.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2846.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2846.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2846.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2846.t5 t2846.t6))
% 27.83/28.03  (step t2846.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2846.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2846.t8 t2841))
% 27.83/28.03  (step t2846.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2846.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2846.t9 t2846.t10))
% 27.83/28.03  (step t2846.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2846.t7 t2846.t11))
% 27.83/28.03  (step t2846.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2846.t12))
% 27.83/28.03  (step t2846.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2846.t15 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.03  (step t2846.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2846.t3 t2846.t4 t2846.t13 t2846.t14 t2846.t15))
% 27.83/28.03  (step t2846 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.03  (step t2847 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2843 t2845 t2846))
% 27.83/28.03  (step t2848 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2840 t2847))
% 27.83/28.03  (step t2849 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2837 t2848 a239))
% 27.83/28.03  (step t2850 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t2849))
% 27.83/28.03  (step t2851 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t2850))
% 27.83/28.03  (step t2852 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t2851 t2326 a194))
% 27.83/28.03  (step t2853 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1431 t2852))
% 27.83/28.03  (step t2854 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2855 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2855.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2855.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2855.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2855.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2855.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2855.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2855.t5))
% 27.83/28.03  (step t2855.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2855.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2855.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2855.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2855.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2855.t3 t2855.t4 t2855.t6 t2855.t7 t2855.t8 t2855.t9 t2855.t10))
% 27.83/28.03  (step t2855 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2856 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.03  (step t2857 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2855 t2856))
% 27.83/28.03  (step t2858 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2859 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2858))
% 27.83/28.03  (step t2860 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2859))
% 27.83/28.03  (step t2861 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2862 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2861 t2858))
% 27.83/28.03  (anchor :step t2863 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2863.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2863.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2863.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2863.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2863.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.03  (step t2863.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.03  (step t2863.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2863.t5 t2863.t6))
% 27.83/28.03  (step t2863.t8 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2863.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2863.t8 t2858))
% 27.83/28.03  (step t2863.t10 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2863.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2863.t9 t2863.t10))
% 27.83/28.03  (step t2863.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2863.t7 t2863.t11))
% 27.83/28.03  (step t2863.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2863.t12))
% 27.83/28.03  (step t2863.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2863.t15 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.03  (step t2863.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t2863.t3 t2863.t4 t2863.t13 t2863.t14 t2863.t15))
% 27.83/28.03  (step t2863 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.03  (step t2864 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t2860 t2862 t2863))
% 27.83/28.03  (step t2865 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t2857 t2864))
% 27.83/28.03  (step t2866 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t2854 t2865 a236))
% 27.83/28.03  (step t2867 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t2866))
% 27.83/28.03  (step t2868 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t2867))
% 27.83/28.03  (step t2869 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t2868 t2326 a194))
% 27.83/28.03  (step t2870 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1397 t2869))
% 27.83/28.03  (step t2871 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.03  (anchor :step t2872 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2872.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2872.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2872.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2872.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2872.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.03  (step t2872.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2872.t5))
% 27.83/28.03  (step t2872.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.03  (step t2872.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.03  (step t2872.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.03  (step t2872.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.03  (step t2872.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2872.t3 t2872.t4 t2872.t6 t2872.t7 t2872.t8 t2872.t9 t2872.t10))
% 27.83/28.03  (step t2872 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.03  (step t2873 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.03  (step t2874 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2872 t2873))
% 27.83/28.03  (step t2875 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.03  (step t2876 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2875))
% 27.83/28.03  (step t2877 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2876))
% 27.83/28.03  (step t2878 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.03  (step t2879 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2878 t2875))
% 27.83/28.03  (anchor :step t2880 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.03  (step t2880.t1 (cl (= A A)) :rule refl)
% 27.83/28.03  (step t2880.t2 (cl (= B B)) :rule refl)
% 27.83/28.03  (step t2880.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.03  (step t2880.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.03  (step t2880.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t2880.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t2880.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2880.t5 t2880.t6))
% 27.83/28.04  (step t2880.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2880.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2880.t8 t2875))
% 27.83/28.04  (step t2880.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2880.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2880.t9 t2880.t10))
% 27.83/28.04  (step t2880.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2880.t7 t2880.t11))
% 27.83/28.04  (step t2880.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2880.t12))
% 27.83/28.04  (step t2880.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2880.t15 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.04  (step t2880.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t2880.t3 t2880.t4 t2880.t13 t2880.t14 t2880.t15))
% 27.83/28.04  (step t2880 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.04  (step t2881 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t2877 t2879 t2880))
% 27.83/28.04  (step t2882 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t2874 t2881))
% 27.83/28.04  (step t2883 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t2871 t2882 a229))
% 27.83/28.04  (step t2884 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t2883))
% 27.83/28.04  (step t2885 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t2884))
% 27.83/28.04  (step t2886 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t2885 t2326 a194))
% 27.83/28.04  (step t2887 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t1363 t2886))
% 27.83/28.04  (step t2888 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t2889 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2889.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2889.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2889.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2889.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2889.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t2889.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2889.t5))
% 27.83/28.04  (step t2889.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2889.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t2889.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t2889.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t2889.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2889.t3 t2889.t4 t2889.t6 t2889.t7 t2889.t8 t2889.t9 t2889.t10))
% 27.83/28.04  (step t2889 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t2890 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t2891 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2889 t2890))
% 27.83/28.04  (step t2892 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t2893 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2892))
% 27.83/28.04  (step t2894 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2893))
% 27.83/28.04  (step t2895 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t2896 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2895 t2892))
% 27.83/28.04  (anchor :step t2897 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2897.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2897.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2897.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2897.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2897.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t2897.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t2897.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2897.t5 t2897.t6))
% 27.83/28.04  (step t2897.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2897.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2897.t8 t2892))
% 27.83/28.04  (step t2897.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2897.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2897.t9 t2897.t10))
% 27.83/28.04  (step t2897.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2897.t7 t2897.t11))
% 27.83/28.04  (step t2897.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2897.t12))
% 27.83/28.04  (step t2897.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2897.t15 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t2897.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t2897.t3 t2897.t4 t2897.t13 t2897.t14 t2897.t15))
% 27.83/28.04  (step t2897 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.04  (step t2898 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t2894 t2896 t2897))
% 27.83/28.04  (step t2899 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t2891 t2898))
% 27.83/28.04  (step t2900 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t2888 t2899 a220))
% 27.83/28.04  (step t2901 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t2900))
% 27.83/28.04  (step t2902 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t2901))
% 27.83/28.04  (step t2903 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t2902 t2326 a194))
% 27.83/28.04  (step t2904 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1329 t2903))
% 27.83/28.04  (step t2905 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t2906 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2906.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2906.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2906.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2906.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2906.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t2906.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2906.t5))
% 27.83/28.04  (step t2906.t7 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2906.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t2906.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t2906.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t2906.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2906.t3 t2906.t4 t2906.t6 t2906.t7 t2906.t8 t2906.t9 t2906.t10))
% 27.83/28.04  (step t2906 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t2907 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t2908 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2906 t2907))
% 27.83/28.04  (step t2909 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t2910 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2909))
% 27.83/28.04  (step t2911 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2910))
% 27.83/28.04  (step t2912 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t2913 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2912 t2909))
% 27.83/28.04  (anchor :step t2914 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2914.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2914.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2914.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2914.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2914.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t2914.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t2914.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2914.t5 t2914.t6))
% 27.83/28.04  (step t2914.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2914.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2914.t8 t2909))
% 27.83/28.04  (step t2914.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2914.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2914.t9 t2914.t10))
% 27.83/28.04  (step t2914.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2914.t7 t2914.t11))
% 27.83/28.04  (step t2914.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2914.t12))
% 27.83/28.04  (step t2914.t14 (cl (= (tptp.ssList (tptp.sk10 B A)) (tptp.ssList (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2914.t15 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t2914.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t2914.t3 t2914.t4 t2914.t13 t2914.t14 t2914.t15))
% 27.83/28.04  (step t2914 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t2915 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t2911 t2913 t2914))
% 27.83/28.04  (step t2916 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t2908 t2915))
% 27.83/28.04  (step t2917 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t2905 t2916 a209))
% 27.83/28.04  (step t2918 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t2917))
% 27.83/28.04  (step t2919 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule reordering :premises (t2918))
% 27.83/28.04  (step t2920 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssList (tptp.sk10 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t2919 t2326 a194))
% 27.83/28.04  (step t2921 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1295 t2920))
% 27.83/28.04  (step t2922 (cl (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) :rule resolution :premises (t2 t17 t1268 t2819 a192 a191 t1270 t2836 a192 a191 t1272 t2853 a192 a191 t1274 t2870 a192 a191 t1276 t2887 a192 a191 t1278 t2904 a192 a191 t1280 t2921 a192 a191))
% 27.83/28.04  (step t2923 (cl (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) :rule contraction :premises (t2922))
% 27.83/28.04  (step t2924 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t2925 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t2924))
% 27.83/28.04  (step t2926 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t2927 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.04  (step t2928 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1760 t29))
% 27.83/28.04  (step t2929 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t2930 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t2928 t2929))
% 27.83/28.04  (step t2931 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t2927 t2930))
% 27.83/28.04  (step t2932 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t2933)
% 27.83/28.04  (assume t2933.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.04  (step t2933.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t2933.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t2933.t1))
% 27.83/28.04  (step t2933.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2933.t2 t2933.a0))
% 27.83/28.04  (step t2933 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t2933.a0))
% 27.83/28.04  (step t2934 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2932 t2933))
% 27.83/28.04  (step t2935 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t2936 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2934 t2935))
% 27.83/28.04  (step t2937 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t2936))
% 27.83/28.04  (step t2938 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t2926 t2931 t2937))
% 27.83/28.04  (step t2939 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t2938))
% 27.83/28.04  (step t2940 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t2941 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2941.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2941.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2941.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2941.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2941.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t2941.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2941.t5))
% 27.83/28.04  (step t2941.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t2941.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t2941.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t2941.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t2941.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2941.t3 t2941.t4 t2941.t6 t2941.t7 t2941.t8 t2941.t9 t2941.t10))
% 27.83/28.04  (step t2941 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t2942 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t2943 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2941 t2942))
% 27.83/28.04  (step t2944 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t2945 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2944))
% 27.83/28.04  (step t2946 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2945))
% 27.83/28.04  (step t2947 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t2948 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2947 t2944))
% 27.83/28.04  (anchor :step t2949 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2949.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2949.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2949.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2949.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2949.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t2949.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t2949.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2949.t5 t2949.t6))
% 27.83/28.04  (step t2949.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2949.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2949.t8 t2944))
% 27.83/28.04  (step t2949.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2949.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2949.t9 t2949.t10))
% 27.83/28.04  (step t2949.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2949.t7 t2949.t11))
% 27.83/28.04  (step t2949.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2949.t12))
% 27.83/28.04  (step t2949.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2949.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t2944 t2949.t14))
% 27.83/28.04  (step t2949.t16 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t2949.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t2949.t3 t2949.t4 t2949.t13 t2949.t15 t2949.t16))
% 27.83/28.04  (step t2949 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t2950 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t2946 t2948 t2949))
% 27.83/28.04  (step t2951 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t2943 t2950))
% 27.83/28.04  (step t2952 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t2940 t2951 a245))
% 27.83/28.04  (step t2953 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t2952))
% 27.83/28.04  (step t2954 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t2953))
% 27.83/28.04  (step t2955 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t2954 t2326 a194))
% 27.83/28.04  (step t2956 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2939 t2955))
% 27.83/28.04  (step t2957 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.83/28.04  (step t2958 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t2957))
% 27.83/28.04  (step t2959 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.04  (step t2960 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.04  (step t2961 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t1760 t558))
% 27.83/28.04  (step t2962 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.04  (step t2963 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t2961 t2962))
% 27.83/28.04  (step t2964 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t2960 t2963))
% 27.83/28.04  (step t2965 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t2966)
% 27.83/28.04  (assume t2966.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.04  (step t2966.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t2966.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t2966.t1))
% 27.83/28.04  (step t2966.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t2966.t2 t2966.a0))
% 27.83/28.04  (step t2966 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t2966.a0))
% 27.83/28.04  (step t2967 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t2965 t2966))
% 27.83/28.04  (step t2968 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.04  (step t2969 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t2967 t2968))
% 27.83/28.04  (step t2970 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t2969))
% 27.83/28.04  (step t2971 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t2959 t2964 t2970))
% 27.83/28.04  (step t2972 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t2971))
% 27.83/28.04  (step t2973 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t2974 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2974.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2974.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2974.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2974.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2974.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t2974.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2974.t5))
% 27.83/28.04  (step t2974.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t2974.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.04  (step t2974.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t2974.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t2974.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2974.t3 t2974.t4 t2974.t6 t2974.t7 t2974.t8 t2974.t9 t2974.t10))
% 27.83/28.04  (step t2974 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t2975 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.04  (step t2976 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2974 t2975))
% 27.83/28.04  (step t2977 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t2978 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2977))
% 27.83/28.04  (step t2979 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2978))
% 27.83/28.04  (step t2980 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t2981 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2980 t2977))
% 27.83/28.04  (anchor :step t2982 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2982.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2982.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2982.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2982.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2982.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t2982.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t2982.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2982.t5 t2982.t6))
% 27.83/28.04  (step t2982.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2982.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2982.t8 t2977))
% 27.83/28.04  (step t2982.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2982.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2982.t9 t2982.t10))
% 27.83/28.04  (step t2982.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2982.t7 t2982.t11))
% 27.83/28.04  (step t2982.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2982.t12))
% 27.83/28.04  (step t2982.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2982.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t2977 t2982.t14))
% 27.83/28.04  (step t2982.t16 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.04  (step t2982.t17 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t2977 t2982.t16))
% 27.83/28.04  (step t2982.t18 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t2982.t3 t2982.t4 t2982.t13 t2982.t15 t2982.t17))
% 27.83/28.04  (step t2982 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.04  (step t2983 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t2979 t2981 t2982))
% 27.83/28.04  (step t2984 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t2976 t2983))
% 27.83/28.04  (step t2985 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t2973 t2984 a244))
% 27.83/28.04  (step t2986 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t2985))
% 27.83/28.04  (step t2987 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t2986))
% 27.83/28.04  (step t2988 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t2987 t2326 a194))
% 27.83/28.04  (step t2989 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t2972 t2988))
% 27.83/28.04  (step t2990 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t2991 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2991.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2991.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2991.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2991.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2991.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t2991.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t2991.t5))
% 27.83/28.04  (step t2991.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t2991.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.04  (step t2991.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t2991.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t2991.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t2991.t3 t2991.t4 t2991.t6 t2991.t7 t2991.t8 t2991.t9 t2991.t10))
% 27.83/28.04  (step t2991 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t2992 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t2993 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2991 t2992))
% 27.83/28.04  (step t2994 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t2995 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t2994))
% 27.83/28.04  (step t2996 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t2995))
% 27.83/28.04  (step t2997 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t2998 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t2997 t2994))
% 27.83/28.04  (anchor :step t2999 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t2999.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2999.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2999.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t2999.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t2999.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t2999.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t2999.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t2999.t5 t2999.t6))
% 27.83/28.04  (step t2999.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t2999.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t2999.t8 t2994))
% 27.83/28.04  (step t2999.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t2999.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t2999.t9 t2999.t10))
% 27.83/28.04  (step t2999.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t2999.t7 t2999.t11))
% 27.83/28.04  (step t2999.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t2999.t12))
% 27.83/28.04  (step t2999.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t2999.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t2994 t2999.t14))
% 27.83/28.04  (step t2999.t16 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.04  (step t2999.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t2999.t3 t2999.t4 t2999.t13 t2999.t15 t2999.t16))
% 27.83/28.04  (step t2999 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.04  (step t3000 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t2996 t2998 t2999))
% 27.83/28.04  (step t3001 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t2993 t3000))
% 27.83/28.04  (step t3002 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t2990 t3001 a242))
% 27.83/28.04  (step t3003 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t3002))
% 27.83/28.04  (step t3004 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t3003))
% 27.83/28.04  (step t3005 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t3004 t2326 a194))
% 27.83/28.04  (step t3006 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1806 t3005))
% 27.83/28.04  (step t3007 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3008 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3007))
% 27.83/28.04  (step t3009 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3010 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.04  (step t3011 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1760 t488))
% 27.83/28.04  (step t3012 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3013 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3011 t3012))
% 27.83/28.04  (step t3014 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3010 t3013))
% 27.83/28.04  (step t3015 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3016)
% 27.83/28.04  (assume t3016.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.04  (step t3016.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3016.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t3016.t1))
% 27.83/28.04  (step t3016.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3016.t2 t3016.a0))
% 27.83/28.04  (step t3016 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3016.a0))
% 27.83/28.04  (step t3017 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3015 t3016))
% 27.83/28.04  (step t3018 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3019 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3017 t3018))
% 27.83/28.04  (step t3020 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3019))
% 27.83/28.04  (step t3021 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3009 t3014 t3020))
% 27.83/28.04  (step t3022 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3021))
% 27.83/28.04  (step t3023 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3024 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3024.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3024.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3024.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3024.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3024.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3024.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3024.t5))
% 27.83/28.04  (step t3024.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3024.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.04  (step t3024.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3024.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3024.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3024.t3 t3024.t4 t3024.t6 t3024.t7 t3024.t8 t3024.t9 t3024.t10))
% 27.83/28.04  (step t3024 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3025 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3026 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t3024 t3025))
% 27.83/28.04  (step t3027 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3028 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3027))
% 27.83/28.04  (step t3029 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3028))
% 27.83/28.04  (step t3030 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3031 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3030 t3027))
% 27.83/28.04  (anchor :step t3032 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3032.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3032.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3032.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3032.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3032.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3032.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3032.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3032.t5 t3032.t6))
% 27.83/28.04  (step t3032.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3032.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3032.t8 t3027))
% 27.83/28.04  (step t3032.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3032.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3032.t9 t3032.t10))
% 27.83/28.04  (step t3032.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3032.t7 t3032.t11))
% 27.83/28.04  (step t3032.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3032.t12))
% 27.83/28.04  (step t3032.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t3032.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t3027 t3032.t14))
% 27.83/28.04  (step t3032.t16 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.04  (step t3032.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t3032.t3 t3032.t4 t3032.t13 t3032.t15 t3032.t16))
% 27.83/28.04  (step t3032 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.04  (step t3033 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t3029 t3031 t3032))
% 27.83/28.04  (step t3034 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t3026 t3033))
% 27.83/28.04  (step t3035 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t3023 t3034 a237))
% 27.83/28.04  (step t3036 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t3035))
% 27.83/28.04  (step t3037 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t3036))
% 27.83/28.04  (step t3038 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t3037 t2326 a194))
% 27.83/28.04  (step t3039 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3022 t3038))
% 27.83/28.04  (step t3040 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.83/28.04  (step t3041 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t3040))
% 27.83/28.04  (step t3042 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.04  (step t3043 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.04  (step t3044 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t1760 t453))
% 27.83/28.04  (step t3045 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.04  (step t3046 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t3044 t3045))
% 27.83/28.04  (step t3047 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t3043 t3046))
% 27.83/28.04  (step t3048 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3049)
% 27.83/28.04  (assume t3049.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.04  (step t3049.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3049.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t3049.t1))
% 27.83/28.04  (step t3049.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3049.t2 t3049.a0))
% 27.83/28.04  (step t3049 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t3049.a0))
% 27.83/28.04  (step t3050 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3048 t3049))
% 27.83/28.04  (step t3051 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.04  (step t3052 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3050 t3051))
% 27.83/28.04  (step t3053 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t3052))
% 27.83/28.04  (step t3054 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3042 t3047 t3053))
% 27.83/28.04  (step t3055 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t3054))
% 27.83/28.04  (step t3056 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3057 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3057.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3057.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3057.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3057.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3057.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3057.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3057.t5))
% 27.83/28.04  (step t3057.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3057.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3057.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3057.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3057.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3057.t3 t3057.t4 t3057.t6 t3057.t7 t3057.t8 t3057.t9 t3057.t10))
% 27.83/28.04  (step t3057 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3058 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.04  (step t3059 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t3057 t3058))
% 27.83/28.04  (step t3060 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3061 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3060))
% 27.83/28.04  (step t3062 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3061))
% 27.83/28.04  (step t3063 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3064 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3063 t3060))
% 27.83/28.04  (anchor :step t3065 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3065.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3065.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3065.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3065.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3065.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3065.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3065.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3065.t5 t3065.t6))
% 27.83/28.04  (step t3065.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3065.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3065.t8 t3060))
% 27.83/28.04  (step t3065.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3065.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3065.t9 t3065.t10))
% 27.83/28.04  (step t3065.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3065.t7 t3065.t11))
% 27.83/28.04  (step t3065.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3065.t12))
% 27.83/28.04  (step t3065.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t3065.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t3060 t3065.t14))
% 27.83/28.04  (step t3065.t16 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.04  (step t3065.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t3065.t3 t3065.t4 t3065.t13 t3065.t15 t3065.t16))
% 27.83/28.04  (step t3065 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.04  (step t3066 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t3062 t3064 t3065))
% 27.83/28.04  (step t3067 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t3059 t3066))
% 27.83/28.04  (step t3068 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t3056 t3067 a230))
% 27.83/28.04  (step t3069 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t3068))
% 27.83/28.04  (step t3070 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t3069))
% 27.83/28.04  (step t3071 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t3070 t2326 a194))
% 27.83/28.04  (step t3072 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3055 t3071))
% 27.83/28.04  (step t3073 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3074 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3074.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3074.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3074.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3074.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3074.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3074.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3074.t5))
% 27.83/28.04  (step t3074.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3074.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t3074.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3074.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3074.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3074.t3 t3074.t4 t3074.t6 t3074.t7 t3074.t8 t3074.t9 t3074.t10))
% 27.83/28.04  (step t3074 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3075 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3076 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t3074 t3075))
% 27.83/28.04  (step t3077 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3078 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3077))
% 27.83/28.04  (step t3079 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3078))
% 27.83/28.04  (step t3080 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3081 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3080 t3077))
% 27.83/28.04  (anchor :step t3082 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3082.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3082.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3082.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3082.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3082.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3082.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3082.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3082.t5 t3082.t6))
% 27.83/28.04  (step t3082.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3082.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3082.t8 t3077))
% 27.83/28.04  (step t3082.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3082.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3082.t9 t3082.t10))
% 27.83/28.04  (step t3082.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3082.t7 t3082.t11))
% 27.83/28.04  (step t3082.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3082.t12))
% 27.83/28.04  (step t3082.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t3082.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t3077 t3082.t14))
% 27.83/28.04  (step t3082.t16 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t3082.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t3082.t3 t3082.t4 t3082.t13 t3082.t15 t3082.t16))
% 27.83/28.04  (step t3082 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.04  (step t3083 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t3079 t3081 t3082))
% 27.83/28.04  (step t3084 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t3076 t3083))
% 27.83/28.04  (step t3085 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t3073 t3084 a221))
% 27.83/28.04  (step t3086 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t3085))
% 27.83/28.04  (step t3087 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t3086))
% 27.83/28.04  (step t3088 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t3087 t2326 a194))
% 27.83/28.04  (step t3089 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t1772 t3088))
% 27.83/28.04  (step t3090 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3091 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3090))
% 27.83/28.04  (step t3092 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3093 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.04  (step t3094 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t1760 t383))
% 27.83/28.04  (step t3095 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3096 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3094 t3095))
% 27.83/28.04  (step t3097 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3093 t3096))
% 27.83/28.04  (step t3098 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3099)
% 27.83/28.04  (assume t3099.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.04  (step t3099.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3099.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t3099.t1))
% 27.83/28.04  (step t3099.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3099.t2 t3099.a0))
% 27.83/28.04  (step t3099 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3099.a0))
% 27.83/28.04  (step t3100 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3098 t3099))
% 27.83/28.04  (step t3101 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3102 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3100 t3101))
% 27.83/28.04  (step t3103 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3102))
% 27.83/28.04  (step t3104 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3092 t3097 t3103))
% 27.83/28.04  (step t3105 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3104))
% 27.83/28.04  (step t3106 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3107 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3107.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3107.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3107.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3107.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3107.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3107.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3107.t5))
% 27.83/28.04  (step t3107.t7 (cl (= (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3107.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3107.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3107.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3107.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3107.t3 t3107.t4 t3107.t6 t3107.t7 t3107.t8 t3107.t9 t3107.t10))
% 27.83/28.04  (step t3107 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3108 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3109 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t3107 t3108))
% 27.83/28.04  (step t3110 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3111 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3110))
% 27.83/28.04  (step t3112 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3111))
% 27.83/28.04  (step t3113 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3114 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3113 t3110))
% 27.83/28.04  (anchor :step t3115 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3115.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3115.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3115.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3115.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3115.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3115.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3115.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3115.t5 t3115.t6))
% 27.83/28.04  (step t3115.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3115.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3115.t8 t3110))
% 27.83/28.04  (step t3115.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3115.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3115.t9 t3115.t10))
% 27.83/28.04  (step t3115.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3115.t7 t3115.t11))
% 27.83/28.04  (step t3115.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3115.t12))
% 27.83/28.04  (step t3115.t14 (cl (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)))) :rule refl)
% 27.83/28.04  (step t3115.t15 (cl (= (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))))) :rule cong :premises (t3110 t3115.t14))
% 27.83/28.04  (step t3115.t16 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3115.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t3115.t3 t3115.t4 t3115.t13 t3115.t15 t3115.t16))
% 27.83/28.04  (step t3115 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t3116 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (= tptp.sk1 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t3112 t3114 t3115))
% 27.83/28.04  (step t3117 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (= (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A)) tptp.sk1) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t3109 t3116))
% 27.83/28.04  (step t3118 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t3106 t3117 a210))
% 27.83/28.04  (step t3119 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t3118))
% 27.83/28.04  (step t3120 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule reordering :premises (t3119))
% 27.83/28.04  (step t3121 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 B A) tptp.nil) (tptp.sk10 B A))) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t3120 t2326 a194))
% 27.83/28.04  (step t3122 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3105 t3121))
% 27.83/28.04  (step t3123 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5))) (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2 t17 t2925 t2956 a192 a191 t2958 t2989 a192 a191 t1528 t3006 a192 a191 t3008 t3039 a192 a191 t3041 t3072 a192 a191 t1530 t3089 a192 a191 t3091 t3122 a192 a191))
% 27.83/28.04  (step t3124 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) :rule contraction :premises (t3123))
% 27.83/28.04  (step t3125 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3126 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3125))
% 27.83/28.04  (step t3127 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3128 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.04  (step t3129 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2041 t29))
% 27.83/28.04  (step t3130 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3131 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3129 t3130))
% 27.83/28.04  (step t3132 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3128 t3131))
% 27.83/28.04  (step t3133 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3134)
% 27.83/28.04  (assume t3134.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.04  (step t3134.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3134.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t3134.t1))
% 27.83/28.04  (step t3134.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3134.t2 t3134.a0))
% 27.83/28.04  (step t3134 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3134.a0))
% 27.83/28.04  (step t3135 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3133 t3134))
% 27.83/28.04  (step t3136 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3137 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3135 t3136))
% 27.83/28.04  (step t3138 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3137))
% 27.83/28.04  (step t3139 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3127 t3132 t3138))
% 27.83/28.04  (step t3140 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3139))
% 27.83/28.04  (step t3141 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3142 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3142.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3142.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3142.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3142.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3142.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3142.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3142.t5))
% 27.83/28.04  (step t3142.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3142.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3142.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3142.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3142.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3142.t3 t3142.t4 t3142.t6 t3142.t7 t3142.t8 t3142.t9 t3142.t10))
% 27.83/28.04  (step t3142 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3143 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3144 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t3142 t3143))
% 27.83/28.04  (step t3145 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3146 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3145))
% 27.83/28.04  (step t3147 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3146))
% 27.83/28.04  (step t3148 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3149 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3148 t3145))
% 27.83/28.04  (anchor :step t3150 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3150.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3150.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3150.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3150.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3150.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3150.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3150.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3150.t5 t3150.t6))
% 27.83/28.04  (step t3150.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3150.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3150.t8 t3145))
% 27.83/28.04  (step t3150.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3150.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3150.t9 t3150.t10))
% 27.83/28.04  (step t3150.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3150.t7 t3150.t11))
% 27.83/28.04  (step t3150.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3150.t12))
% 27.83/28.04  (step t3150.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3150.t15 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3150.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t3150.t3 t3150.t4 t3150.t13 t3150.t14 t3150.t15))
% 27.83/28.04  (step t3150 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t3151 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t3147 t3149 t3150))
% 27.83/28.04  (step t3152 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t3144 t3151))
% 27.83/28.04  (step t3153 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t3141 t3152 a247))
% 27.83/28.04  (step t3154 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t3153))
% 27.83/28.04  (step t3155 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t3154))
% 27.83/28.04  (step t3156 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t3155 t2326 a194))
% 27.83/28.04  (step t3157 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3140 t3156))
% 27.83/28.04  (step t3158 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.83/28.04  (step t3159 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t3158))
% 27.83/28.04  (step t3160 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.04  (step t3161 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.04  (step t3162 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t2041 t558))
% 27.83/28.04  (step t3163 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.04  (step t3164 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t3162 t3163))
% 27.83/28.04  (step t3165 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t3161 t3164))
% 27.83/28.04  (step t3166 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3167)
% 27.83/28.04  (assume t3167.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.04  (step t3167.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3167.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t3167.t1))
% 27.83/28.04  (step t3167.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t3167.t2 t3167.a0))
% 27.83/28.04  (step t3167 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t3167.a0))
% 27.83/28.04  (step t3168 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t3166 t3167))
% 27.83/28.04  (step t3169 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.04  (step t3170 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t3168 t3169))
% 27.83/28.04  (step t3171 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t3170))
% 27.83/28.04  (step t3172 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t3160 t3165 t3171))
% 27.83/28.04  (step t3173 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t3172))
% 27.83/28.04  (step t3174 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3175 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3175.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3175.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3175.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3175.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3175.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3175.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3175.t5))
% 27.83/28.04  (step t3175.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3175.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.04  (step t3175.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3175.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3175.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3175.t3 t3175.t4 t3175.t6 t3175.t7 t3175.t8 t3175.t9 t3175.t10))
% 27.83/28.04  (step t3175 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3176 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.04  (step t3177 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t3175 t3176))
% 27.83/28.04  (step t3178 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3179 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3178))
% 27.83/28.04  (step t3180 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3179))
% 27.83/28.04  (step t3181 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3182 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3181 t3178))
% 27.83/28.04  (anchor :step t3183 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3183.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3183.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3183.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3183.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3183.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3183.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3183.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3183.t5 t3183.t6))
% 27.83/28.04  (step t3183.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3183.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3183.t8 t3178))
% 27.83/28.04  (step t3183.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3183.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3183.t9 t3183.t10))
% 27.83/28.04  (step t3183.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3183.t7 t3183.t11))
% 27.83/28.04  (step t3183.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3183.t12))
% 27.83/28.04  (step t3183.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3183.t15 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.04  (step t3183.t16 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t3178 t3183.t15))
% 27.83/28.04  (step t3183.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t3183.t3 t3183.t4 t3183.t13 t3183.t14 t3183.t16))
% 27.83/28.04  (step t3183 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.04  (step t3184 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t3180 t3182 t3183))
% 27.83/28.04  (step t3185 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t3177 t3184))
% 27.83/28.04  (step t3186 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t3174 t3185 a246))
% 27.83/28.04  (step t3187 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t3186))
% 27.83/28.04  (step t3188 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t3187))
% 27.83/28.04  (step t3189 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t3188 t2326 a194))
% 27.83/28.04  (step t3190 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t3173 t3189))
% 27.83/28.04  (step t3191 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3192 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3192.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3192.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3192.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3192.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3192.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3192.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3192.t5))
% 27.83/28.04  (step t3192.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3192.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.04  (step t3192.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3192.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3192.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3192.t3 t3192.t4 t3192.t6 t3192.t7 t3192.t8 t3192.t9 t3192.t10))
% 27.83/28.04  (step t3192 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3193 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3194 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t3192 t3193))
% 27.83/28.04  (step t3195 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3196 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3195))
% 27.83/28.04  (step t3197 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3196))
% 27.83/28.04  (step t3198 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3199 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3198 t3195))
% 27.83/28.04  (anchor :step t3200 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3200.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3200.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3200.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3200.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3200.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3200.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3200.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3200.t5 t3200.t6))
% 27.83/28.04  (step t3200.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3200.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3200.t8 t3195))
% 27.83/28.04  (step t3200.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3200.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3200.t9 t3200.t10))
% 27.83/28.04  (step t3200.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3200.t7 t3200.t11))
% 27.83/28.04  (step t3200.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3200.t12))
% 27.83/28.04  (step t3200.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3200.t15 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.04  (step t3200.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t3200.t3 t3200.t4 t3200.t13 t3200.t14 t3200.t15))
% 27.83/28.04  (step t3200 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.04  (step t3201 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t3197 t3199 t3200))
% 27.83/28.04  (step t3202 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t3194 t3201))
% 27.83/28.04  (step t3203 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t3191 t3202 a243))
% 27.83/28.04  (step t3204 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t3203))
% 27.83/28.04  (step t3205 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t3204))
% 27.83/28.04  (step t3206 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t3205 t2326 a194))
% 27.83/28.04  (step t3207 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2087 t3206))
% 27.83/28.04  (step t3208 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3209 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3208))
% 27.83/28.04  (step t3210 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3211 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.04  (step t3212 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2041 t488))
% 27.83/28.04  (step t3213 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3214 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3212 t3213))
% 27.83/28.04  (step t3215 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3211 t3214))
% 27.83/28.04  (step t3216 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3217)
% 27.83/28.04  (assume t3217.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.04  (step t3217.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3217.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t3217.t1))
% 27.83/28.04  (step t3217.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3217.t2 t3217.a0))
% 27.83/28.04  (step t3217 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3217.a0))
% 27.83/28.04  (step t3218 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3216 t3217))
% 27.83/28.04  (step t3219 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3220 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3218 t3219))
% 27.83/28.04  (step t3221 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3220))
% 27.83/28.04  (step t3222 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3210 t3215 t3221))
% 27.83/28.04  (step t3223 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3222))
% 27.83/28.04  (step t3224 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3225 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3225.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3225.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3225.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3225.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3225.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3225.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3225.t5))
% 27.83/28.04  (step t3225.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3225.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.04  (step t3225.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3225.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3225.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3225.t3 t3225.t4 t3225.t6 t3225.t7 t3225.t8 t3225.t9 t3225.t10))
% 27.83/28.04  (step t3225 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3226 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3227 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t3225 t3226))
% 27.83/28.04  (step t3228 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3229 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3228))
% 27.83/28.04  (step t3230 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3229))
% 27.83/28.04  (step t3231 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3232 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3231 t3228))
% 27.83/28.04  (anchor :step t3233 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3233.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3233.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3233.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3233.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3233.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3233.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3233.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3233.t5 t3233.t6))
% 27.83/28.04  (step t3233.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3233.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3233.t8 t3228))
% 27.83/28.04  (step t3233.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3233.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3233.t9 t3233.t10))
% 27.83/28.04  (step t3233.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3233.t7 t3233.t11))
% 27.83/28.04  (step t3233.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3233.t12))
% 27.83/28.04  (step t3233.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3233.t15 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.04  (step t3233.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t3233.t3 t3233.t4 t3233.t13 t3233.t14 t3233.t15))
% 27.83/28.04  (step t3233 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.04  (step t3234 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t3230 t3232 t3233))
% 27.83/28.04  (step t3235 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t3227 t3234))
% 27.83/28.04  (step t3236 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t3224 t3235 a238))
% 27.83/28.04  (step t3237 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t3236))
% 27.83/28.04  (step t3238 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t3237))
% 27.83/28.04  (step t3239 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t3238 t2326 a194))
% 27.83/28.04  (step t3240 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3223 t3239))
% 27.83/28.04  (step t3241 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.83/28.04  (step t3242 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t3241))
% 27.83/28.04  (step t3243 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.04  (step t3244 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.04  (step t3245 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t2041 t453))
% 27.83/28.04  (step t3246 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.04  (step t3247 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t3245 t3246))
% 27.83/28.04  (step t3248 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t3244 t3247))
% 27.83/28.04  (step t3249 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3250)
% 27.83/28.04  (assume t3250.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.04  (step t3250.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3250.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t3250.t1))
% 27.83/28.04  (step t3250.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3250.t2 t3250.a0))
% 27.83/28.04  (step t3250 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t3250.a0))
% 27.83/28.04  (step t3251 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3249 t3250))
% 27.83/28.04  (step t3252 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.04  (step t3253 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3251 t3252))
% 27.83/28.04  (step t3254 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t3253))
% 27.83/28.04  (step t3255 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3243 t3248 t3254))
% 27.83/28.04  (step t3256 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t3255))
% 27.83/28.04  (step t3257 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3258 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3258.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3258.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3258.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3258.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3258.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3258.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3258.t5))
% 27.83/28.04  (step t3258.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3258.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3258.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3258.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3258.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3258.t3 t3258.t4 t3258.t6 t3258.t7 t3258.t8 t3258.t9 t3258.t10))
% 27.83/28.04  (step t3258 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3259 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.04  (step t3260 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t3258 t3259))
% 27.83/28.04  (step t3261 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3262 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3261))
% 27.83/28.04  (step t3263 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3262))
% 27.83/28.04  (step t3264 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3265 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3264 t3261))
% 27.83/28.04  (anchor :step t3266 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3266.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3266.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3266.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3266.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3266.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3266.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3266.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3266.t5 t3266.t6))
% 27.83/28.04  (step t3266.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3266.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3266.t8 t3261))
% 27.83/28.04  (step t3266.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3266.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3266.t9 t3266.t10))
% 27.83/28.04  (step t3266.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3266.t7 t3266.t11))
% 27.83/28.04  (step t3266.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3266.t12))
% 27.83/28.04  (step t3266.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3266.t15 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.04  (step t3266.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t3266.t3 t3266.t4 t3266.t13 t3266.t14 t3266.t15))
% 27.83/28.04  (step t3266 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.04  (step t3267 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t3263 t3265 t3266))
% 27.83/28.04  (step t3268 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t3260 t3267))
% 27.83/28.04  (step t3269 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t3257 t3268 a231))
% 27.83/28.04  (step t3270 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t3269))
% 27.83/28.04  (step t3271 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t3270))
% 27.83/28.04  (step t3272 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t3271 t2326 a194))
% 27.83/28.04  (step t3273 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3256 t3272))
% 27.83/28.04  (step t3274 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3275 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3275.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3275.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3275.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3275.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3275.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3275.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3275.t5))
% 27.83/28.04  (step t3275.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3275.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t3275.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3275.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3275.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3275.t3 t3275.t4 t3275.t6 t3275.t7 t3275.t8 t3275.t9 t3275.t10))
% 27.83/28.04  (step t3275 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3276 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3277 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t3275 t3276))
% 27.83/28.04  (step t3278 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3279 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3278))
% 27.83/28.04  (step t3280 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3279))
% 27.83/28.04  (step t3281 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3282 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3281 t3278))
% 27.83/28.04  (anchor :step t3283 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3283.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3283.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3283.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3283.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3283.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3283.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3283.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3283.t5 t3283.t6))
% 27.83/28.04  (step t3283.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3283.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3283.t8 t3278))
% 27.83/28.04  (step t3283.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3283.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3283.t9 t3283.t10))
% 27.83/28.04  (step t3283.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3283.t7 t3283.t11))
% 27.83/28.04  (step t3283.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3283.t12))
% 27.83/28.04  (step t3283.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3283.t15 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t3283.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t3283.t3 t3283.t4 t3283.t13 t3283.t14 t3283.t15))
% 27.83/28.04  (step t3283 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.04  (step t3284 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t3280 t3282 t3283))
% 27.83/28.04  (step t3285 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t3277 t3284))
% 27.83/28.04  (step t3286 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t3274 t3285 a222))
% 27.83/28.04  (step t3287 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t3286))
% 27.83/28.04  (step t3288 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t3287))
% 27.83/28.04  (step t3289 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t3288 t2326 a194))
% 27.83/28.04  (step t3290 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2053 t3289))
% 27.83/28.04  (step t3291 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3292 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3291))
% 27.83/28.04  (step t3293 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3294 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.04  (step t3295 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2041 t383))
% 27.83/28.04  (step t3296 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3297 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3295 t3296))
% 27.83/28.04  (step t3298 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3294 t3297))
% 27.83/28.04  (step t3299 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3300)
% 27.83/28.04  (assume t3300.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.04  (step t3300.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3300.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t3300.t1))
% 27.83/28.04  (step t3300.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3300.t2 t3300.a0))
% 27.83/28.04  (step t3300 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3300.a0))
% 27.83/28.04  (step t3301 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3299 t3300))
% 27.83/28.04  (step t3302 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3303 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3301 t3302))
% 27.83/28.04  (step t3304 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3303))
% 27.83/28.04  (step t3305 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3293 t3298 t3304))
% 27.83/28.04  (step t3306 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3305))
% 27.83/28.04  (step t3307 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3308 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3308.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3308.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3308.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3308.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3308.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3308.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3308.t5))
% 27.83/28.04  (step t3308.t7 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3308.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3308.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3308.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3308.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3308.t3 t3308.t4 t3308.t6 t3308.t7 t3308.t8 t3308.t9 t3308.t10))
% 27.83/28.04  (step t3308 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3309 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3310 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t3308 t3309))
% 27.83/28.04  (step t3311 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3312 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3311))
% 27.83/28.04  (step t3313 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3312))
% 27.83/28.04  (step t3314 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3315 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3314 t3311))
% 27.83/28.04  (anchor :step t3316 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3316.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3316.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3316.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3316.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3316.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3316.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3316.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3316.t5 t3316.t6))
% 27.83/28.04  (step t3316.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3316.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3316.t8 t3311))
% 27.83/28.04  (step t3316.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3316.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3316.t9 t3316.t10))
% 27.83/28.04  (step t3316.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3316.t7 t3316.t11))
% 27.83/28.04  (step t3316.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3316.t12))
% 27.83/28.04  (step t3316.t14 (cl (= (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)))) :rule refl)
% 27.83/28.04  (step t3316.t15 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3316.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t3316.t3 t3316.t4 t3316.t13 t3316.t14 t3316.t15))
% 27.83/28.04  (step t3316 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t3317 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t3313 t3315 t3316))
% 27.83/28.04  (step t3318 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t3310 t3317))
% 27.83/28.04  (step t3319 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t3307 t3318 a211))
% 27.83/28.04  (step t3320 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t3319))
% 27.83/28.04  (step t3321 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule reordering :premises (t3320))
% 27.83/28.04  (step t3322 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.lt (tptp.sk7 B A) (tptp.sk9 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t3321 t2326 a194))
% 27.83/28.04  (step t3323 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3306 t3322))
% 27.83/28.04  (step t3324 (cl (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))) :rule resolution :premises (t2 t17 t3126 t3157 a192 a191 t3159 t3190 a192 a191 t1835 t3207 a192 a191 t3209 t3240 a192 a191 t3242 t3273 a192 a191 t1837 t3290 a192 a191 t3292 t3323 a192 a191))
% 27.83/28.04  (step t3325 (cl (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))) :rule contraction :premises (t3324))
% 27.83/28.04  (step t3326 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3327)
% 27.83/28.04  (assume t3327.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))))
% 27.83/28.04  (step t3327.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A (tptp.sk7 tptp.sk6 tptp.sk5)) (:= B (tptp.sk8 tptp.sk6 tptp.sk5)) (:= C (tptp.sk9 tptp.sk6 tptp.sk5)) (:= D (tptp.sk10 tptp.sk6 tptp.sk5))))
% 27.83/28.04  (step t3327.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule or :premises (t3327.t1))
% 27.83/28.04  (step t3327.t3 (cl (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3327.t2 t3327.a0))
% 27.83/28.04  (step t3327 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t3327.a0))
% 27.83/28.04  (step t3328 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3326 t3327))
% 27.83/28.04  (step t3329 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.04  (step t3330 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3328 t3329))
% 27.83/28.04  (step t3331 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C)))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t3330))
% 27.83/28.04  (step t3332 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk5 (tptp.app B (tptp.cons A tptp.nil)))) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= tptp.sk3 (tptp.app (tptp.cons C tptp.nil) D))) (not (tptp.lt A C))))) (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule implies :premises (t3331))
% 27.83/28.04  (step t3333 (cl (or (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk8 tptp.sk6 tptp.sk5))) (not (= tptp.sk5 (tptp.app (tptp.sk8 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk7 tptp.sk6 tptp.sk5) tptp.nil)))) (not (tptp.ssItem (tptp.sk9 tptp.sk6 tptp.sk5))) (not (tptp.ssList (tptp.sk10 tptp.sk6 tptp.sk5))) (not (= tptp.sk3 (tptp.app (tptp.cons (tptp.sk9 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk10 tptp.sk6 tptp.sk5)))) (not (tptp.lt (tptp.sk7 tptp.sk6 tptp.sk5) (tptp.sk9 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3332 t80))
% 27.83/28.04  (step t3334 (cl (not (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t6 t2432 t2601 t2802 t2923 t3124 t3325 t3333))
% 27.83/28.04  (step t3335 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3336 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.04  (step t3337 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2127 t29))
% 27.83/28.04  (step t3338 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3339 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3337 t3338))
% 27.83/28.04  (step t3340 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3336 t3339))
% 27.83/28.04  (step t3341 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3342)
% 27.83/28.04  (assume t3342.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))
% 27.83/28.04  (step t3342.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3342.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t3342.t1))
% 27.83/28.04  (step t3342.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3342.t2 t3342.a0))
% 27.83/28.04  (step t3342 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3342.a0))
% 27.83/28.04  (step t3343 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3341 t3342))
% 27.83/28.04  (step t3344 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3345 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3343 t3344))
% 27.83/28.04  (step t3346 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3345))
% 27.83/28.04  (step t3347 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3335 t3340 t3346))
% 27.83/28.04  (step t3348 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3347))
% 27.83/28.04  (step t3349 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3350 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3350.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3350.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3350.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3350.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3350.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3350.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3350.t5))
% 27.83/28.04  (step t3350.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3350.t8 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3350.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3350.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3350.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3350.t3 t3350.t4 t3350.t6 t3350.t7 t3350.t8 t3350.t9 t3350.t10))
% 27.83/28.04  (step t3350 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3351 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3352 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t3350 t3351))
% 27.83/28.04  (step t3353 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3354 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3353))
% 27.83/28.04  (step t3355 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3354))
% 27.83/28.04  (step t3356 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3357 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3356 t3353))
% 27.83/28.04  (anchor :step t3358 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3358.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3358.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3358.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3358.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3358.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3358.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3358.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3358.t5 t3358.t6))
% 27.83/28.04  (step t3358.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3358.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3358.t8 t3353))
% 27.83/28.04  (step t3358.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3358.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3358.t9 t3358.t10))
% 27.83/28.04  (step t3358.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3358.t7 t3358.t11))
% 27.83/28.04  (step t3358.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3358.t12))
% 27.83/28.04  (step t3358.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3358.t15 (cl (= (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3358.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule cong :premises (t3358.t3 t3358.t4 t3358.t13 t3358.t14 t3358.t15))
% 27.83/28.04  (step t3358 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t3359 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule cong :premises (t3355 t3357 t3358))
% 27.83/28.04  (step t3360 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))))) :rule trans :premises (t3352 t3359))
% 27.83/28.04  (step t3361 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A)))))) :rule resolution :premises (t3349 t3360 a205))
% 27.83/28.04  (step t3362 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule or :premises (t3361))
% 27.83/28.04  (step t3363 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule reordering :premises (t3362))
% 27.83/28.04  (step t3364 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.lt (tptp.sk13 B A) (tptp.sk11 B A))))) :rule resolution :premises (t3363 t2326 a194))
% 27.83/28.04  (step t3365 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3348 t3364))
% 27.83/28.04  (step t3366 (cl (tptp.lt (tptp.sk13 tptp.sk6 tptp.sk5) (tptp.sk11 tptp.sk6 tptp.sk5))) :rule resolution :premises (t4 a191 a192 t3334 t3365))
% 27.83/28.04  (step t3367 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule or_pos)
% 27.83/28.04  (step t3368 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule reordering :premises (t3367))
% 27.83/28.04  (step t3369 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule equiv_pos2)
% 27.83/28.04  (step t3370 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule refl)
% 27.83/28.04  (step t3371 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule cong :premises (t22 t23 t27 t2127 t558))
% 27.83/28.04  (step t3372 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule all_simplify)
% 27.83/28.04  (step t3373 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule trans :premises (t3371 t3372))
% 27.83/28.04  (step t3374 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))))) :rule cong :premises (t3370 t3373))
% 27.83/28.04  (step t3375 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3376)
% 27.83/28.04  (assume t3376.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))
% 27.83/28.04  (step t3376.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3376.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule or :premises (t3376.t1))
% 27.83/28.04  (step t3376.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t3376.t2 t3376.a0))
% 27.83/28.04  (step t3376 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule subproof :discharge (t3376.a0))
% 27.83/28.04  (step t3377 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t3375 t3376))
% 27.83/28.04  (step t3378 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule implies_neg2)
% 27.83/28.04  (step t3379 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t3377 t3378))
% 27.83/28.04  (step t3380 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule contraction :premises (t3379))
% 27.83/28.04  (step t3381 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))))) :rule resolution :premises (t3369 t3374 t3380))
% 27.83/28.04  (step t3382 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule implies :premises (t3381))
% 27.83/28.04  (step t3383 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3384 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3384.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3384.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3384.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3384.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3384.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3384.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3384.t5))
% 27.83/28.04  (step t3384.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3384.t8 (cl (= (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule all_simplify)
% 27.83/28.04  (step t3384.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3384.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3384.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3384.t3 t3384.t4 t3384.t6 t3384.t7 t3384.t8 t3384.t9 t3384.t10))
% 27.83/28.04  (step t3384 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3385 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule all_simplify)
% 27.83/28.04  (step t3386 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t3384 t3385))
% 27.83/28.04  (step t3387 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3388 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3387))
% 27.83/28.04  (step t3389 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3388))
% 27.83/28.04  (step t3390 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3391 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3390 t3387))
% 27.83/28.04  (anchor :step t3392 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3392.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3392.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3392.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3392.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3392.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3392.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3392.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3392.t5 t3392.t6))
% 27.83/28.04  (step t3392.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3392.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3392.t8 t3387))
% 27.83/28.04  (step t3392.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3392.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3392.t9 t3392.t10))
% 27.83/28.04  (step t3392.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3392.t7 t3392.t11))
% 27.83/28.04  (step t3392.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3392.t12))
% 27.83/28.04  (step t3392.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3392.t15 (cl (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) :rule refl)
% 27.83/28.04  (step t3392.t16 (cl (= (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) :rule cong :premises (t3387 t3392.t15))
% 27.83/28.04  (step t3392.t17 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule cong :premises (t3392.t3 t3392.t4 t3392.t13 t3392.t14 t3392.t16))
% 27.83/28.04  (step t3392 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule bind)
% 27.83/28.04  (step t3393 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk1 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule cong :premises (t3389 t3391 t3392))
% 27.83/28.04  (step t3394 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)) tptp.sk1) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))))) :rule trans :premises (t3386 t3393))
% 27.83/28.04  (step t3395 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil))))))) :rule resolution :premises (t3383 t3394 a204))
% 27.83/28.04  (step t3396 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule or :premises (t3395))
% 27.83/28.04  (step t3397 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule reordering :premises (t3396))
% 27.83/28.04  (step t3398 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= tptp.sk3 (tptp.app (tptp.sk14 B A) (tptp.cons (tptp.sk13 B A) tptp.nil)))))) :rule resolution :premises (t3397 t2326 a194))
% 27.83/28.04  (step t3399 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil))))) :rule resolution :premises (t3382 t3398))
% 27.83/28.04  (step t3400 (cl (= tptp.sk3 (tptp.app (tptp.sk14 tptp.sk6 tptp.sk5) (tptp.cons (tptp.sk13 tptp.sk6 tptp.sk5) tptp.nil)))) :rule resolution :premises (t3368 a191 a192 t3334 t3399))
% 27.83/28.04  (step t3401 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3402 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3402.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3402.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3402.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3402.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3402.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3402.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3402.t5))
% 27.83/28.04  (step t3402.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3402.t8 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.04  (step t3402.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3402.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3402.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3402.t3 t3402.t4 t3402.t6 t3402.t7 t3402.t8 t3402.t9 t3402.t10))
% 27.83/28.04  (step t3402 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3403 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3404 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t3402 t3403))
% 27.83/28.04  (step t3405 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3406 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3405))
% 27.83/28.04  (step t3407 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3406))
% 27.83/28.04  (step t3408 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3409 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3408 t3405))
% 27.83/28.04  (anchor :step t3410 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3410.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3410.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3410.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3410.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3410.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3410.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3410.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3410.t5 t3410.t6))
% 27.83/28.04  (step t3410.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3410.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3410.t8 t3405))
% 27.83/28.04  (step t3410.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3410.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3410.t9 t3410.t10))
% 27.83/28.04  (step t3410.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3410.t7 t3410.t11))
% 27.83/28.04  (step t3410.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3410.t12))
% 27.83/28.04  (step t3410.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3410.t15 (cl (= (tptp.ssList (tptp.sk14 B A)) (tptp.ssList (tptp.sk14 B A)))) :rule refl)
% 27.83/28.04  (step t3410.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule cong :premises (t3410.t3 t3410.t4 t3410.t13 t3410.t14 t3410.t15))
% 27.83/28.04  (step t3410 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule bind)
% 27.83/28.04  (step t3411 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule cong :premises (t3407 t3409 t3410))
% 27.83/28.04  (step t3412 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))))) :rule trans :premises (t3404 t3411))
% 27.83/28.04  (step t3413 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A)))))) :rule resolution :premises (t3401 t3412 a203))
% 27.83/28.04  (step t3414 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule or :premises (t3413))
% 27.83/28.04  (step t3415 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule reordering :premises (t3414))
% 27.83/28.04  (step t3416 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk14 B A))))) :rule resolution :premises (t3415 t2326 a194))
% 27.83/28.04  (step t3417 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2139 t3416))
% 27.83/28.04  (step t3418 (cl (tptp.ssList (tptp.sk14 tptp.sk6 tptp.sk5))) :rule resolution :premises (t83 a191 a192 t3334 t3417))
% 27.83/28.04  (step t3419 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3420 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3419))
% 27.83/28.04  (step t3421 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3422 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule refl)
% 27.83/28.04  (step t3423 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2127 t488))
% 27.83/28.04  (step t3424 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3425 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3423 t3424))
% 27.83/28.04  (step t3426 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3422 t3425))
% 27.83/28.04  (step t3427 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3428)
% 27.83/28.04  (assume t3428.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))
% 27.83/28.04  (step t3428.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3428.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule or :premises (t3428.t1))
% 27.83/28.04  (step t3428.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3428.t2 t3428.a0))
% 27.83/28.04  (step t3428 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3428.a0))
% 27.83/28.04  (step t3429 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3427 t3428))
% 27.83/28.04  (step t3430 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3431 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3429 t3430))
% 27.83/28.04  (step t3432 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3431))
% 27.83/28.04  (step t3433 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3421 t3426 t3432))
% 27.83/28.04  (step t3434 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3433))
% 27.83/28.04  (step t3435 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3436 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3436.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3436.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3436.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3436.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3436.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3436.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3436.t5))
% 27.83/28.04  (step t3436.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3436.t8 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.04  (step t3436.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3436.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3436.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3436.t3 t3436.t4 t3436.t6 t3436.t7 t3436.t8 t3436.t9 t3436.t10))
% 27.83/28.04  (step t3436 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3437 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3438 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t3436 t3437))
% 27.83/28.04  (step t3439 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3440 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3439))
% 27.83/28.04  (step t3441 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3440))
% 27.83/28.04  (step t3442 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3443 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3442 t3439))
% 27.83/28.04  (anchor :step t3444 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3444.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3444.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3444.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3444.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3444.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3444.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3444.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3444.t5 t3444.t6))
% 27.83/28.04  (step t3444.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3444.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3444.t8 t3439))
% 27.83/28.04  (step t3444.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3444.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3444.t9 t3444.t10))
% 27.83/28.04  (step t3444.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3444.t7 t3444.t11))
% 27.83/28.04  (step t3444.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3444.t12))
% 27.83/28.04  (step t3444.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3444.t15 (cl (= (tptp.ssItem (tptp.sk13 B A)) (tptp.ssItem (tptp.sk13 B A)))) :rule refl)
% 27.83/28.04  (step t3444.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule cong :premises (t3444.t3 t3444.t4 t3444.t13 t3444.t14 t3444.t15))
% 27.83/28.04  (step t3444 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule bind)
% 27.83/28.04  (step t3445 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule cong :premises (t3441 t3443 t3444))
% 27.83/28.04  (step t3446 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))))) :rule trans :premises (t3438 t3445))
% 27.83/28.04  (step t3447 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A)))))) :rule resolution :premises (t3435 t3446 a202))
% 27.83/28.04  (step t3448 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule or :premises (t3447))
% 27.83/28.04  (step t3449 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule reordering :premises (t3448))
% 27.83/28.04  (step t3450 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk13 B A))))) :rule resolution :premises (t3449 t2326 a194))
% 27.83/28.04  (step t3451 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3434 t3450))
% 27.83/28.04  (step t3452 (cl (tptp.ssItem (tptp.sk13 tptp.sk6 tptp.sk5))) :rule resolution :premises (t3420 a191 a192 t3334 t3451))
% 27.83/28.04  (step t3453 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule or_pos)
% 27.83/28.04  (step t3454 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule reordering :premises (t3453))
% 27.83/28.04  (step t3455 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule equiv_pos2)
% 27.83/28.04  (step t3456 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule refl)
% 27.83/28.04  (step t3457 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t22 t23 t27 t2127 t453))
% 27.83/28.04  (step t3458 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule all_simplify)
% 27.83/28.04  (step t3459 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule trans :premises (t3457 t3458))
% 27.83/28.04  (step t3460 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))))) :rule cong :premises (t3456 t3459))
% 27.83/28.04  (step t3461 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3462)
% 27.83/28.04  (assume t3462.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))
% 27.83/28.04  (step t3462.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3462.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule or :premises (t3462.t1))
% 27.83/28.04  (step t3462.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3462.t2 t3462.a0))
% 27.83/28.04  (step t3462 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule subproof :discharge (t3462.a0))
% 27.83/28.04  (step t3463 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3461 t3462))
% 27.83/28.04  (step t3464 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule implies_neg2)
% 27.83/28.04  (step t3465 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3463 t3464))
% 27.83/28.04  (step t3466 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule contraction :premises (t3465))
% 27.83/28.04  (step t3467 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))))) :rule resolution :premises (t3455 t3460 t3466))
% 27.83/28.04  (step t3468 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule implies :premises (t3467))
% 27.83/28.04  (step t3469 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3470 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3470.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3470.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3470.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3470.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3470.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3470.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3470.t5))
% 27.83/28.04  (step t3470.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3470.t8 (cl (= (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule all_simplify)
% 27.83/28.04  (step t3470.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3470.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3470.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3470.t3 t3470.t4 t3470.t6 t3470.t7 t3470.t8 t3470.t9 t3470.t10))
% 27.83/28.04  (step t3470 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3471 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule all_simplify)
% 27.83/28.04  (step t3472 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t3470 t3471))
% 27.83/28.04  (step t3473 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3474 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3473))
% 27.83/28.04  (step t3475 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3474))
% 27.83/28.04  (step t3476 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3477 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3476 t3473))
% 27.83/28.04  (anchor :step t3478 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3478.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3478.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3478.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3478.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3478.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3478.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3478.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3478.t5 t3478.t6))
% 27.83/28.04  (step t3478.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3478.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3478.t8 t3473))
% 27.83/28.04  (step t3478.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3478.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3478.t9 t3478.t10))
% 27.83/28.04  (step t3478.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3478.t7 t3478.t11))
% 27.83/28.04  (step t3478.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3478.t12))
% 27.83/28.04  (step t3478.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3478.t15 (cl (= (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) :rule refl)
% 27.83/28.04  (step t3478.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule cong :premises (t3478.t3 t3478.t4 t3478.t13 t3478.t14 t3478.t15))
% 27.83/28.04  (step t3478 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule bind)
% 27.83/28.04  (step t3479 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule cong :premises (t3475 t3477 t3478))
% 27.83/28.04  (step t3480 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (= (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)) B) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))))) :rule trans :premises (t3472 t3479))
% 27.83/28.04  (step t3481 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A))))))) :rule resolution :premises (t3469 t3480 a201))
% 27.83/28.04  (step t3482 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule or :premises (t3481))
% 27.83/28.04  (step t3483 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule reordering :premises (t3482))
% 27.83/28.04  (step t3484 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (= B (tptp.app (tptp.cons (tptp.sk11 B A) tptp.nil) (tptp.sk12 B A)))))) :rule resolution :premises (t3483 t2326 a194))
% 27.83/28.04  (step t3485 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3468 t3484))
% 27.83/28.04  (step t3486 (cl (= tptp.sk6 (tptp.app (tptp.cons (tptp.sk11 tptp.sk6 tptp.sk5) tptp.nil) (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3454 a191 a192 t3334 t3485))
% 27.83/28.04  (step t3487 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3488 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3488.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3488.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3488.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3488.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3488.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3488.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3488.t5))
% 27.83/28.04  (step t3488.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3488.t8 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t3488.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3488.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3488.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3488.t3 t3488.t4 t3488.t6 t3488.t7 t3488.t8 t3488.t9 t3488.t10))
% 27.83/28.04  (step t3488 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3489 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3490 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t3488 t3489))
% 27.83/28.04  (step t3491 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3492 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3491))
% 27.83/28.04  (step t3493 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3492))
% 27.83/28.04  (step t3494 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3495 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3494 t3491))
% 27.83/28.04  (anchor :step t3496 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3496.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3496.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3496.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3496.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3496.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3496.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3496.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3496.t5 t3496.t6))
% 27.83/28.04  (step t3496.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3496.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3496.t8 t3491))
% 27.83/28.04  (step t3496.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3496.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3496.t9 t3496.t10))
% 27.83/28.04  (step t3496.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3496.t7 t3496.t11))
% 27.83/28.04  (step t3496.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3496.t12))
% 27.83/28.04  (step t3496.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3496.t15 (cl (= (tptp.ssList (tptp.sk12 B A)) (tptp.ssList (tptp.sk12 B A)))) :rule refl)
% 27.83/28.04  (step t3496.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule cong :premises (t3496.t3 t3496.t4 t3496.t13 t3496.t14 t3496.t15))
% 27.83/28.04  (step t3496 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule bind)
% 27.83/28.04  (step t3497 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule cong :premises (t3493 t3495 t3496))
% 27.83/28.04  (step t3498 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))))) :rule trans :premises (t3490 t3497))
% 27.83/28.04  (step t3499 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A)))))) :rule resolution :premises (t3487 t3498 a200))
% 27.83/28.04  (step t3500 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule or :premises (t3499))
% 27.83/28.04  (step t3501 (cl (= tptp.nil tptp.sk3) (not (tptp.strictorderedP tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule reordering :premises (t3500))
% 27.83/28.04  (step t3502 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssList (tptp.sk12 B A))))) :rule resolution :premises (t3501 t2326 a194))
% 27.83/28.04  (step t3503 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t2167 t3502))
% 27.83/28.04  (step t3504 (cl (tptp.ssList (tptp.sk12 tptp.sk6 tptp.sk5))) :rule resolution :premises (t85 a191 a192 t3334 t3503))
% 27.83/28.04  (step t3505 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule or_pos)
% 27.83/28.04  (step t3506 (cl (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule reordering :premises (t3505))
% 27.83/28.04  (step t3507 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule equiv_pos2)
% 27.83/28.04  (step t3508 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule refl)
% 27.83/28.04  (step t3509 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule cong :premises (t22 t23 t27 t2127 t383))
% 27.83/28.04  (step t3510 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) false (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule all_simplify)
% 27.83/28.04  (step t3511 (cl (= (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule trans :premises (t3509 t3510))
% 27.83/28.04  (step t3512 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))))) :rule cong :premises (t3508 t3511))
% 27.83/28.04  (step t3513 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule implies_neg1)
% 27.83/28.04  (anchor :step t3514)
% 27.83/28.04  (assume t3514.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))
% 27.83/28.04  (step t3514.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk6)))
% 27.83/28.04  (step t3514.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule or :premises (t3514.t1))
% 27.83/28.04  (step t3514.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3514.t2 t3514.a0))
% 27.83/28.04  (step t3514 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule subproof :discharge (t3514.a0))
% 27.83/28.04  (step t3515 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3513 t3514))
% 27.83/28.04  (step t3516 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule implies_neg2)
% 27.83/28.04  (step t3517 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3515 t3516))
% 27.83/28.04  (step t3518 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule contraction :premises (t3517))
% 27.83/28.04  (step t3519 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))))) :rule resolution :premises (t3507 t3512 t3518))
% 27.83/28.04  (step t3520 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule implies :premises (t3519))
% 27.83/28.04  (step t3521 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule equiv_pos2)
% 27.83/28.04  (anchor :step t3522 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3522.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3522.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3522.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3522.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3522.t5 (cl (= (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)))) :rule all_simplify)
% 27.83/28.04  (step t3522.t6 (cl (= (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))))) :rule cong :premises (t3522.t5))
% 27.83/28.04  (step t3522.t7 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3522.t8 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3522.t9 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk1)))) :rule refl)
% 27.83/28.04  (step t3522.t10 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 27.83/28.04  (step t3522.t11 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule cong :premises (t3522.t3 t3522.t4 t3522.t6 t3522.t7 t3522.t8 t3522.t9 t3522.t10))
% 27.83/28.04  (step t3522 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))))) :rule bind)
% 27.83/28.04  (step t3523 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule all_simplify)
% 27.83/28.04  (step t3524 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t3522 t3523))
% 27.83/28.04  (step t3525 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t48))
% 27.83/28.04  (step t3526 (cl (= (tptp.strictorderedP tptp.sk1) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t3525))
% 27.83/28.04  (step t3527 (cl (= (not (tptp.strictorderedP tptp.sk1)) (not (tptp.strictorderedP tptp.sk3)))) :rule cong :premises (t3526))
% 27.83/28.04  (step t3528 (cl (= tptp.nil tptp.nil)) :rule refl)
% 27.83/28.04  (step t3529 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t3528 t3525))
% 27.83/28.04  (anchor :step t3530 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 27.83/28.04  (step t3530.t1 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3530.t2 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3530.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 27.83/28.04  (step t3530.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 27.83/28.04  (step t3530.t5 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t48))
% 27.83/28.04  (step t3530.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and :premises (t48))
% 27.83/28.04  (step t3530.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t3530.t5 t3530.t6))
% 27.83/28.04  (step t3530.t8 (cl (= A A)) :rule refl)
% 27.83/28.04  (step t3530.t9 (cl (= (tptp.app A tptp.sk1) (tptp.app A tptp.sk3))) :rule cong :premises (t3530.t8 t3525))
% 27.83/28.04  (step t3530.t10 (cl (= B B)) :rule refl)
% 27.83/28.04  (step t3530.t11 (cl (= (tptp.app (tptp.app A tptp.sk1) B) (tptp.app (tptp.app A tptp.sk3) B))) :rule cong :premises (t3530.t9 t3530.t10))
% 27.83/28.04  (step t3530.t12 (cl (= (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B)) (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B)))) :rule cong :premises (t3530.t7 t3530.t11))
% 27.83/28.04  (step t3530.t13 (cl (= (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))))) :rule cong :premises (t3530.t12))
% 27.83/28.04  (step t3530.t14 (cl (= (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk7 B A)))) :rule refl)
% 27.83/28.04  (step t3530.t15 (cl (= (tptp.ssItem (tptp.sk11 B A)) (tptp.ssItem (tptp.sk11 B A)))) :rule refl)
% 27.83/28.04  (step t3530.t16 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule cong :premises (t3530.t3 t3530.t4 t3530.t13 t3530.t14 t3530.t15))
% 27.83/28.04  (step t3530 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule bind)
% 27.83/28.04  (step t3531 (cl (= (or (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.app A tptp.sk1) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule cong :premises (t3527 t3529 t3530))
% 27.83/28.04  (step t3532 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app A tptp.sk1) B) tptp.sk2)) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)) (not (tptp.strictorderedP tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))))) :rule trans :premises (t3524 t3531))
% 27.83/28.04  (step t3533 (cl (or (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))))) :rule resolution :premises (t3521 t3532 a198))
% 27.83/28.04  (step t3534 (cl (not (tptp.strictorderedP tptp.sk3)) (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule or :premises (t3533))
% 27.83/28.04  (step t3535 (cl (= tptp.nil tptp.sk3) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A)))) (not (tptp.strictorderedP tptp.sk3))) :rule reordering :premises (t3534))
% 27.83/28.04  (step t3536 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) (tptp.app (tptp.app A tptp.sk3) B))) (tptp.ssItem (tptp.sk7 B A)) (tptp.ssItem (tptp.sk11 B A))))) :rule resolution :premises (t3535 t2326 a194))
% 27.83/28.04  (step t3537 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (tptp.ssItem (tptp.sk7 tptp.sk6 tptp.sk5)) (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5)))) :rule resolution :premises (t3520 t3536))
% 27.83/28.04  (step t3538 (cl (tptp.ssItem (tptp.sk11 tptp.sk6 tptp.sk5))) :rule resolution :premises (t3506 a191 a192 t3334 t3537))
% 27.83/28.04  (step t3539 (cl) :rule resolution :premises (t2 t3366 t3400 t17 t3418 t3452 t3486 t3504 t3538))
% 27.83/28.04  
% 27.83/28.04  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.ruWhwh3zB8/cvc5---1.0.5_8039.smt2
% 27.83/28.05  % cvc5---1.0.5 exiting
% 27.83/28.05  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------