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