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

% Computer : n007.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:06 EDT 2024

% Result   : Unsatisfiable 0.41s 0.96s
% Output   : Proof 0.41s
% Verified : 
% SZS Type : -

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