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