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

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

% Result   : Unsatisfiable 0.90s 1.11s
% Output   : Proof 0.90s
% Verified : 
% SZS Type : -

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