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