TSTP Solution File: SWC101-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC101-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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:23 EDT 2024
% Result : Unsatisfiable 0.19s 0.55s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWC101-1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 26 16:00:09 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.47 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.47 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.47HnQeETl9/cvc5---1.0.5_20529.smt2
% 0.19/0.55 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.47HnQeETl9/cvc5---1.0.5_20529.smt2
% 0.19/0.57 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.19/0.57 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.19/0.57 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.19/0.57 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.19/0.57 (assume a4 (tptp.strictorderP tptp.nil))
% 0.19/0.57 (assume a5 (tptp.totalorderP tptp.nil))
% 0.19/0.57 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.19/0.57 (assume a7 (tptp.ssList tptp.nil))
% 0.19/0.57 (assume a8 (tptp.ssItem tptp.skac3))
% 0.19/0.57 (assume a9 (tptp.ssItem tptp.skac2))
% 0.19/0.57 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.19/0.57 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.19/0.57 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.19/0.57 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.19/0.57 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.19/0.57 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.19/0.57 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.19/0.57 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.19/0.57 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.19/0.57 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.19/0.57 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.19/0.57 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.19/0.57 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.19/0.57 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.19/0.57 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.19/0.57 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.19/0.57 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.19/0.57 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.19/0.57 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.19/0.57 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.19/0.57 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.19/0.57 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.19/0.57 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.19/0.57 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.19/0.57 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.19/0.57 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.19/0.57 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.19/0.57 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.19/0.57 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.19/0.57 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.19/0.57 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.19/0.57 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.19/0.57 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.19/0.57 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.19/0.57 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.19/0.57 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.19/0.57 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.19/0.57 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.19/0.57 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.19/0.57 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.19/0.57 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.19/0.57 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.19/0.57 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.19/0.57 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.19/0.57 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.19/0.57 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.19/0.57 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.19/0.57 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.19/0.57 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.19/0.57 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.19/0.57 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.19/0.57 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.19/0.57 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.19/0.57 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.19/0.57 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.19/0.57 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.19/0.57 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.19/0.57 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.19/0.57 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.19/0.57 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.19/0.57 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.19/0.57 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.19/0.57 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.19/0.57 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.19/0.57 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.19/0.57 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.19/0.57 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.19/0.57 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.19/0.57 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.19/0.57 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.19/0.57 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.19/0.57 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.19/0.57 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.19/0.57 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.19/0.57 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.19/0.57 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.19/0.57 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.19/0.57 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.19/0.57 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.19/0.57 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.19/0.57 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.19/0.57 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.19/0.57 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.19/0.57 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.19/0.57 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.19/0.57 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.19/0.57 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 0.19/0.57 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.19/0.57 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 0.19/0.57 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 0.19/0.57 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 0.19/0.57 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 0.19/0.57 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.19/0.57 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.19/0.57 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.19/0.57 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 0.19/0.57 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 0.19/0.57 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.19/0.57 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.19/0.57 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 0.19/0.57 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.19/0.57 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.19/0.57 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.19/0.57 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 0.19/0.57 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.19/0.57 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.19/0.57 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.19/0.57 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 0.19/0.57 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 0.19/0.57 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.19/0.57 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.19/0.57 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.19/0.57 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.19/0.57 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.19/0.57 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 0.19/0.57 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 0.19/0.57 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.19/0.57 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 0.19/0.57 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 0.19/0.57 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 0.19/0.57 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 0.19/0.57 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 0.19/0.57 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 0.19/0.57 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.19/0.57 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 0.19/0.57 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 0.19/0.57 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 0.19/0.57 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 0.19/0.57 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 0.19/0.57 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 0.19/0.57 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.19/0.57 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 0.19/0.57 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 0.19/0.57 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 0.19/0.57 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 0.19/0.57 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 0.19/0.57 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 0.19/0.57 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 0.19/0.57 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.19/0.57 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 0.19/0.57 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 0.19/0.57 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 0.19/0.57 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.19/0.57 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.19/0.57 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 0.19/0.57 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 0.19/0.57 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 0.19/0.57 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 0.19/0.57 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 0.19/0.57 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 0.19/0.57 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 0.19/0.57 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 0.19/0.57 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 0.19/0.57 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 0.19/0.57 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 0.19/0.57 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.19/0.57 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 0.19/0.57 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 0.19/0.57 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 0.19/0.57 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 0.19/0.57 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 0.19/0.57 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 0.19/0.57 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 0.19/0.57 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 0.19/0.57 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 0.19/0.57 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 0.19/0.57 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 0.19/0.57 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 0.19/0.57 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 0.19/0.57 (assume a185 (tptp.ssList tptp.sk1))
% 0.19/0.57 (assume a186 (tptp.ssList tptp.sk2))
% 0.19/0.57 (assume a187 (tptp.ssList tptp.sk3))
% 0.19/0.57 (assume a188 (tptp.ssList tptp.sk4))
% 0.19/0.57 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.19/0.57 (assume a191 (tptp.ssList tptp.sk5))
% 0.19/0.57 (assume a192 (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4))
% 0.19/0.57 (assume a193 (tptp.equalelemsP tptp.sk3))
% 0.19/0.57 (assume a194 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk5)) (not (tptp.ssList C)) (not (= (tptp.app C (tptp.cons A tptp.nil)) tptp.sk3)))))
% 0.19/0.57 (assume a195 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 0.19/0.57 (assume a196 (or (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk1))))
% 0.19/0.57 (assume a197 (or (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk1))))
% 0.19/0.57 (step t1 (cl (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))) :rule or :premises (a195))
% 0.19/0.57 (step t2 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4)))) :rule equiv_pos2)
% 0.19/0.57 (step t3 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.19/0.57 (step t4 (cl (= (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true) (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 0.19/0.57 (step t5 (cl (not (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true)) (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule equiv1 :premises (t4))
% 0.19/0.57 (step t6 (cl (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))))) :rule all_simplify)
% 0.19/0.57 (step t7 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 0.19/0.57 (step t8 (cl (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule all_simplify)
% 0.19/0.57 (step t9 (cl (= (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))) (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule cong :premises (t7 t8))
% 0.19/0.57 (step t10 (cl (= (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) true)) :rule all_simplify)
% 0.19/0.57 (step t11 (cl (= (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))) true)) :rule trans :premises (t9 t10))
% 0.19/0.57 (step t12 (cl (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true)) :rule trans :premises (t6 t11))
% 0.19/0.57 (step t13 (cl (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t5 t12))
% 0.19/0.57 (step t14 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 0.19/0.57 (step t15 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))))) :rule cong :premises (t3 t13 t14))
% 0.19/0.57 (step t16 (cl (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2)))) :rule and_neg)
% 0.19/0.57 (step t17 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t18)
% 0.19/0.57 (assume t18.a0 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (assume t18.a1 (not (= tptp.nil tptp.sk2)))
% 0.19/0.57 (step t18.t1 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t18.t2)
% 0.19/0.57 (assume t18.t2.a0 (not (= tptp.nil tptp.sk2)))
% 0.19/0.57 (assume t18.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (step t18.t2.t1 (cl (= (= (= tptp.nil tptp.sk4) false) (not (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 0.19/0.57 (step t18.t2.t2 (cl (not (= (= tptp.nil tptp.sk4) false)) (not (= tptp.nil tptp.sk4))) :rule equiv1 :premises (t18.t2.t1))
% 0.19/0.57 (step t18.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.19/0.57 (step t18.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t18.t2.a1))
% 0.19/0.57 (step t18.t2.t5 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk2))) :rule cong :premises (t18.t2.t3 t18.t2.t4))
% 0.19/0.57 (step t18.t2.t6 (cl (= (= (= tptp.nil tptp.sk2) false) (not (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 0.19/0.57 (step t18.t2.t7 (cl (= (= tptp.nil tptp.sk2) false) (not (not (= tptp.nil tptp.sk2)))) :rule equiv2 :premises (t18.t2.t6))
% 0.19/0.57 (step t18.t2.t8 (cl (not (not (not (= tptp.nil tptp.sk2)))) (= tptp.nil tptp.sk2)) :rule not_not)
% 0.19/0.57 (step t18.t2.t9 (cl (= (= tptp.nil tptp.sk2) false) (= tptp.nil tptp.sk2)) :rule resolution :premises (t18.t2.t7 t18.t2.t8))
% 0.19/0.57 (step t18.t2.t10 (cl (= (= tptp.nil tptp.sk2) false)) :rule resolution :premises (t18.t2.t9 t18.t2.a0))
% 0.19/0.57 (step t18.t2.t11 (cl (= (= tptp.nil tptp.sk4) false)) :rule trans :premises (t18.t2.t5 t18.t2.t10))
% 0.19/0.57 (step t18.t2.t12 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t18.t2.t2 t18.t2.t11))
% 0.19/0.57 (step t18.t2 (cl (not (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule subproof :discharge (t18.t2.a0 t18.t2.a1))
% 0.19/0.57 (step t18.t3 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule and_pos)
% 0.19/0.57 (step t18.t4 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.19/0.57 (step t18.t5 (cl (not (= tptp.nil tptp.sk4)) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t18.t2 t18.t3 t18.t4))
% 0.19/0.57 (step t18.t6 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t18.t5))
% 0.19/0.57 (step t18.t7 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t18.t6))
% 0.19/0.57 (step t18.t8 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t18.t1 t18.t7))
% 0.19/0.57 (step t18.t9 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 0.19/0.57 (step t18.t10 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t18.t8 t18.t9))
% 0.19/0.57 (step t18.t11 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t18.t10))
% 0.19/0.57 (step t18.t12 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule implies :premises (t18.t11))
% 0.19/0.57 (step t18.t13 (cl (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.19/0.57 (step t18.t14 (cl (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t18.t13 t18.a1 t18.a0))
% 0.19/0.57 (step t18.t15 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t18.t12 t18.t14))
% 0.19/0.57 (step t18 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) :rule subproof :discharge (t18.a0 t18.a1))
% 0.19/0.57 (step t19 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.19/0.57 (step t20 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk2))) :rule and_pos)
% 0.19/0.57 (step t21 (cl (not (= tptp.nil tptp.sk4)) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))))) :rule resolution :premises (t18 t19 t20))
% 0.19/0.57 (step t22 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t21))
% 0.19/0.57 (step t23 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t22))
% 0.19/0.57 (step t24 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t17 t23))
% 0.19/0.57 (step t25 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 0.19/0.57 (step t26 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t24 t25))
% 0.19/0.57 (step t27 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t26))
% 0.19/0.57 (step t28 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule implies :premises (t27))
% 0.19/0.57 (step t29 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t16 t28))
% 0.19/0.57 (step t30 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.19/0.57 (step t31 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (not (= tptp.nil tptp.sk2))))) :rule or_neg)
% 0.19/0.57 (step t32 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 0.19/0.57 (step t33 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t29 t30 t31 t32))
% 0.19/0.57 (step t34 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t33))
% 0.19/0.57 (step t35 (cl (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t2 t15 t34))
% 0.19/0.57 (step t36 (cl (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))) :rule or :premises (t35))
% 0.19/0.57 (step t37 (cl (= tptp.nil tptp.sk2) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t36))
% 0.19/0.57 (step t38 (cl (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk1))) :rule or :premises (a196))
% 0.19/0.57 (step t39 (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)
% 0.19/0.57 (step t40 (cl (= tptp.nil tptp.sk1) (tptp.neq tptp.sk1 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList 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 (t39))
% 0.19/0.57 (step t41 (cl (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule or :premises (a197))
% 0.19/0.57 (step t42 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule and_neg)
% 0.19/0.57 (step t43 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t44)
% 0.19/0.57 (assume t44.a0 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (assume t44.a1 (= tptp.sk1 tptp.sk3))
% 0.19/0.57 (assume t44.a2 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 0.19/0.57 (assume t44.a3 (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))
% 0.19/0.57 (step t44.t1 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t44.t2)
% 0.19/0.57 (assume t44.t2.a0 (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))
% 0.19/0.57 (assume t44.t2.a1 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 0.19/0.57 (assume t44.t2.a2 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (assume t44.t2.a3 (= tptp.sk1 tptp.sk3))
% 0.19/0.57 (step t44.t2.t1 (cl (= (= (tptp.frontsegP tptp.sk2 tptp.sk1) true) (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule equiv_simplify)
% 0.19/0.57 (step t44.t2.t2 (cl (not (= (tptp.frontsegP tptp.sk2 tptp.sk1) true)) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule equiv1 :premises (t44.t2.t1))
% 0.19/0.57 (step t44.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t44.t2.a2))
% 0.19/0.57 (step t44.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t44.t2.t3))
% 0.19/0.57 (step t44.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t44.t2.a1))
% 0.19/0.57 (step t44.t2.t6 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (t44.t2.t5))
% 0.19/0.57 (step t44.t2.t7 (cl (= tptp.sk2 (tptp.app tptp.sk3 tptp.sk5))) :rule trans :premises (t44.t2.t4 t44.t2.t6))
% 0.19/0.57 (step t44.t2.t8 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t44.t2.a3))
% 0.19/0.57 (step t44.t2.t9 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t44.t2.t8))
% 0.19/0.57 (step t44.t2.t10 (cl (= (tptp.frontsegP tptp.sk2 tptp.sk1) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule cong :premises (t44.t2.t7 t44.t2.t9))
% 0.19/0.57 (step t44.t2.t11 (cl (= (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule equiv_simplify)
% 0.19/0.57 (step t44.t2.t12 (cl (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule equiv2 :premises (t44.t2.t11))
% 0.19/0.57 (step t44.t2.t13 (cl (= (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) true)) :rule resolution :premises (t44.t2.t12 t44.t2.a0))
% 0.19/0.57 (step t44.t2.t14 (cl (= (tptp.frontsegP tptp.sk2 tptp.sk1) true)) :rule trans :premises (t44.t2.t10 t44.t2.t13))
% 0.19/0.57 (step t44.t2.t15 (cl (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t44.t2.t2 t44.t2.t14))
% 0.19/0.57 (step t44.t2 (cl (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule subproof :discharge (t44.t2.a0 t44.t2.a1 t44.t2.a2 t44.t2.a3))
% 0.19/0.57 (step t44.t3 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule and_pos)
% 0.19/0.57 (step t44.t4 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 0.19/0.57 (step t44.t5 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.19/0.57 (step t44.t6 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.19/0.57 (step t44.t7 (cl (tptp.frontsegP tptp.sk2 tptp.sk1) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t44.t2 t44.t3 t44.t4 t44.t5 t44.t6))
% 0.19/0.57 (step t44.t8 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule reordering :premises (t44.t7))
% 0.19/0.57 (step t44.t9 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule contraction :premises (t44.t8))
% 0.19/0.57 (step t44.t10 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t44.t1 t44.t9))
% 0.19/0.57 (step t44.t11 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (not (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule implies_neg2)
% 0.19/0.57 (step t44.t12 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule resolution :premises (t44.t10 t44.t11))
% 0.19/0.57 (step t44.t13 (cl (=> (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule contraction :premises (t44.t12))
% 0.19/0.57 (step t44.t14 (cl (not (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule implies :premises (t44.t13))
% 0.19/0.57 (step t44.t15 (cl (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.19/0.57 (step t44.t16 (cl (and (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t44.t15 t44.a3 t44.a2 t44.a0 t44.a1))
% 0.19/0.57 (step t44.t17 (cl (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t44.t14 t44.t16))
% 0.19/0.57 (step t44 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule subproof :discharge (t44.a0 t44.a1 t44.a2 t44.a3))
% 0.19/0.57 (step t45 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.19/0.57 (step t46 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.19/0.57 (step t47 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 0.19/0.57 (step t48 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule and_pos)
% 0.19/0.57 (step t49 (cl (tptp.frontsegP tptp.sk2 tptp.sk1) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule resolution :premises (t44 t45 t46 t47 t48))
% 0.19/0.57 (step t50 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule reordering :premises (t49))
% 0.19/0.57 (step t51 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule contraction :premises (t50))
% 0.19/0.57 (step t52 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t43 t51))
% 0.19/0.57 (step t53 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (not (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule implies_neg2)
% 0.19/0.57 (step t54 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule resolution :premises (t52 t53))
% 0.19/0.57 (step t55 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1))) :rule contraction :premises (t54))
% 0.19/0.57 (step t56 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule implies :premises (t55))
% 0.19/0.57 (step t57 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t42 t56))
% 0.19/0.57 (step t58 (cl (tptp.frontsegP 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.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule reordering :premises (t57))
% 0.19/0.57 (step t59 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (a192))
% 0.19/0.57 (step t60 (cl (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule or_pos)
% 0.19/0.57 (step t61 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule reordering :premises (t60))
% 0.19/0.57 (step t62 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule and_neg)
% 0.19/0.57 (step t63 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t64)
% 0.19/0.57 (assume t64.a0 (tptp.ssList tptp.sk2))
% 0.19/0.57 (assume t64.a1 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (assume t64.a2 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 0.19/0.57 (step t64.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t64.t2)
% 0.19/0.57 (assume t64.t2.a0 (tptp.ssList tptp.sk2))
% 0.19/0.57 (assume t64.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.19/0.57 (assume t64.t2.a2 (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))
% 0.19/0.57 (step t64.t2.t1 (cl (= (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) true) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule equiv_simplify)
% 0.19/0.57 (step t64.t2.t2 (cl (not (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) true)) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule equiv1 :premises (t64.t2.t1))
% 0.19/0.57 (step t64.t2.t3 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t64.t2.a2))
% 0.19/0.57 (step t64.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule symm :premises (t64.t2.t3))
% 0.19/0.57 (step t64.t2.t5 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk4)) :rule symm :premises (t64.t2.t4))
% 0.19/0.57 (step t64.t2.t6 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t64.t2.a1))
% 0.19/0.57 (step t64.t2.t7 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t64.t2.t6))
% 0.19/0.57 (step t64.t2.t8 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t64.t2.t7))
% 0.19/0.57 (step t64.t2.t9 (cl (= (tptp.app tptp.sk3 tptp.sk5) tptp.sk2)) :rule trans :premises (t64.t2.t5 t64.t2.t8))
% 0.19/0.57 (step t64.t2.t10 (cl (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) (tptp.ssList tptp.sk2))) :rule cong :premises (t64.t2.t9))
% 0.19/0.57 (step t64.t2.t11 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 0.19/0.57 (step t64.t2.t12 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t64.t2.t11))
% 0.19/0.57 (step t64.t2.t13 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t64.t2.t12 t64.t2.a0))
% 0.19/0.57 (step t64.t2.t14 (cl (= (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) true)) :rule trans :premises (t64.t2.t10 t64.t2.t13))
% 0.19/0.57 (step t64.t2.t15 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t64.t2.t2 t64.t2.t14))
% 0.19/0.57 (step t64.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule subproof :discharge (t64.t2.a0 t64.t2.a1 t64.t2.a2))
% 0.19/0.57 (step t64.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 0.19/0.57 (step t64.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.19/0.57 (step t64.t5 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 0.19/0.57 (step t64.t6 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))))) :rule resolution :premises (t64.t2 t64.t3 t64.t4 t64.t5))
% 0.19/0.57 (step t64.t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t64.t6))
% 0.19/0.57 (step t64.t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule contraction :premises (t64.t7))
% 0.19/0.57 (step t64.t9 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t64.t1 t64.t8))
% 0.19/0.57 (step t64.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 0.19/0.57 (step t64.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t64.t9 t64.t10))
% 0.19/0.57 (step t64.t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t64.t11))
% 0.19/0.57 (step t64.t13 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule implies :premises (t64.t12))
% 0.19/0.57 (step t64.t14 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule and_neg)
% 0.19/0.57 (step t64.t15 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t64.t14 t64.a0 t64.a1 t64.a2))
% 0.19/0.57 (step t64.t16 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t64.t13 t64.t15))
% 0.19/0.57 (step t64 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule subproof :discharge (t64.a0 t64.a1 t64.a2))
% 0.19/0.57 (step t65 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 0.19/0.57 (step t66 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.19/0.57 (step t67 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) :rule and_pos)
% 0.19/0.57 (step t68 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))))) :rule resolution :premises (t64 t65 t66 t67))
% 0.19/0.57 (step t69 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule reordering :premises (t68))
% 0.19/0.57 (step t70 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule contraction :premises (t69))
% 0.19/0.57 (step t71 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t63 t70))
% 0.19/0.57 (step t72 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule implies_neg2)
% 0.19/0.57 (step t73 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule resolution :premises (t71 t72))
% 0.19/0.57 (step t74 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5)))) :rule contraction :premises (t73))
% 0.19/0.57 (step t75 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5)))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule implies :premises (t74))
% 0.19/0.57 (step t76 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk3 tptp.sk5))) (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t62 t75))
% 0.19/0.57 (step t77 (cl (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) :rule resolution :premises (t76 a186 a189 t59))
% 0.19/0.57 (step t78 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t79)
% 0.19/0.57 (assume t79.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))
% 0.19/0.57 (step t79.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk5)))
% 0.19/0.57 (step t79.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule or :premises (t79.t1))
% 0.19/0.57 (step t79.t3 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule resolution :premises (t79.t2 t79.a0))
% 0.19/0.57 (step t79 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule subproof :discharge (t79.a0))
% 0.19/0.57 (step t80 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule resolution :premises (t78 t79))
% 0.19/0.57 (step t81 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (not (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule implies_neg2)
% 0.19/0.57 (step t82 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule resolution :premises (t80 t81))
% 0.19/0.57 (step t83 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)))) :rule contraction :premises (t82))
% 0.19/0.57 (step t84 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule implies :premises (t83))
% 0.19/0.57 (step t85 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule equiv_pos2)
% 0.19/0.57 (anchor :step t86 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 0.19/0.57 (step t86.t1 (cl (= U U)) :rule refl)
% 0.19/0.57 (step t86.t2 (cl (= V V)) :rule refl)
% 0.19/0.57 (step t86.t3 (cl (= W W)) :rule refl)
% 0.19/0.57 (step t86.t4 (cl (= (= (tptp.app U V) W) (= W (tptp.app U V)))) :rule all_simplify)
% 0.19/0.57 (step t86.t5 (cl (= (not (= (tptp.app U V) W)) (not (= W (tptp.app U V))))) :rule cong :premises (t86.t4))
% 0.19/0.57 (step t86.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.19/0.57 (step t86.t7 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.19/0.57 (step t86.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 0.19/0.57 (step t86.t9 (cl (= (tptp.frontsegP W U) (tptp.frontsegP W U))) :rule refl)
% 0.19/0.57 (step t86.t10 (cl (= (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)))) :rule cong :premises (t86.t5 t86.t6 t86.t7 t86.t8 t86.t9))
% 0.19/0.57 (step t86 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))) :rule bind)
% 0.19/0.57 (step t87 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule all_simplify)
% 0.19/0.57 (anchor :step t88 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.19/0.57 (step t88.t1 (cl (= U U)) :rule refl)
% 0.19/0.57 (step t88.t2 (cl (= V V)) :rule refl)
% 0.19/0.57 (step t88.t3 (cl (= (= (tptp.app U V) (tptp.app U V)) true)) :rule all_simplify)
% 0.19/0.57 (step t88.t4 (cl (= (not (= (tptp.app U V) (tptp.app U V))) (not true))) :rule cong :premises (t88.t3))
% 0.19/0.57 (step t88.t5 (cl (= (not true) false)) :rule all_simplify)
% 0.19/0.57 (step t88.t6 (cl (= (not (= (tptp.app U V) (tptp.app U V))) false)) :rule trans :premises (t88.t4 t88.t5))
% 0.19/0.57 (step t88.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.19/0.57 (step t88.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.19/0.57 (step t88.t9 (cl (= (not (tptp.ssList (tptp.app U V))) (not (tptp.ssList (tptp.app U V))))) :rule refl)
% 0.19/0.57 (step t88.t10 (cl (= (tptp.frontsegP (tptp.app U V) U) (tptp.frontsegP (tptp.app U V) U))) :rule refl)
% 0.19/0.57 (step t88.t11 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule cong :premises (t88.t6 t88.t7 t88.t8 t88.t9 t88.t10))
% 0.19/0.57 (step t88.t12 (cl (= (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule all_simplify)
% 0.19/0.57 (step t88.t13 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule trans :premises (t88.t11 t88.t12))
% 0.19/0.57 (step t88 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule bind)
% 0.19/0.57 (step t89 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t87 t88))
% 0.19/0.57 (step t90 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t86 t89))
% 0.19/0.57 (step t91 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule resolution :premises (t85 t90 a143))
% 0.19/0.57 (step t92 (cl (or (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app tptp.sk3 tptp.sk5))) (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3))) :rule resolution :premises (t84 t91))
% 0.19/0.57 (step t93 (cl (tptp.frontsegP (tptp.app tptp.sk3 tptp.sk5) tptp.sk3)) :rule resolution :premises (t61 a187 a191 t77 t92))
% 0.19/0.57 (step t94 (cl (tptp.frontsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t58 a189 a190 t59 t93))
% 0.19/0.57 (step t95 (cl (not (tptp.neq tptp.sk1 tptp.nil))) :rule resolution :premises (t41 t94))
% 0.19/0.57 (step t96 (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)
% 0.19/0.57 (anchor :step t97)
% 0.19/0.57 (assume t97.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 0.19/0.57 (step t97.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)))
% 0.19/0.57 (step t97.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 (t97.t1))
% 0.19/0.57 (step t97.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 (t97.t2 t97.a0))
% 0.19/0.57 (step t97 (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 (t97.a0))
% 0.19/0.57 (step t98 (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 (t96 t97))
% 0.19/0.57 (step t99 (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)
% 0.19/0.57 (step t100 (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 (t98 t99))
% 0.19/0.57 (step t101 (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 (t100))
% 0.19/0.57 (step t102 (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 (t101))
% 0.19/0.57 (step t103 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 0.19/0.57 (anchor :step t104 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.19/0.57 (step t104.t1 (cl (= U U)) :rule refl)
% 0.19/0.57 (step t104.t2 (cl (= V V)) :rule refl)
% 0.19/0.57 (step t104.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.19/0.57 (step t104.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.19/0.57 (step t104.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 0.19/0.57 (step t104.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 0.19/0.57 (step t104.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 (t104.t3 t104.t4 t104.t5 t104.t6))
% 0.19/0.57 (step t104 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 0.19/0.57 (step t105 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t103 t104 a99))
% 0.19/0.57 (step t106 (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 (t102 t105))
% 0.19/0.57 (step t107 (cl (= tptp.nil tptp.sk1)) :rule resolution :premises (t40 t95 a7 a185 t106))
% 0.19/0.57 (step t108 (cl (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t38 t107))
% 0.19/0.57 (step t109 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t37 t108 a189))
% 0.19/0.57 (step t110 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) :rule and_neg)
% 0.19/0.57 (step t111 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t112)
% 0.19/0.57 (assume t112.a0 (= tptp.sk1 tptp.sk3))
% 0.19/0.57 (assume t112.a1 (= tptp.nil tptp.sk1))
% 0.19/0.57 (step t112.t1 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) :rule implies_neg1)
% 0.19/0.57 (anchor :step t112.t2)
% 0.19/0.57 (assume t112.t2.a0 (= tptp.sk1 tptp.sk3))
% 0.19/0.57 (assume t112.t2.a1 (= tptp.nil tptp.sk1))
% 0.19/0.57 (step t112.t2.t1 (cl (= tptp.sk1 tptp.nil)) :rule symm :premises (t112.t2.a1))
% 0.19/0.57 (step t112.t2.t2 (cl (= tptp.nil tptp.sk1)) :rule symm :premises (t112.t2.t1))
% 0.19/0.57 (step t112.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t112.t2.a0))
% 0.19/0.57 (step t112.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t112.t2.t3))
% 0.19/0.57 (step t112.t2.t5 (cl (= tptp.nil tptp.sk3)) :rule trans :premises (t112.t2.t2 t112.t2.t4))
% 0.19/0.57 (step t112.t2 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) :rule subproof :discharge (t112.t2.a0 t112.t2.a1))
% 0.19/0.57 (step t112.t3 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.19/0.57 (step t112.t4 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) :rule and_pos)
% 0.19/0.57 (step t112.t5 (cl (= tptp.nil tptp.sk3) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t112.t2 t112.t3 t112.t4))
% 0.19/0.57 (step t112.t6 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk3)) :rule reordering :premises (t112.t5))
% 0.19/0.57 (step t112.t7 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk3)) :rule contraction :premises (t112.t6))
% 0.19/0.57 (step t112.t8 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk3)) :rule resolution :premises (t112.t1 t112.t7))
% 0.19/0.57 (step t112.t9 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule implies_neg2)
% 0.19/0.57 (step t112.t10 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t112.t8 t112.t9))
% 0.19/0.57 (step t112.t11 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3))) :rule contraction :premises (t112.t10))
% 0.19/0.57 (step t112.t12 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk3)) :rule implies :premises (t112.t11))
% 0.19/0.57 (step t112.t13 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) :rule and_neg)
% 0.19/0.57 (step t112.t14 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) :rule resolution :premises (t112.t13 t112.a0 t112.a1))
% 0.19/0.57 (step t112.t15 (cl (= tptp.nil tptp.sk3)) :rule resolution :premises (t112.t12 t112.t14))
% 0.19/0.57 (step t112 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) :rule subproof :discharge (t112.a0 t112.a1))
% 0.19/0.57 (step t113 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.19/0.57 (step t114 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) :rule and_pos)
% 0.19/0.57 (step t115 (cl (= tptp.nil tptp.sk3) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t112 t113 t114))
% 0.19/0.57 (step t116 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk3)) :rule reordering :premises (t115))
% 0.19/0.57 (step t117 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk3)) :rule contraction :premises (t116))
% 0.19/0.57 (step t118 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (= tptp.nil tptp.sk3)) :rule resolution :premises (t111 t117))
% 0.19/0.57 (step t119 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule implies_neg2)
% 0.19/0.57 (step t120 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t118 t119))
% 0.19/0.57 (step t121 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3))) :rule contraction :premises (t120))
% 0.19/0.57 (step t122 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk3)) :rule implies :premises (t121))
% 0.19/0.57 (step t123 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)) (= tptp.nil tptp.sk3)) :rule resolution :premises (t110 t122))
% 0.19/0.57 (step t124 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1)) (not (= tptp.sk1 tptp.sk3))) :rule reordering :premises (t123))
% 0.19/0.57 (step t125 (cl (= tptp.nil tptp.sk3)) :rule resolution :premises (t124 t107 a190))
% 0.19/0.57 (step t126 (cl) :rule resolution :premises (t1 t109 t125))
% 0.19/0.57
% 0.19/0.57 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.47HnQeETl9/cvc5---1.0.5_20529.smt2
% 0.19/0.57 % cvc5---1.0.5 exiting
% 0.19/0.57 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------