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