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

% Computer : n014.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:00:03 EDT 2024

% Result   : Unsatisfiable 0.62s 0.84s
% Output   : Proof 0.69s
% Verified : 
% SZS Type : -

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