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

% Computer : n021.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:05 EDT 2024

% Result   : Unsatisfiable 1.82s 2.04s
% Output   : Proof 1.91s
% Verified : 
% SZS Type : -

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