TSTP Solution File: SWC182-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC182-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:00:50 EDT 2024
% Result : Unsatisfiable 0.36s 0.65s
% Output : Proof 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWC182-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.15 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 26 15:31:24 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.52 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.36/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.0g1mIJ7EJe/cvc5---1.0.5_32753.smt2
% 0.36/0.65 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.0g1mIJ7EJe/cvc5---1.0.5_32753.smt2
% 0.36/0.67 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.36/0.67 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.36/0.67 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.36/0.67 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.36/0.67 (assume a4 (tptp.strictorderP tptp.nil))
% 0.36/0.67 (assume a5 (tptp.totalorderP tptp.nil))
% 0.36/0.67 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.36/0.67 (assume a7 (tptp.ssList tptp.nil))
% 0.36/0.67 (assume a8 (tptp.ssItem tptp.skac3))
% 0.36/0.67 (assume a9 (tptp.ssItem tptp.skac2))
% 0.36/0.67 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.36/0.67 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.36/0.67 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.36/0.67 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.36/0.67 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.36/0.67 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.36/0.67 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.36/0.67 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.36/0.67 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.36/0.67 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.36/0.67 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.36/0.67 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.36/0.67 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.36/0.67 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.36/0.67 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.36/0.67 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.36/0.67 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.36/0.67 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.36/0.67 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.36/0.67 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.36/0.67 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.36/0.67 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.36/0.67 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.36/0.67 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.36/0.67 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.36/0.67 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.36/0.67 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.36/0.67 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.36/0.67 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.36/0.67 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.36/0.67 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.36/0.67 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.36/0.67 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.36/0.67 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.36/0.67 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.36/0.67 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.36/0.67 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.36/0.67 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.36/0.67 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.36/0.67 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.36/0.67 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.36/0.67 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.36/0.67 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.36/0.67 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.36/0.67 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.36/0.67 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.36/0.67 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.36/0.67 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.36/0.67 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.36/0.67 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.36/0.67 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.36/0.67 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.36/0.67 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.36/0.67 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.36/0.67 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.36/0.67 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.36/0.67 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.36/0.67 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.36/0.67 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.36/0.67 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.36/0.67 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.36/0.67 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.36/0.67 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.36/0.67 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.36/0.67 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.36/0.67 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.36/0.67 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.36/0.67 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.36/0.67 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.36/0.67 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.36/0.67 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.36/0.67 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.36/0.67 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.36/0.67 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.36/0.67 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.36/0.67 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.36/0.67 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.36/0.67 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.36/0.67 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.36/0.67 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.36/0.67 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.36/0.67 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.36/0.67 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.36/0.67 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.36/0.67 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.36/0.67 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.36/0.67 (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.36/0.67 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (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.36/0.67 (assume a185 (tptp.ssList tptp.sk1))
% 0.36/0.67 (assume a186 (tptp.ssList tptp.sk2))
% 0.36/0.67 (assume a187 (tptp.ssList tptp.sk3))
% 0.36/0.67 (assume a188 (tptp.ssList tptp.sk4))
% 0.36/0.67 (assume a189 (= tptp.nil tptp.sk3))
% 0.36/0.67 (assume a190 (= tptp.sk2 tptp.sk4))
% 0.36/0.67 (assume a191 (= tptp.sk1 tptp.sk3))
% 0.36/0.67 (assume a192 (tptp.ssItem tptp.sk5))
% 0.36/0.67 (assume a193 (tptp.ssList tptp.sk6))
% 0.36/0.67 (assume a194 (tptp.ssList tptp.sk7))
% 0.36/0.67 (assume a195 (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk1))
% 0.36/0.67 (assume a196 (or (tptp.memberP tptp.sk6 tptp.sk5) (tptp.memberP tptp.sk7 tptp.sk5)))
% 0.36/0.67 (step t1 (cl (not (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule equiv_pos2)
% 0.36/0.67 (step t2 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 0.36/0.67 (step t3 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.36/0.67 (step t4 (cl (= (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule refl)
% 0.36/0.67 (step t5 (cl (= (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule refl)
% 0.36/0.67 (step t6 (cl (= (= (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) true) (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule equiv_simplify)
% 0.36/0.67 (step t7 (cl (not (= (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) true)) (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule equiv1 :premises (t6))
% 0.36/0.67 (step t8 (cl (= (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))))) :rule all_simplify)
% 0.36/0.67 (step t9 (cl (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule refl)
% 0.36/0.67 (step t10 (cl (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule all_simplify)
% 0.36/0.67 (step t11 (cl (= (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule cong :premises (t9 t10))
% 0.36/0.67 (step t12 (cl (= (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) true)) :rule all_simplify)
% 0.36/0.67 (step t13 (cl (= (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) true)) :rule trans :premises (t11 t12))
% 0.36/0.67 (step t14 (cl (= (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) true)) :rule trans :premises (t8 t13))
% 0.36/0.67 (step t15 (cl (= (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t7 t14))
% 0.36/0.67 (step t16 (cl (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule cong :premises (t2 t3 t4 t5 t15))
% 0.36/0.67 (step t17 (cl (not (= (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))))) (not (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule equiv_pos2)
% 0.36/0.67 (step t18 (cl (= (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule refl)
% 0.36/0.67 (step t19 (cl (= (= (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))))) :rule equiv_simplify)
% 0.36/0.67 (step t20 (cl (= (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (not (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))))) :rule equiv2 :premises (t19))
% 0.36/0.67 (step t21 (cl (not (not (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule not_not)
% 0.36/0.67 (step t22 (cl (= (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t20 t21))
% 0.36/0.67 (step t23 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule implies_neg1)
% 0.36/0.67 (anchor :step t24)
% 0.36/0.67 (assume t24.a0 (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))
% 0.36/0.67 (assume t24.a1 (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))
% 0.36/0.67 (assume t24.a2 (= tptp.sk1 tptp.sk3))
% 0.36/0.67 (assume t24.a3 (= tptp.nil tptp.sk3))
% 0.36/0.67 (assume t24.a4 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 0.36/0.67 (step t24.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 0.36/0.67 (step t24.t2 (cl (= (= true false) false)) :rule all_simplify)
% 0.36/0.67 (step t24.t3 (cl (= (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) true) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule equiv_simplify)
% 0.36/0.67 (step t24.t4 (cl (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) true) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule equiv2 :premises (t24.t3))
% 0.36/0.67 (step t24.t5 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t24.a4))
% 0.36/0.67 (step t24.t6 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t24.a3))
% 0.36/0.67 (step t24.t7 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t24.t6))
% 0.36/0.67 (step t24.t8 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t24.a2))
% 0.36/0.67 (step t24.t9 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk1)) :rule symm :premises (t24.a1))
% 0.36/0.67 (step t24.t10 (cl (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule symm :premises (t24.t9))
% 0.36/0.67 (step t24.t11 (cl (= (tptp.app tptp.nil tptp.nil) (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule trans :premises (t24.t5 t24.t7 t24.t8 t24.t10))
% 0.36/0.67 (step t24.t12 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule trans :premises (t24.a4 t24.t11))
% 0.36/0.67 (step t24.t13 (cl (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) true)) :rule resolution :premises (t24.t4 t24.t12))
% 0.36/0.67 (step t24.t14 (cl (= true (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule symm :premises (t24.t13))
% 0.36/0.67 (step t24.t15 (cl (= (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) false) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule equiv_simplify)
% 0.36/0.67 (step t24.t16 (cl (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) false) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule equiv2 :premises (t24.t15))
% 0.36/0.67 (step t24.t17 (cl (not (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule not_not)
% 0.36/0.67 (step t24.t18 (cl (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) false) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t24.t16 t24.t17))
% 0.36/0.67 (step t24.t19 (cl (= (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) false)) :rule resolution :premises (t24.t18 t24.a0))
% 0.36/0.67 (step t24.t20 (cl (= true false)) :rule trans :premises (t24.t14 t24.t19))
% 0.36/0.67 (step t24.t21 (cl false) :rule resolution :premises (t24.t1 t24.t2 t24.t20))
% 0.36/0.67 (step t24 (cl (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) :rule subproof :discharge (t24.a0 t24.a1 t24.a2 t24.a3 t24.a4))
% 0.36/0.67 (step t25 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule and_pos)
% 0.36/0.67 (step t26 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule and_pos)
% 0.36/0.67 (step t27 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.36/0.67 (step t28 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 0.36/0.67 (step t29 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 0.36/0.67 (step t30 (cl false (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t24 t25 t26 t27 t28 t29))
% 0.36/0.67 (step t31 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) false) :rule reordering :premises (t30))
% 0.36/0.67 (step t32 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) false) :rule contraction :premises (t31))
% 0.36/0.67 (step t33 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) false) :rule resolution :premises (t23 t32))
% 0.36/0.67 (step t34 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (not false)) :rule implies_neg2)
% 0.36/0.67 (step t35 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false)) :rule resolution :premises (t33 t34))
% 0.36/0.67 (step t36 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false)) :rule contraction :premises (t35))
% 0.36/0.67 (step t37 (cl (= (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))))) :rule implies_simplify)
% 0.36/0.67 (step t38 (cl (not (=> (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false)) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule equiv1 :premises (t37))
% 0.36/0.67 (step t39 (cl (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t36 t38))
% 0.36/0.67 (step t40 (cl (= (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) false)) :rule resolution :premises (t22 t39))
% 0.36/0.67 (step t41 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) false))) :rule cong :premises (t18 t40))
% 0.36/0.67 (step t42 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) false) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))))) :rule all_simplify)
% 0.36/0.67 (step t43 (cl (= (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))))) :rule trans :premises (t41 t42))
% 0.36/0.67 (step t44 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule implies_neg1)
% 0.36/0.67 (anchor :step t45)
% 0.36/0.67 (assume t45.a0 (= tptp.nil tptp.sk3))
% 0.36/0.67 (assume t45.a1 (= tptp.sk1 tptp.sk3))
% 0.36/0.67 (assume t45.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 0.36/0.67 (assume t45.a3 (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))
% 0.36/0.67 (assume t45.a4 (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))
% 0.36/0.67 (step t45.t1 (cl (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule and_neg)
% 0.36/0.67 (step t45.t2 (cl (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t45.t1 t45.a4 t45.a3 t45.a1 t45.a0 t45.a2))
% 0.36/0.67 (step t45 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule subproof :discharge (t45.a0 t45.a1 t45.a2 t45.a3 t45.a4))
% 0.36/0.67 (step t46 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 0.36/0.67 (step t47 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.36/0.67 (step t48 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 0.36/0.67 (step t49 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule and_pos)
% 0.36/0.67 (step t50 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule and_pos)
% 0.36/0.67 (step t51 (cl (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t45 t46 t47 t48 t49 t50))
% 0.36/0.67 (step t52 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule reordering :premises (t51))
% 0.36/0.67 (step t53 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule contraction :premises (t52))
% 0.36/0.67 (step t54 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t44 t53))
% 0.36/0.67 (step t55 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule implies_neg2)
% 0.36/0.67 (step t56 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t54 t55))
% 0.36/0.67 (step t57 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (and (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule contraction :premises (t56))
% 0.36/0.67 (step t58 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t17 t43 t57))
% 0.36/0.67 (step t59 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule not_and :premises (t58))
% 0.36/0.67 (step t60 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 0.36/0.67 (step t61 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.36/0.67 (step t62 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule or_neg)
% 0.36/0.67 (step t63 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule or_neg)
% 0.36/0.67 (step t64 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (not (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule or_neg)
% 0.36/0.67 (step t65 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule resolution :premises (t59 t60 t61 t62 t63 t64))
% 0.36/0.67 (step t66 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))))) :rule contraction :premises (t65))
% 0.36/0.67 (step t67 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t1 t16 t66))
% 0.36/0.67 (step t68 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule or :premises (t67))
% 0.36/0.67 (step t69 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule reordering :premises (t68))
% 0.36/0.67 (step t70 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 0.36/0.67 (step t71 (cl (not (tptp.ssList tptp.sk7)) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t70))
% 0.36/0.67 (step t72 (cl (not (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 0.36/0.67 (step t73 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t72))
% 0.36/0.67 (step t74 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 0.36/0.67 (step t75 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t74))
% 0.36/0.67 (step t76 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 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.36/0.67 (anchor :step t77)
% 0.36/0.67 (assume t77.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.36/0.67 (step t77.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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 0.36/0.67 (step t77.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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t77.t1))
% 0.36/0.67 (step t77.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t77.t2 t77.a0))
% 0.36/0.67 (step t77 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t77.a0))
% 0.36/0.67 (step t78 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t76 t77))
% 0.36/0.67 (step t79 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 0.36/0.67 (step t80 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t78 t79))
% 0.36/0.67 (step t81 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t80))
% 0.36/0.67 (step t82 (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.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t81))
% 0.36/0.67 (step t83 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t82 a85))
% 0.36/0.67 (step t84 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t75 a7 a192 t83))
% 0.36/0.67 (step t85 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 0.36/0.67 (step t86 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t85))
% 0.36/0.67 (step t87 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 0.36/0.67 (anchor :step t88)
% 0.36/0.67 (assume t88.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.36/0.67 (step t88.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 0.36/0.67 (step t88.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t88.t1))
% 0.36/0.67 (step t88.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t88.t2 t88.a0))
% 0.36/0.67 (step t88 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t88.a0))
% 0.36/0.67 (step t89 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t87 t88))
% 0.36/0.67 (step t90 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 0.36/0.67 (step t91 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t89 t90))
% 0.36/0.67 (step t92 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t91))
% 0.36/0.67 (step t93 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t92))
% 0.36/0.67 (step t94 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 0.36/0.67 (anchor :step t95 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.36/0.67 (step t95.t1 (cl (= U U)) :rule refl)
% 0.36/0.67 (step t95.t2 (cl (= V V)) :rule refl)
% 0.36/0.67 (step t95.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 0.36/0.67 (step t95.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t95.t3))
% 0.36/0.67 (step t95.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.36/0.67 (step t95.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.36/0.67 (step t95.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t95.t4 t95.t5 t95.t6))
% 0.36/0.67 (step t95 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 0.36/0.67 (step t96 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t94 t95 a97))
% 0.36/0.67 (step t97 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t93 t96))
% 0.36/0.67 (step t98 (cl (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t86 a7 a192 t97))
% 0.36/0.67 (step t99 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule implies_neg1)
% 0.36/0.67 (anchor :step t100)
% 0.36/0.67 (assume t100.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.36/0.67 (step t100.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 0.36/0.67 (step t100.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t100.t1))
% 0.36/0.67 (step t100.t3 (cl (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t100.t2 t100.a0))
% 0.36/0.67 (step t100 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t100.a0))
% 0.36/0.67 (step t101 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t99 t100))
% 0.36/0.67 (step t102 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 0.36/0.67 (step t103 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t101 t102))
% 0.36/0.67 (step t104 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t103))
% 0.36/0.67 (step t105 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t104))
% 0.36/0.67 (step t106 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule equiv_pos2)
% 0.36/0.67 (anchor :step t107 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.36/0.67 (step t107.t1 (cl (= U U)) :rule refl)
% 0.36/0.67 (step t107.t2 (cl (= V V)) :rule refl)
% 0.36/0.67 (step t107.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 0.36/0.67 (step t107.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t107.t3))
% 0.36/0.67 (step t107.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.36/0.67 (step t107.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.36/0.67 (step t107.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 0.36/0.67 (step t107.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule cong :premises (t107.t4 t107.t5 t107.t6 t107.t7))
% 0.36/0.67 (step t107 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) :rule bind)
% 0.36/0.67 (step t108 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule resolution :premises (t106 t107 a118))
% 0.36/0.67 (step t109 (cl (or (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t105 t108))
% 0.36/0.67 (step t110 (cl (not (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t73 a193 t84 t98 t109))
% 0.36/0.67 (step t111 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 0.36/0.67 (step t112 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t111))
% 0.36/0.67 (step t113 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 0.36/0.67 (anchor :step t114)
% 0.36/0.67 (assume t114.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.36/0.67 (step t114.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk6)))
% 0.36/0.67 (step t114.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t114.t1))
% 0.36/0.67 (step t114.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t114.t2 t114.a0))
% 0.36/0.67 (step t114 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t114.a0))
% 0.36/0.67 (step t115 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t113 t114))
% 0.36/0.67 (step t116 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 0.36/0.67 (step t117 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t115 t116))
% 0.36/0.67 (step t118 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t117))
% 0.36/0.67 (step t119 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t118))
% 0.36/0.67 (step t120 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t119 a84))
% 0.36/0.67 (step t121 (cl (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t112 a193 t84 t120))
% 0.36/0.67 (step t122 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 0.36/0.67 (anchor :step t123)
% 0.36/0.67 (assume t123.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.36/0.67 (step t123.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (:= V tptp.sk7)))
% 0.36/0.67 (step t123.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t123.t1))
% 0.36/0.67 (step t123.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t123.t2 t123.a0))
% 0.36/0.67 (step t123 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t123.a0))
% 0.36/0.67 (step t124 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t122 t123))
% 0.36/0.67 (step t125 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 0.36/0.67 (step t126 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t124 t125))
% 0.36/0.67 (step t127 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t126))
% 0.36/0.67 (step t128 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t127))
% 0.36/0.67 (step t129 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 0.36/0.67 (anchor :step t130 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.36/0.67 (step t130.t1 (cl (= U U)) :rule refl)
% 0.36/0.67 (step t130.t2 (cl (= V V)) :rule refl)
% 0.36/0.67 (step t130.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 0.36/0.67 (step t130.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t130.t3))
% 0.36/0.67 (step t130.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.36/0.67 (step t130.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.36/0.67 (step t130.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 0.36/0.67 (step t130.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t130.t4 t130.t5 t130.t6 t130.t7))
% 0.36/0.67 (step t130 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 0.36/0.67 (step t131 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t129 t130 a117))
% 0.36/0.67 (step t132 (cl (or (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t128 t131))
% 0.36/0.67 (step t133 (cl (not (= tptp.nil (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t71 a194 t110 t121 t132))
% 0.36/0.67 (step t134 (cl (= tptp.sk1 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule symm :premises (a195))
% 0.36/0.67 (step t135 (cl (not (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) (not (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)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule equiv_pos2)
% 0.36/0.67 (anchor :step t136 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.36/0.67 (step t136.t1 (cl (= U U)) :rule refl)
% 0.36/0.67 (step t136.t2 (cl (= V V)) :rule refl)
% 0.36/0.67 (step t136.t3 (cl (= (not (= tptp.nil U)) (not (= tptp.nil U)))) :rule refl)
% 0.36/0.67 (step t136.t4 (cl (= (not (= tptp.nil V)) (not (= tptp.nil V)))) :rule refl)
% 0.36/0.67 (step t136.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.36/0.67 (step t136.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.36/0.67 (step t136.t7 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 0.36/0.67 (step t136.t8 (cl (= (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V))))) :rule cong :premises (t136.t3 t136.t4 t136.t5 t136.t6 t136.t7))
% 0.36/0.67 (step t136 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))))) :rule bind)
% 0.36/0.67 (step t137 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 0.36/0.67 (step t138 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 0.36/0.67 (step t139 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t138))
% 0.36/0.67 (step t140 (cl (= (not true) false)) :rule all_simplify)
% 0.36/0.67 (step t141 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t139 t140))
% 0.36/0.67 (step t142 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 0.36/0.67 (step t143 (cl (= (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule refl)
% 0.36/0.67 (step t144 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule cong :premises (t141 t141 t142 t142 t143))
% 0.36/0.67 (step t145 (cl (= (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 0.36/0.67 (step t146 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t144 t145))
% 0.36/0.67 (step t147 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t137 t146))
% 0.36/0.67 (step t148 (cl (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t136 t147))
% 0.36/0.67 (step t149 (cl (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t135 t148 a144))
% 0.36/0.67 (step t150 (cl (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule or :premises (t149))
% 0.36/0.67 (step t151 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t150 a7))
% 0.36/0.67 (step t152 (cl) :rule resolution :premises (t69 t133 t134 a191 a189 t151))
% 0.36/0.67
% 0.36/0.67 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.0g1mIJ7EJe/cvc5---1.0.5_32753.smt2
% 0.36/0.68 % cvc5---1.0.5 exiting
% 0.36/0.68 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------