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

% Computer : n029.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:24 EDT 2024

% Result   : Unsatisfiable 26.54s 26.82s
% Output   : Proof 26.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWC302-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 26 16:32:39 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.53  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.56/10.77  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.55/15.79  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.60/20.81  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.64/25.86  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 26.54/26.82  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.nEDw63yGRk/cvc5---1.0.5_3751.smt2
% 26.54/26.82  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.nEDw63yGRk/cvc5---1.0.5_3751.smt2
% 26.63/26.84  (assume a0 (tptp.equalelemsP tptp.nil))
% 26.63/26.84  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 26.63/26.84  (assume a2 (tptp.strictorderedP tptp.nil))
% 26.63/26.84  (assume a3 (tptp.totalorderedP tptp.nil))
% 26.63/26.84  (assume a4 (tptp.strictorderP tptp.nil))
% 26.63/26.84  (assume a5 (tptp.totalorderP tptp.nil))
% 26.63/26.84  (assume a6 (tptp.cyclefreeP tptp.nil))
% 26.63/26.84  (assume a7 (tptp.ssList tptp.nil))
% 26.63/26.84  (assume a8 (tptp.ssItem tptp.skac3))
% 26.63/26.84  (assume a9 (tptp.ssItem tptp.skac2))
% 26.63/26.84  (assume a10 (not (tptp.singletonP tptp.nil)))
% 26.63/26.84  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 26.63/26.84  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 26.63/26.84  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 26.63/26.84  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 26.63/26.84  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 26.63/26.84  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 26.63/26.84  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 26.63/26.84  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 26.63/26.84  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 26.63/26.84  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 26.63/26.84  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 26.63/26.84  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 26.63/26.84  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 26.63/26.84  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 26.63/26.84  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 26.63/26.84  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 26.63/26.84  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 26.63/26.84  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 26.63/26.84  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 26.63/26.84  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 26.63/26.84  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 26.63/26.84  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 26.63/26.84  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 26.63/26.84  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 26.63/26.84  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 26.63/26.84  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 26.63/26.84  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 26.63/26.84  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 26.63/26.84  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 26.63/26.84  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 26.63/26.84  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 26.63/26.84  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 26.63/26.84  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 26.63/26.84  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 26.63/26.84  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 26.63/26.84  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 26.63/26.84  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 26.63/26.84  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 26.63/26.84  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 26.63/26.84  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 26.63/26.84  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 26.63/26.84  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 26.63/26.84  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 26.63/26.84  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 26.63/26.84  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 26.63/26.84  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.63/26.84  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 26.63/26.84  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 26.63/26.84  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 26.63/26.84  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 26.63/26.84  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 26.63/26.84  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.63/26.84  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 26.63/26.84  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.63/26.84  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 26.63/26.84  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 26.63/26.84  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 26.63/26.84  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.63/26.84  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.63/26.84  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.63/26.84  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.63/26.84  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 26.63/26.84  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.63/26.84  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 26.63/26.84  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.63/26.84  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 26.63/26.84  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.63/26.84  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.63/26.84  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.63/26.84  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 26.63/26.84  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 26.63/26.84  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 26.63/26.84  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 26.63/26.84  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 26.63/26.84  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.63/26.84  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.63/26.84  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.63/26.84  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.63/26.84  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 26.63/26.84  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 26.63/26.84  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.63/26.84  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.63/26.84  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 26.63/26.84  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 26.63/26.84  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 26.63/26.84  (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))))
% 26.63/26.84  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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))))
% 26.63/26.84  (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)))))
% 26.63/26.84  (assume a185 (tptp.ssList tptp.sk1))
% 26.63/26.84  (assume a186 (tptp.ssList tptp.sk2))
% 26.63/26.84  (assume a187 (tptp.ssList tptp.sk3))
% 26.63/26.84  (assume a188 (tptp.ssList tptp.sk4))
% 26.63/26.84  (assume a189 (= tptp.sk2 tptp.sk4))
% 26.63/26.84  (assume a190 (= tptp.sk1 tptp.sk3))
% 26.63/26.84  (assume a191 (tptp.segmentP tptp.sk4 tptp.sk3))
% 26.63/26.84  (assume a192 (tptp.totalorderedP tptp.sk3))
% 26.63/26.84  (assume a193 (tptp.ssItem tptp.sk5))
% 26.63/26.84  (assume a194 (tptp.ssItem tptp.sk6))
% 26.63/26.84  (assume a195 (tptp.ssList tptp.sk7))
% 26.63/26.84  (assume a196 (tptp.ssList tptp.sk8))
% 26.63/26.84  (assume a197 (tptp.ssList tptp.sk9))
% 26.63/26.84  (assume a198 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) tptp.sk1))
% 26.63/26.84  (assume a199 (tptp.lt tptp.sk6 tptp.sk5))
% 26.63/26.84  (step t1 (cl (not (= (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk6)))) (not (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6))))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk6))) :rule equiv_pos2)
% 26.63/26.84  (step t2 (cl (= (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.lt tptp.sk6 tptp.sk5)))) :rule refl)
% 26.63/26.84  (step t3 (cl (= (not (= tptp.sk5 tptp.sk6)) (not (= tptp.sk5 tptp.sk6)))) :rule refl)
% 26.63/26.84  (step t4 (cl (= (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) true) (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 26.63/26.84  (step t5 (cl (not (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) true)) (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6))) :rule equiv1 :premises (t4))
% 26.63/26.84  (step t6 (cl (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) (= (tptp.lt tptp.sk6 tptp.sk6) (not (not (tptp.lt tptp.sk6 tptp.sk6)))))) :rule all_simplify)
% 26.63/26.84  (step t7 (cl (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk6))) :rule refl)
% 26.63/26.84  (step t8 (cl (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6))) :rule all_simplify)
% 26.63/26.84  (step t9 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk6)))) :rule cong :premises (t7 t8))
% 26.63/26.84  (step t10 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk6)) true)) :rule all_simplify)
% 26.63/26.84  (step t11 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) true)) :rule trans :premises (t9 t10))
% 26.63/26.84  (step t12 (cl (= (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6)) true)) :rule trans :premises (t6 t11))
% 26.63/26.84  (step t13 (cl (= (not (not (tptp.lt tptp.sk6 tptp.sk6))) (tptp.lt tptp.sk6 tptp.sk6))) :rule resolution :premises (t5 t12))
% 26.63/26.84  (step t14 (cl (= (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk6)))) :rule cong :premises (t2 t3 t13))
% 26.63/26.84  (step t15 (cl (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false) (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) :rule implies_neg1)
% 26.63/26.84  (anchor :step t16)
% 26.63/26.84  (assume t16.a0 (tptp.lt tptp.sk6 tptp.sk5))
% 26.63/26.84  (assume t16.a1 (= tptp.sk5 tptp.sk6))
% 26.63/26.84  (assume t16.a2 (not (tptp.lt tptp.sk6 tptp.sk6)))
% 26.63/26.84  (step t16.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 26.63/26.84  (step t16.t2 (cl (= (= false true) false)) :rule all_simplify)
% 26.63/26.84  (step t16.t3 (cl (= (= (tptp.lt tptp.sk6 tptp.sk6) false) (not (tptp.lt tptp.sk6 tptp.sk6)))) :rule equiv_simplify)
% 26.63/26.84  (step t16.t4 (cl (= (tptp.lt tptp.sk6 tptp.sk6) false) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) :rule equiv2 :premises (t16.t3))
% 26.63/26.84  (step t16.t5 (cl (not (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (tptp.lt tptp.sk6 tptp.sk6)) :rule not_not)
% 26.63/26.84  (step t16.t6 (cl (= (tptp.lt tptp.sk6 tptp.sk6) false) (tptp.lt tptp.sk6 tptp.sk6)) :rule resolution :premises (t16.t4 t16.t5))
% 26.63/26.84  (step t16.t7 (cl (= (tptp.lt tptp.sk6 tptp.sk6) false)) :rule resolution :premises (t16.t6 t16.a2))
% 26.63/26.84  (step t16.t8 (cl (= false (tptp.lt tptp.sk6 tptp.sk6))) :rule symm :premises (t16.t7))
% 26.63/26.84  (step t16.t9 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 26.63/26.84  (step t16.t10 (cl (= tptp.sk6 tptp.sk5)) :rule symm :premises (t16.a1))
% 26.63/26.84  (step t16.t11 (cl (= (tptp.lt tptp.sk6 tptp.sk6) (tptp.lt tptp.sk6 tptp.sk5))) :rule cong :premises (t16.t9 t16.t10))
% 26.63/26.84  (step t16.t12 (cl (= (= (tptp.lt tptp.sk6 tptp.sk5) true) (tptp.lt tptp.sk6 tptp.sk5))) :rule equiv_simplify)
% 26.63/26.84  (step t16.t13 (cl (= (tptp.lt tptp.sk6 tptp.sk5) true) (not (tptp.lt tptp.sk6 tptp.sk5))) :rule equiv2 :premises (t16.t12))
% 26.63/26.84  (step t16.t14 (cl (= (tptp.lt tptp.sk6 tptp.sk5) true)) :rule resolution :premises (t16.t13 t16.a0))
% 26.63/26.84  (step t16.t15 (cl (= false true)) :rule trans :premises (t16.t8 t16.t11 t16.t14))
% 26.63/26.84  (step t16.t16 (cl false) :rule resolution :premises (t16.t1 t16.t2 t16.t15))
% 26.63/26.84  (step t16 (cl (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6))) false) :rule subproof :discharge (t16.a0 t16.a1 t16.a2))
% 26.63/26.84  (step t17 (cl (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (tptp.lt tptp.sk6 tptp.sk5)) :rule and_pos)
% 26.63/26.84  (step t18 (cl (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (= tptp.sk5 tptp.sk6)) :rule and_pos)
% 26.63/26.84  (step t19 (cl (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (tptp.lt tptp.sk6 tptp.sk6))) :rule and_pos)
% 26.63/26.84  (step t20 (cl false (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule resolution :premises (t16 t17 t18 t19))
% 26.63/26.84  (step t21 (cl (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) false) :rule reordering :premises (t20))
% 26.63/26.84  (step t22 (cl (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))) false) :rule contraction :premises (t21))
% 26.63/26.84  (step t23 (cl (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false) false) :rule resolution :premises (t15 t22))
% 26.63/26.84  (step t24 (cl (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false) (not false)) :rule implies_neg2)
% 26.63/26.84  (step t25 (cl (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false) (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false)) :rule resolution :premises (t23 t24))
% 26.63/26.84  (step t26 (cl (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false)) :rule contraction :premises (t25))
% 26.63/26.84  (step t27 (cl (= (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false) (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6)))))) :rule implies_simplify)
% 26.63/26.84  (step t28 (cl (not (=> (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))) false)) (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule equiv1 :premises (t27))
% 26.63/26.84  (step t29 (cl (not (and (tptp.lt tptp.sk6 tptp.sk5) (= tptp.sk5 tptp.sk6) (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule resolution :premises (t26 t28))
% 26.63/26.84  (step t30 (cl (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) :rule not_and :premises (t29))
% 26.63/26.84  (step t31 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (not (tptp.lt tptp.sk6 tptp.sk5)))) :rule or_neg)
% 26.63/26.84  (step t32 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (not (= tptp.sk5 tptp.sk6)))) :rule or_neg)
% 26.63/26.84  (step t33 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (not (not (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule or_neg)
% 26.63/26.84  (step t34 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule resolution :premises (t30 t31 t32 t33))
% 26.63/26.84  (step t35 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (not (not (tptp.lt tptp.sk6 tptp.sk6))))) :rule contraction :premises (t34))
% 26.63/26.84  (step t36 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk6))) :rule resolution :premises (t1 t14 t35))
% 26.63/26.84  (step t37 (cl (not (tptp.lt tptp.sk6 tptp.sk5)) (not (= tptp.sk5 tptp.sk6)) (tptp.lt tptp.sk6 tptp.sk6)) :rule or :premises (t36))
% 26.63/26.84  (step t38 (cl (not (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6)) :rule or_pos)
% 26.63/26.84  (step t39 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6) (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6)))) :rule reordering :premises (t38))
% 26.63/26.84  (step t40 (cl (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6)) :rule or_pos)
% 26.63/26.84  (step t41 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk9)) (tptp.leq tptp.sk5 tptp.sk6) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6)))) :rule reordering :premises (t40))
% 26.63/26.84  (step t42 (cl (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_neg)
% 26.63/26.84  (step t43 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule implies_neg1)
% 26.63/26.84  (anchor :step t44)
% 26.63/26.84  (assume t44.a0 (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))
% 26.63/26.84  (assume t44.a1 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))
% 26.63/26.84  (assume t44.a2 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.63/26.84  (assume t44.a3 (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))
% 26.63/26.84  (assume t44.a4 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.63/26.84  (step t44.t1 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule implies_neg1)
% 26.63/26.84  (anchor :step t44.t2)
% 26.63/26.84  (assume t44.t2.a0 (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))
% 26.63/26.84  (assume t44.t2.a1 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.63/26.84  (assume t44.t2.a2 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))
% 26.63/26.84  (assume t44.t2.a3 (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))
% 26.63/26.84  (assume t44.t2.a4 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.63/26.84  (step t44.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) true) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule equiv_simplify)
% 26.63/26.84  (step t44.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) true)) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule equiv1 :premises (t44.t2.t1))
% 26.63/26.84  (step t44.t2.t3 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 26.63/26.84  (step t44.t2.t4 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))) :rule symm :premises (t44.t2.a3))
% 26.63/26.84  (step t44.t2.t5 (cl (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule symm :premises (t44.t2.t4))
% 26.63/26.84  (step t44.t2.t6 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule cong :premises (t44.t2.t3 t44.t2.t5))
% 26.63/26.84  (step t44.t2.t7 (cl (= (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) :rule symm :premises (t44.t2.a2))
% 26.63/26.84  (step t44.t2.t8 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) :rule trans :premises (t44.t2.t6 t44.t2.t7))
% 26.63/26.84  (step t44.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))) :rule symm :premises (t44.t2.a4))
% 26.63/26.84  (step t44.t2.t10 (cl (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule symm :premises (t44.t2.t9))
% 26.63/26.84  (step t44.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule cong :premises (t44.t2.t8 t44.t2.t10))
% 26.63/26.84  (step t44.t2.t12 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (t44.t2.a1))
% 26.63/26.84  (step t44.t2.t13 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule trans :premises (t44.t2.t11 t44.t2.t12))
% 26.63/26.84  (step t44.t2.t14 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t44.t2.t13))
% 26.63/26.84  (step t44.t2.t15 (cl (= (= (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule equiv_simplify)
% 26.63/26.84  (step t44.t2.t16 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule equiv2 :premises (t44.t2.t15))
% 26.63/26.84  (step t44.t2.t17 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true)) :rule resolution :premises (t44.t2.t16 t44.t2.a0))
% 26.63/26.84  (step t44.t2.t18 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) true)) :rule trans :premises (t44.t2.t14 t44.t2.t17))
% 26.63/26.84  (step t44.t2.t19 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t44.t2.t2 t44.t2.t18))
% 26.63/26.84  (step t44.t2 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule subproof :discharge (t44.t2.a0 t44.t2.a1 t44.t2.a2 t44.t2.a3 t44.t2.a4))
% 26.63/26.84  (step t44.t3 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and_pos)
% 26.63/26.84  (step t44.t4 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.63/26.84  (step t44.t5 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule and_pos)
% 26.63/26.84  (step t44.t6 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule and_pos)
% 26.63/26.84  (step t44.t7 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.63/26.84  (step t44.t8 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t44.t2 t44.t3 t44.t4 t44.t5 t44.t6 t44.t7))
% 26.63/26.84  (step t44.t9 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule reordering :premises (t44.t8))
% 26.63/26.84  (step t44.t10 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule contraction :premises (t44.t9))
% 26.63/26.84  (step t44.t11 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t44.t1 t44.t10))
% 26.63/26.84  (step t44.t12 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule implies_neg2)
% 26.63/26.84  (step t44.t13 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule resolution :premises (t44.t11 t44.t12))
% 26.63/26.84  (step t44.t14 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule contraction :premises (t44.t13))
% 26.63/26.84  (step t44.t15 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule implies :premises (t44.t14))
% 26.63/26.84  (step t44.t16 (cl (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_neg)
% 26.63/26.84  (step t44.t17 (cl (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule resolution :premises (t44.t16 t44.a0 t44.a2 t44.a1 t44.a3 t44.a4))
% 26.63/26.84  (step t44.t18 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t44.t15 t44.t17))
% 26.63/26.84  (step t44 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule subproof :discharge (t44.a0 t44.a1 t44.a2 t44.a3 t44.a4))
% 26.63/26.84  (step t45 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and_pos)
% 26.63/26.84  (step t46 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule and_pos)
% 26.63/26.84  (step t47 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.63/26.84  (step t48 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule and_pos)
% 26.63/26.84  (step t49 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.63/26.84  (step t50 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t44 t45 t46 t47 t48 t49))
% 26.63/26.84  (step t51 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule reordering :premises (t50))
% 26.63/26.84  (step t52 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule contraction :premises (t51))
% 26.63/26.84  (step t53 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t43 t52))
% 26.63/26.84  (step t54 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule implies_neg2)
% 26.63/26.84  (step t55 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule resolution :premises (t53 t54))
% 26.63/26.84  (step t56 (cl (=> (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule contraction :premises (t55))
% 26.63/26.84  (step t57 (cl (not (and (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule implies :premises (t56))
% 26.63/26.84  (step t58 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t42 t57))
% 26.63/26.84  (step t59 (cl (not (= (tptp.ssList tptp.sk1) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (tptp.ssList tptp.sk1)) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule equiv_pos2)
% 26.63/26.84  (step t60 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.63/26.84  (step t61 (cl (not (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule equiv_pos2)
% 26.63/26.84  (step t62 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.63/26.84  (step t63 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t62 a190 a189))
% 26.63/26.84  (step t64 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t63))
% 26.63/26.84  (step t65 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule refl)
% 26.63/26.84  (step t66 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t64 t65))
% 26.63/26.84  (step t67 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (a198))
% 26.63/26.84  (step t68 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t61 t66 t67))
% 26.63/26.84  (step t69 (cl (and (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t60 t68 a190 a189))
% 26.63/26.84  (step t70 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t69))
% 26.63/26.84  (step t71 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and :premises (t69))
% 26.63/26.84  (step t72 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule trans :premises (t70 t71))
% 26.63/26.84  (step t73 (cl (= (tptp.ssList tptp.sk1) (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t72))
% 26.63/26.84  (step t74 (cl (tptp.ssList (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t59 t73 a185))
% 26.63/26.84  (step t75 (cl (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule or_pos)
% 26.63/26.84  (step t76 (cl (not (tptp.ssList tptp.sk7)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) :rule reordering :premises (t75))
% 26.63/26.84  (step t77 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 26.63/26.84  (step t78 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t77))
% 26.63/26.84  (step t79 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 26.63/26.84  (anchor :step t80)
% 26.63/26.84  (assume t80.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.63/26.84  (step t80.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 26.63/26.84  (step t80.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t80.t1))
% 26.63/26.84  (step t80.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t80.t2 t80.a0))
% 26.63/26.84  (step t80 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t80.a0))
% 26.63/26.84  (step t81 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t79 t80))
% 26.63/26.84  (step t82 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 26.63/26.84  (step t83 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t81 t82))
% 26.63/26.84  (step t84 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t83))
% 26.63/26.84  (step t85 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t84))
% 26.63/26.84  (step t86 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t85 a85))
% 26.63/26.84  (step t87 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t78 a7 a193 t86))
% 26.63/26.84  (step t88 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) (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)
% 26.63/26.84  (anchor :step t89)
% 26.63/26.84  (assume t89.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))))))
% 26.63/26.84  (step t89.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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) :rule forall_inst :args ((:= U tptp.sk8) (:= V (tptp.cons tptp.sk5 tptp.nil)) (:= W tptp.sk7)))
% 26.63/26.84  (step t89.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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule or :premises (t89.t1))
% 26.63/26.84  (step t89.t3 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule resolution :premises (t89.t2 t89.a0))
% 26.63/26.84  (step t89 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule subproof :discharge (t89.a0))
% 26.63/26.84  (step t90 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule resolution :premises (t88 t89))
% 26.63/26.84  (step t91 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) :rule implies_neg2)
% 26.63/26.84  (step t92 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) (=> (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) :rule resolution :premises (t90 t91))
% 26.63/26.84  (step t93 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) :rule contraction :premises (t92))
% 26.63/26.84  (step t94 (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.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule implies :premises (t93))
% 26.63/26.84  (step t95 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule resolution :premises (t94 a148))
% 26.63/26.84  (step t96 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule resolution :premises (t76 a195 a196 t87 t95))
% 26.63/26.84  (step t97 (cl (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule or_pos)
% 26.63/26.84  (step t98 (cl (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule reordering :premises (t97))
% 26.63/26.84  (step t99 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule or_pos)
% 26.63/26.85  (step t100 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule reordering :premises (t99))
% 26.63/26.85  (step t101 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t102)
% 26.63/26.85  (assume t102.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.63/26.85  (step t102.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.nil)))
% 26.63/26.85  (step t102.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule or :premises (t102.t1))
% 26.63/26.85  (step t102.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t102.t2 t102.a0))
% 26.63/26.85  (step t102 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule subproof :discharge (t102.a0))
% 26.63/26.85  (step t103 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t101 t102))
% 26.63/26.85  (step t104 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 26.63/26.85  (step t105 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule resolution :premises (t103 t104))
% 26.63/26.85  (step t106 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))))) :rule contraction :premises (t105))
% 26.63/26.85  (step t107 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule implies :premises (t106))
% 26.63/26.85  (step t108 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk6 tptp.nil)))) :rule resolution :premises (t107 a85))
% 26.63/26.85  (step t109 (cl (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) :rule resolution :premises (t100 a7 a194 t108))
% 26.63/26.85  (step t110 (cl (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) :rule or_pos)
% 26.63/26.85  (step t111 (cl (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))))) :rule reordering :premises (t110))
% 26.63/26.85  (step t112 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 26.63/26.85  (step t113 (cl (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t112))
% 26.63/26.85  (step t114 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t115)
% 26.63/26.85  (assume t115.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.63/26.85  (step t115.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk7)))
% 26.63/26.85  (step t115.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t115.t1))
% 26.63/26.85  (step t115.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t115.t2 t115.a0))
% 26.63/26.85  (step t115 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t115.a0))
% 26.63/26.85  (step t116 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t114 t115))
% 26.63/26.85  (step t117 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 26.63/26.85  (step t118 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t116 t117))
% 26.63/26.85  (step t119 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t118))
% 26.63/26.85  (step t120 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t119))
% 26.63/26.85  (step t121 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t120 a84))
% 26.63/26.85  (step t122 (cl (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t113 a195 t87 t121))
% 26.63/26.85  (step t123 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t124)
% 26.63/26.85  (assume t124.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.63/26.85  (step t124.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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))))) :rule forall_inst :args ((:= U tptp.sk8) (:= V (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))))
% 26.63/26.85  (step t124.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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) :rule or :premises (t124.t1))
% 26.63/26.85  (step t124.t3 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t124.t2 t124.a0))
% 26.63/26.85  (step t124 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) :rule subproof :discharge (t124.a0))
% 26.63/26.85  (step t125 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t123 t124))
% 26.63/26.85  (step t126 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))))) :rule implies_neg2)
% 26.63/26.85  (step t127 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) (=> (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))))) :rule resolution :premises (t125 t126))
% 26.63/26.85  (step t128 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))))) :rule contraction :premises (t127))
% 26.63/26.85  (step t129 (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.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) :rule implies :premises (t128))
% 26.63/26.85  (step t130 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t129 a84))
% 26.63/26.85  (step t131 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) :rule resolution :premises (t111 a196 t122 t130))
% 26.63/26.85  (step t132 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (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)
% 26.63/26.85  (anchor :step t133)
% 26.63/26.85  (assume t133.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))))))
% 26.63/26.85  (step t133.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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule forall_inst :args ((:= U tptp.sk9) (:= V (tptp.cons tptp.sk6 tptp.nil)) (:= W (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))))
% 26.63/26.85  (step t133.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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule or :premises (t133.t1))
% 26.63/26.85  (step t133.t3 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t133.t2 t133.a0))
% 26.63/26.85  (step t133 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule subproof :discharge (t133.a0))
% 26.63/26.85  (step t134 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t132 t133))
% 26.63/26.85  (step t135 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule implies_neg2)
% 26.63/26.85  (step t136 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) (=> (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule resolution :premises (t134 t135))
% 26.63/26.85  (step t137 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule contraction :premises (t136))
% 26.63/26.85  (step t138 (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.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule implies :premises (t137))
% 26.63/26.85  (step t139 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList (tptp.cons tptp.sk6 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t138 a148))
% 26.63/26.85  (step t140 (cl (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule resolution :premises (t98 a197 t109 t131 t139))
% 26.63/26.85  (step t141 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule or_pos)
% 26.63/26.85  (step t142 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule reordering :premises (t141))
% 26.63/26.85  (step t143 (cl (not (= (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) (not (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))))) (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule equiv_pos2)
% 26.63/26.85  (step t144 (cl (= (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)))) (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)))))) :rule refl)
% 26.63/26.85  (step t145 (cl (= (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule refl)
% 26.63/26.85  (step t146 (cl (= (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk8)))) :rule refl)
% 26.63/26.85  (step t147 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule all_simplify)
% 26.63/26.85  (step t148 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule cong :premises (t145 t146 t147))
% 26.63/26.85  (step t149 (cl (= (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))))) :rule cong :premises (t144 t148))
% 26.63/26.85  (step t150 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) (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))))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t151)
% 26.63/26.85  (assume t151.a0 (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)))))
% 26.63/26.85  (step t151.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk8)))
% 26.63/26.85  (step t151.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) :rule or :premises (t151.t1))
% 26.63/26.85  (step t151.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) :rule resolution :premises (t151.t2 t151.a0))
% 26.63/26.85  (step t151 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) :rule subproof :discharge (t151.a0))
% 26.63/26.85  (step t152 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) :rule resolution :premises (t150 t151))
% 26.63/26.85  (step t153 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))))) :rule implies_neg2)
% 26.63/26.85  (step t154 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))))) :rule resolution :premises (t152 t153))
% 26.63/26.85  (step t155 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))))) :rule contraction :premises (t154))
% 26.63/26.85  (step t156 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))) :rule resolution :premises (t143 t149 t155))
% 26.63/26.85  (step t157 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule implies :premises (t156))
% 26.63/26.85  (step t158 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk8)) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule resolution :premises (t157 a119))
% 26.63/26.85  (step t159 (cl (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule resolution :premises (t142 a193 a196 t158))
% 26.63/26.85  (step t160 (cl (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule or_pos)
% 26.63/26.85  (step t161 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule reordering :premises (t160))
% 26.63/26.85  (step t162 (cl (not (= (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) (not (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule equiv_pos2)
% 26.63/26.85  (step t163 (cl (= (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule refl)
% 26.63/26.85  (step t164 (cl (= (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk9)))) :rule refl)
% 26.63/26.85  (step t165 (cl (= (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule all_simplify)
% 26.63/26.85  (step t166 (cl (= (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule cong :premises (t163 t164 t165))
% 26.63/26.85  (step t167 (cl (= (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))))) :rule cong :premises (t144 t166))
% 26.63/26.85  (step t168 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (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))))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t169)
% 26.63/26.85  (assume t169.a0 (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)))))
% 26.63/26.85  (step t169.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk9)))
% 26.63/26.85  (step t169.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule or :premises (t169.t1))
% 26.63/26.85  (step t169.t3 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t169.t2 t169.a0))
% 26.63/26.85  (step t169 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule subproof :discharge (t169.a0))
% 26.63/26.85  (step t170 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t168 t169))
% 26.63/26.85  (step t171 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (not (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule implies_neg2)
% 26.63/26.85  (step t172 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule resolution :premises (t170 t171))
% 26.63/26.85  (step t173 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))))) :rule contraction :premises (t172))
% 26.63/26.85  (step t174 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t162 t167 t173))
% 26.63/26.85  (step t175 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule implies :premises (t174))
% 26.63/26.85  (step t176 (cl (or (not (tptp.ssItem tptp.sk6)) (not (tptp.ssList tptp.sk9)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule resolution :premises (t175 a119))
% 26.63/26.85  (step t177 (cl (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule resolution :premises (t161 a194 a197 t176))
% 26.63/26.85  (step t178 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t58 t74 t96 t140 t159 t177))
% 26.63/26.85  (step t179 (cl (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_neg)
% 26.63/26.85  (step t180 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t181)
% 26.63/26.85  (assume t181.a0 (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))
% 26.63/26.85  (assume t181.a1 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))
% 26.63/26.85  (assume t181.a2 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.63/26.85  (assume t181.a3 (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))
% 26.63/26.85  (assume t181.a4 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.63/26.85  (step t181.t1 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t181.t2)
% 26.63/26.85  (assume t181.t2.a0 (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))
% 26.63/26.85  (assume t181.t2.a1 (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))
% 26.63/26.85  (assume t181.t2.a2 (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))))
% 26.63/26.85  (assume t181.t2.a3 (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))
% 26.63/26.85  (assume t181.t2.a4 (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))
% 26.63/26.85  (step t181.t2.t1 (cl (= (= (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) true) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule equiv_simplify)
% 26.63/26.85  (step t181.t2.t2 (cl (not (= (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) true)) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule equiv1 :premises (t181.t2.t1))
% 26.63/26.85  (step t181.t2.t3 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 26.63/26.85  (step t181.t2.t4 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8) (tptp.cons tptp.sk5 tptp.sk8))) :rule symm :premises (t181.t2.a3))
% 26.63/26.85  (step t181.t2.t5 (cl (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule symm :premises (t181.t2.t4))
% 26.63/26.85  (step t181.t2.t6 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule cong :premises (t181.t2.t3 t181.t2.t5))
% 26.63/26.85  (step t181.t2.t7 (cl (= (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) :rule symm :premises (t181.t2.a2))
% 26.63/26.85  (step t181.t2.t8 (cl (= (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8))) :rule trans :premises (t181.t2.t6 t181.t2.t7))
% 26.63/26.85  (step t181.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9) (tptp.cons tptp.sk6 tptp.sk9))) :rule symm :premises (t181.t2.a4))
% 26.63/26.85  (step t181.t2.t10 (cl (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule symm :premises (t181.t2.t9))
% 26.63/26.85  (step t181.t2.t11 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule cong :premises (t181.t2.t8 t181.t2.t10))
% 26.63/26.85  (step t181.t2.t12 (cl (= (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule symm :premises (t181.t2.a1))
% 26.63/26.85  (step t181.t2.t13 (cl (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)) (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule trans :premises (t181.t2.t11 t181.t2.t12))
% 26.63/26.85  (step t181.t2.t14 (cl (= (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t181.t2.t13))
% 26.63/26.85  (step t181.t2.t15 (cl (= (= (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule equiv_simplify)
% 26.63/26.85  (step t181.t2.t16 (cl (= (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true) (not (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule equiv2 :premises (t181.t2.t15))
% 26.63/26.85  (step t181.t2.t17 (cl (= (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) true)) :rule resolution :premises (t181.t2.t16 t181.t2.a0))
% 26.63/26.85  (step t181.t2.t18 (cl (= (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) true)) :rule trans :premises (t181.t2.t14 t181.t2.t17))
% 26.63/26.85  (step t181.t2.t19 (cl (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t181.t2.t2 t181.t2.t18))
% 26.63/26.85  (step t181.t2 (cl (not (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule subproof :discharge (t181.t2.a0 t181.t2.a1 t181.t2.a2 t181.t2.a3 t181.t2.a4))
% 26.63/26.85  (step t181.t3 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and_pos)
% 26.63/26.85  (step t181.t4 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.63/26.85  (step t181.t5 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule and_pos)
% 26.63/26.85  (step t181.t6 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule and_pos)
% 26.63/26.85  (step t181.t7 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.63/26.85  (step t181.t8 (cl (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t181.t2 t181.t3 t181.t4 t181.t5 t181.t6 t181.t7))
% 26.63/26.85  (step t181.t9 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule reordering :premises (t181.t8))
% 26.63/26.85  (step t181.t10 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule contraction :premises (t181.t9))
% 26.63/26.85  (step t181.t11 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t181.t1 t181.t10))
% 26.63/26.85  (step t181.t12 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule implies_neg2)
% 26.63/26.85  (step t181.t13 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule resolution :premises (t181.t11 t181.t12))
% 26.63/26.85  (step t181.t14 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule contraction :premises (t181.t13))
% 26.63/26.85  (step t181.t15 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule implies :premises (t181.t14))
% 26.63/26.85  (step t181.t16 (cl (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (not (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_neg)
% 26.63/26.85  (step t181.t17 (cl (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule resolution :premises (t181.t16 t181.a0 t181.a2 t181.a1 t181.a3 t181.a4))
% 26.63/26.85  (step t181.t18 (cl (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t181.t15 t181.t17))
% 26.63/26.85  (step t181 (cl (not (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule subproof :discharge (t181.a0 t181.a1 t181.a2 t181.a3 t181.a4))
% 26.63/26.85  (step t182 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and_pos)
% 26.63/26.85  (step t183 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) :rule and_pos)
% 26.63/26.85  (step t184 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) :rule and_pos)
% 26.63/26.85  (step t185 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) :rule and_pos)
% 26.63/26.85  (step t186 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) :rule and_pos)
% 26.63/26.85  (step t187 (cl (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))))) :rule resolution :premises (t181 t182 t183 t184 t185 t186))
% 26.63/26.85  (step t188 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule reordering :premises (t187))
% 26.63/26.85  (step t189 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule contraction :premises (t188))
% 26.63/26.85  (step t190 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t180 t189))
% 26.63/26.85  (step t191 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule implies_neg2)
% 26.63/26.85  (step t192 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule resolution :premises (t190 t191))
% 26.63/26.85  (step t193 (cl (=> (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9))))) :rule contraction :premises (t192))
% 26.63/26.85  (step t194 (cl (not (and (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)) (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)) (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule implies :premises (t193))
% 26.63/26.85  (step t195 (cl (not (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) (not (= (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app tptp.sk7 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8)))) (not (= (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9) (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9)))) (not (= (tptp.cons tptp.sk5 tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk8))) (not (= (tptp.cons tptp.sk6 tptp.sk9) (tptp.app (tptp.cons tptp.sk6 tptp.nil) tptp.sk9))) (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t179 t194))
% 26.63/26.85  (step t196 (cl (not (= (tptp.totalorderedP tptp.sk3) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) (not (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule equiv_pos2)
% 26.63/26.85  (step t197 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule and :premises (t69))
% 26.63/26.85  (step t198 (cl (= (tptp.totalorderedP tptp.sk3) (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9)))) :rule cong :premises (t197))
% 26.63/26.85  (step t199 (cl (tptp.totalorderedP (tptp.app (tptp.app (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk8) (tptp.cons tptp.sk6 tptp.nil)) tptp.sk9))) :rule resolution :premises (t196 t198 a192))
% 26.63/26.85  (step t200 (cl (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) :rule resolution :premises (t195 t199 t96 t140 t159 t177))
% 26.63/26.85  (step t201 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t202)
% 26.63/26.85  (assume t202.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))))
% 26.63/26.85  (step t202.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.sk5) (:= W tptp.sk8) (:= X tptp.sk6) (:= Y tptp.sk9)))
% 26.63/26.85  (step t202.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) :rule or :premises (t202.t1))
% 26.63/26.85  (step t202.t3 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t202.t2 t202.a0))
% 26.63/26.85  (step t202 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) :rule subproof :discharge (t202.a0))
% 26.63/26.85  (step t203 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t201 t202))
% 26.63/26.85  (step t204 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6)))) :rule implies_neg2)
% 26.63/26.85  (step t205 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6)))) :rule resolution :premises (t203 t204))
% 26.63/26.85  (step t206 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6)))) :rule contraction :premises (t205))
% 26.63/26.85  (step t207 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) :rule implies :premises (t206))
% 26.63/26.85  (step t208 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) :rule equiv_pos2)
% 26.63/26.85  (anchor :step t209 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y) (Z $$unsorted) (:= Z Z)))
% 26.63/26.85  (step t209.t1 (cl (= U U)) :rule refl)
% 26.63/26.85  (step t209.t2 (cl (= V V)) :rule refl)
% 26.63/26.85  (step t209.t3 (cl (= W W)) :rule refl)
% 26.63/26.85  (step t209.t4 (cl (= X X)) :rule refl)
% 26.63/26.85  (step t209.t5 (cl (= Y Y)) :rule refl)
% 26.63/26.85  (step t209.t6 (cl (= Z Z)) :rule refl)
% 26.63/26.85  (step t209.t7 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z) (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y))))) :rule all_simplify)
% 26.63/26.85  (step t209.t8 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule cong :premises (t209.t7))
% 26.63/26.85  (step t209.t9 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 26.63/26.85  (step t209.t10 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 26.63/26.85  (step t209.t11 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.63/26.85  (step t209.t12 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 26.63/26.85  (step t209.t13 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.63/26.85  (step t209.t14 (cl (= (not (tptp.totalorderedP Z)) (not (tptp.totalorderedP Z)))) :rule refl)
% 26.63/26.85  (step t209.t15 (cl (= (not (tptp.ssList Z)) (not (tptp.ssList Z)))) :rule refl)
% 26.63/26.85  (step t209.t16 (cl (= (tptp.leq V X) (tptp.leq V X))) :rule refl)
% 26.63/26.85  (step t209.t17 (cl (= (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)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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)))) :rule cong :premises (t209.t8 t209.t9 t209.t10 t209.t11 t209.t12 t209.t13 t209.t14 t209.t15 t209.t16))
% 26.63/26.85  (step t209 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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))))) :rule bind)
% 26.63/26.85  (step t210 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))))) :rule all_simplify)
% 26.63/26.85  (anchor :step t211 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 26.63/26.85  (step t211.t1 (cl (= U U)) :rule refl)
% 26.63/26.85  (step t211.t2 (cl (= V V)) :rule refl)
% 26.63/26.85  (step t211.t3 (cl (= W W)) :rule refl)
% 26.63/26.85  (step t211.t4 (cl (= X X)) :rule refl)
% 26.63/26.85  (step t211.t5 (cl (= Y Y)) :rule refl)
% 26.63/26.85  (step t211.t6 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y))) true)) :rule all_simplify)
% 26.63/26.85  (step t211.t7 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not true))) :rule cong :premises (t211.t6))
% 26.63/26.85  (step t211.t8 (cl (= (not true) false)) :rule all_simplify)
% 26.63/26.85  (step t211.t9 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) false)) :rule trans :premises (t211.t7 t211.t8))
% 26.63/26.85  (step t211.t10 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 26.63/26.85  (step t211.t11 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 26.63/26.85  (step t211.t12 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.63/26.85  (step t211.t13 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 26.63/26.85  (step t211.t14 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.63/26.85  (step t211.t15 (cl (= (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule refl)
% 26.63/26.85  (step t211.t16 (cl (= (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule refl)
% 26.63/26.85  (step t211.t17 (cl (= (tptp.leq V X) (tptp.leq V X))) :rule refl)
% 26.63/26.85  (step t211.t18 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)) (or false (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) :rule cong :premises (t211.t9 t211.t10 t211.t11 t211.t12 t211.t13 t211.t14 t211.t15 t211.t16 t211.t17))
% 26.63/26.85  (step t211.t19 (cl (= (or false (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) :rule all_simplify)
% 26.63/26.85  (step t211.t20 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) :rule trans :premises (t211.t18 t211.t19))
% 26.63/26.85  (step t211 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))))) :rule bind)
% 26.63/26.85  (step t212 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))))) :rule trans :premises (t210 t211))
% 26.63/26.85  (step t213 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X))))) :rule trans :premises (t209 t212))
% 26.63/26.85  (step t214 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.leq V X)))) :rule resolution :premises (t208 t213 a181))
% 26.63/26.85  (step t215 (cl (or (not (tptp.ssList tptp.sk9)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssItem tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.totalorderedP (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk7 (tptp.cons tptp.sk5 tptp.sk8)) (tptp.cons tptp.sk6 tptp.sk9)))) (tptp.leq tptp.sk5 tptp.sk6))) :rule resolution :premises (t207 t214))
% 26.63/26.85  (step t216 (cl (tptp.leq tptp.sk5 tptp.sk6)) :rule resolution :premises (t41 a193 a194 a195 a196 a197 t178 t200 t215))
% 26.63/26.85  (step t217 (cl (not (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5)) :rule or_pos)
% 26.63/26.85  (step t218 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (not (tptp.lt tptp.sk6 tptp.sk5)) (tptp.leq tptp.sk6 tptp.sk5) (not (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5)))) :rule reordering :premises (t217))
% 26.63/26.85  (step t219 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t220)
% 26.63/26.85  (assume t220.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 26.63/26.85  (step t220.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk5)))
% 26.63/26.85  (step t220.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) :rule or :premises (t220.t1))
% 26.63/26.85  (step t220.t3 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) :rule resolution :premises (t220.t2 t220.a0))
% 26.63/26.85  (step t220 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) :rule subproof :discharge (t220.a0))
% 26.63/26.85  (step t221 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) :rule resolution :premises (t219 t220))
% 26.63/26.85  (step t222 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) (not (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5)))) :rule implies_neg2)
% 26.63/26.85  (step t223 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5)))) :rule resolution :premises (t221 t222))
% 26.63/26.85  (step t224 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5)))) :rule contraction :premises (t223))
% 26.63/26.85  (step t225 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) :rule implies :premises (t224))
% 26.63/26.85  (step t226 (cl (or (not (tptp.lt tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (tptp.leq tptp.sk6 tptp.sk5))) :rule resolution :premises (t225 a102))
% 26.63/26.85  (step t227 (cl (tptp.leq tptp.sk6 tptp.sk5)) :rule resolution :premises (t218 a193 a194 a199 t226))
% 26.63/26.85  (step t228 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t229)
% 26.63/26.85  (assume t229.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))
% 26.63/26.85  (step t229.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk6)))
% 26.63/26.85  (step t229.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) :rule or :premises (t229.t1))
% 26.63/26.85  (step t229.t3 (cl (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) :rule resolution :premises (t229.t2 t229.a0))
% 26.63/26.85  (step t229 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) :rule subproof :discharge (t229.a0))
% 26.63/26.85  (step t230 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) :rule resolution :premises (t228 t229))
% 26.63/26.85  (step t231 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) (not (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6)))) :rule implies_neg2)
% 26.63/26.85  (step t232 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6)))) :rule resolution :premises (t230 t231))
% 26.63/26.85  (step t233 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6)))) :rule contraction :premises (t232))
% 26.63/26.85  (step t234 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) :rule implies :premises (t233))
% 26.63/26.85  (step t235 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule equiv_pos2)
% 26.63/26.85  (anchor :step t236 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.63/26.85  (step t236.t1 (cl (= U U)) :rule refl)
% 26.63/26.85  (step t236.t2 (cl (= V V)) :rule refl)
% 26.63/26.85  (step t236.t3 (cl (= (not (tptp.leq U V)) (not (tptp.leq U V)))) :rule refl)
% 26.63/26.85  (step t236.t4 (cl (= (not (tptp.leq V U)) (not (tptp.leq V U)))) :rule refl)
% 26.63/26.85  (step t236.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 26.63/26.85  (step t236.t6 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 26.63/26.85  (step t236.t7 (cl (= (= V U) (= U V))) :rule all_simplify)
% 26.63/26.85  (step t236.t8 (cl (= (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule cong :premises (t236.t3 t236.t4 t236.t5 t236.t6 t236.t7))
% 26.63/26.85  (step t236 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V))))) :rule bind)
% 26.63/26.85  (step t237 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= U V)))) :rule resolution :premises (t235 t236 a129))
% 26.63/26.85  (step t238 (cl (or (not (tptp.leq tptp.sk5 tptp.sk6)) (not (tptp.leq tptp.sk6 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk6)) (= tptp.sk5 tptp.sk6))) :rule resolution :premises (t234 t237))
% 26.63/26.85  (step t239 (cl (= tptp.sk5 tptp.sk6)) :rule resolution :premises (t39 a193 a194 t216 t227 t238))
% 26.63/26.85  (step t240 (cl (not (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))) :rule or_pos)
% 26.63/26.85  (step t241 (cl (not (tptp.ssItem tptp.sk6)) (not (tptp.lt tptp.sk6 tptp.sk6)) (not (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule reordering :premises (t240))
% 26.63/26.85  (step t242 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) :rule implies_neg1)
% 26.63/26.85  (anchor :step t243)
% 26.63/26.85  (assume t243.a0 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.63/26.85  (step t243.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 26.63/26.85  (step t243.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule or :premises (t243.t1))
% 26.63/26.85  (step t243.t3 (cl (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t243.t2 t243.a0))
% 26.63/26.85  (step t243 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule subproof :discharge (t243.a0))
% 26.63/26.85  (step t244 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t242 t243))
% 26.63/26.85  (step t245 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (not (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule implies_neg2)
% 26.63/26.85  (step t246 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule resolution :premises (t244 t245))
% 26.63/26.85  (step t247 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6))))) :rule contraction :premises (t246))
% 26.63/26.85  (step t248 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule implies :premises (t247))
% 26.63/26.85  (step t249 (cl (or (not (tptp.lt tptp.sk6 tptp.sk6)) (not (tptp.ssItem tptp.sk6)))) :rule resolution :premises (t248 a62))
% 26.63/26.85  (step t250 (cl (not (tptp.lt tptp.sk6 tptp.sk6))) :rule resolution :premises (t241 a194 t249))
% 26.63/26.85  (step t251 (cl) :rule resolution :premises (t37 t239 t250 a199))
% 26.63/26.85  
% 26.63/26.85  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.nEDw63yGRk/cvc5---1.0.5_3751.smt2
% 26.63/26.85  % cvc5---1.0.5 exiting
% 26.63/26.85  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------