TSTP Solution File: SWC051-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC051-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:00:05 EDT 2024
% Result : Unsatisfiable 0.37s 0.65s
% Output : Proof 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC051-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.15 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 26 14:47:09 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.37/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.37/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.VwKERtCgtN/cvc5---1.0.5_22368.smt2
% 0.37/0.65 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.VwKERtCgtN/cvc5---1.0.5_22368.smt2
% 0.37/0.66 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.37/0.66 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.37/0.66 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.37/0.66 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.37/0.66 (assume a4 (tptp.strictorderP tptp.nil))
% 0.37/0.66 (assume a5 (tptp.totalorderP tptp.nil))
% 0.37/0.66 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.37/0.66 (assume a7 (tptp.ssList tptp.nil))
% 0.37/0.66 (assume a8 (tptp.ssItem tptp.skac3))
% 0.37/0.66 (assume a9 (tptp.ssItem tptp.skac2))
% 0.37/0.66 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.37/0.66 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.37/0.66 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.37/0.66 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.37/0.66 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.37/0.66 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.37/0.66 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.37/0.66 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.37/0.66 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.37/0.66 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.37/0.66 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.37/0.66 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.37/0.66 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.37/0.66 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.37/0.66 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.37/0.66 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.37/0.66 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.37/0.66 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.37/0.66 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.37/0.66 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.37/0.66 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.37/0.66 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.37/0.66 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.37/0.66 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.37/0.66 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.37/0.66 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.37/0.66 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.37/0.66 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.37/0.66 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.37/0.66 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.37/0.66 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.37/0.66 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.37/0.66 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.37/0.66 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.37/0.66 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.37/0.66 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.37/0.66 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.37/0.66 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.37/0.66 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.37/0.66 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.37/0.66 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.37/0.66 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.37/0.66 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.37/0.66 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.37/0.66 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.37/0.66 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.37/0.66 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.37/0.66 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.37/0.66 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.37/0.66 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.37/0.66 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.37/0.66 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.37/0.66 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.37/0.66 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.37/0.66 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.37/0.66 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.37/0.66 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.37/0.66 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.37/0.66 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.37/0.66 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.37/0.66 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.37/0.66 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.37/0.66 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.37/0.66 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.37/0.66 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.37/0.66 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.37/0.66 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.37/0.66 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.37/0.66 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.37/0.66 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.37/0.66 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.37/0.66 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.37/0.66 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.37/0.66 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.37/0.66 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.37/0.66 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.37/0.66 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.37/0.66 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.37/0.66 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.37/0.66 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.37/0.66 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.37/0.66 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.37/0.66 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.37/0.66 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.37/0.66 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.37/0.66 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.37/0.66 (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.37/0.66 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (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.37/0.66 (assume a185 (tptp.ssList tptp.sk1))
% 0.37/0.66 (assume a186 (tptp.ssList tptp.sk2))
% 0.37/0.66 (assume a187 (tptp.ssList tptp.sk3))
% 0.37/0.66 (assume a188 (tptp.ssList tptp.sk4))
% 0.37/0.66 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.37/0.66 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.37/0.66 (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 0.37/0.66 (assume a192 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))))
% 0.37/0.66 (assume a193 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 0.37/0.66 (assume a194 (or (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk3 tptp.nil)))
% 0.37/0.66 (assume a195 (or (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.rearsegP tptp.sk4 tptp.sk3)))
% 0.37/0.66 (step t1 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule or_pos)
% 0.37/0.66 (step t2 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))))) :rule reordering :premises (t1))
% 0.37/0.66 (step t3 (cl (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule and_neg)
% 0.37/0.66 (step t4 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t5)
% 0.37/0.66 (assume t5.a0 (= tptp.sk1 tptp.sk3))
% 0.37/0.66 (assume t5.a1 (tptp.rearsegP tptp.sk1 tptp.sk1))
% 0.37/0.66 (step t5.t1 (cl (=> (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t5.t2)
% 0.37/0.66 (assume t5.t2.a0 (tptp.rearsegP tptp.sk1 tptp.sk1))
% 0.37/0.66 (assume t5.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.37/0.66 (step t5.t2.t1 (cl (= (= (tptp.rearsegP tptp.sk1 tptp.sk3) true) (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule equiv_simplify)
% 0.37/0.66 (step t5.t2.t2 (cl (not (= (tptp.rearsegP tptp.sk1 tptp.sk3) true)) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule equiv1 :premises (t5.t2.t1))
% 0.37/0.66 (step t5.t2.t3 (cl (= tptp.sk1 tptp.sk1)) :rule refl)
% 0.37/0.66 (step t5.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t5.t2.a1))
% 0.37/0.66 (step t5.t2.t5 (cl (= (tptp.rearsegP tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule cong :premises (t5.t2.t3 t5.t2.t4))
% 0.37/0.66 (step t5.t2.t6 (cl (= (= (tptp.rearsegP tptp.sk1 tptp.sk1) true) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule equiv_simplify)
% 0.37/0.66 (step t5.t2.t7 (cl (= (tptp.rearsegP tptp.sk1 tptp.sk1) true) (not (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule equiv2 :premises (t5.t2.t6))
% 0.37/0.66 (step t5.t2.t8 (cl (= (tptp.rearsegP tptp.sk1 tptp.sk1) true)) :rule resolution :premises (t5.t2.t7 t5.t2.a0))
% 0.37/0.66 (step t5.t2.t9 (cl (= (tptp.rearsegP tptp.sk1 tptp.sk3) true)) :rule trans :premises (t5.t2.t5 t5.t2.t8))
% 0.37/0.66 (step t5.t2.t10 (cl (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t5.t2.t2 t5.t2.t9))
% 0.37/0.66 (step t5.t2 (cl (not (tptp.rearsegP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule subproof :discharge (t5.t2.a0 t5.t2.a1))
% 0.37/0.66 (step t5.t3 (cl (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.rearsegP tptp.sk1 tptp.sk1)) :rule and_pos)
% 0.37/0.66 (step t5.t4 (cl (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.37/0.66 (step t5.t5 (cl (tptp.rearsegP tptp.sk1 tptp.sk3) (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t5.t2 t5.t3 t5.t4))
% 0.37/0.66 (step t5.t6 (cl (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule reordering :premises (t5.t5))
% 0.37/0.66 (step t5.t7 (cl (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule contraction :premises (t5.t6))
% 0.37/0.66 (step t5.t8 (cl (=> (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t5.t1 t5.t7))
% 0.37/0.66 (step t5.t9 (cl (=> (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule implies_neg2)
% 0.37/0.66 (step t5.t10 (cl (=> (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (=> (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule resolution :premises (t5.t8 t5.t9))
% 0.37/0.66 (step t5.t11 (cl (=> (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule contraction :premises (t5.t10))
% 0.37/0.66 (step t5.t12 (cl (not (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule implies :premises (t5.t11))
% 0.37/0.66 (step t5.t13 (cl (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.37/0.66 (step t5.t14 (cl (and (tptp.rearsegP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t5.t13 t5.a1 t5.a0))
% 0.37/0.66 (step t5.t15 (cl (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t5.t12 t5.t14))
% 0.37/0.66 (step t5 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule subproof :discharge (t5.a0 t5.a1))
% 0.37/0.66 (step t6 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.37/0.66 (step t7 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (tptp.rearsegP tptp.sk1 tptp.sk1)) :rule and_pos)
% 0.37/0.66 (step t8 (cl (tptp.rearsegP tptp.sk1 tptp.sk3) (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t5 t6 t7))
% 0.37/0.66 (step t9 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule reordering :premises (t8))
% 0.37/0.66 (step t10 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule contraction :premises (t9))
% 0.37/0.66 (step t11 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t4 t10))
% 0.37/0.66 (step t12 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule implies_neg2)
% 0.37/0.66 (step t13 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule resolution :premises (t11 t12))
% 0.37/0.66 (step t14 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3))) :rule contraction :premises (t13))
% 0.37/0.66 (step t15 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.rearsegP tptp.sk1 tptp.sk1))) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule implies :premises (t14))
% 0.37/0.66 (step t16 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t3 t15))
% 0.37/0.66 (step t17 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1)) :rule or_pos)
% 0.37/0.66 (step t18 (cl (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1)))) :rule reordering :premises (t17))
% 0.37/0.66 (step t19 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U)))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t20)
% 0.37/0.66 (assume t20.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.37/0.66 (step t20.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 0.37/0.66 (step t20.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule or :premises (t20.t1))
% 0.37/0.66 (step t20.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule resolution :premises (t20.t2 t20.a0))
% 0.37/0.66 (step t20 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t20.a0))
% 0.37/0.66 (step t21 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule resolution :premises (t19 t20))
% 0.37/0.66 (step t22 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 0.37/0.66 (step t23 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t21 t22))
% 0.37/0.66 (step t24 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t23))
% 0.37/0.66 (step t25 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule implies :premises (t24))
% 0.37/0.66 (step t26 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.rearsegP tptp.sk1 tptp.sk1))) :rule resolution :premises (t25 a58))
% 0.37/0.66 (step t27 (cl (tptp.rearsegP tptp.sk1 tptp.sk1)) :rule resolution :premises (t18 a185 t26))
% 0.37/0.66 (step t28 (cl (tptp.rearsegP tptp.sk1 tptp.sk3)) :rule resolution :premises (t16 a190 t27))
% 0.37/0.66 (step t29 (cl (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.rearsegP tptp.sk4 tptp.sk3))) :rule and_neg)
% 0.37/0.66 (step t30 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t31)
% 0.37/0.66 (assume t31.a0 (= tptp.sk2 tptp.sk4))
% 0.37/0.66 (assume t31.a1 (tptp.rearsegP tptp.sk4 tptp.sk3))
% 0.37/0.66 (step t31.t1 (cl (=> (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t31.t2)
% 0.37/0.66 (assume t31.t2.a0 (tptp.rearsegP tptp.sk4 tptp.sk3))
% 0.37/0.66 (assume t31.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.37/0.66 (step t31.t2.t1 (cl (= (= (tptp.rearsegP tptp.sk2 tptp.sk3) true) (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule equiv_simplify)
% 0.37/0.66 (step t31.t2.t2 (cl (not (= (tptp.rearsegP tptp.sk2 tptp.sk3) true)) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule equiv1 :premises (t31.t2.t1))
% 0.37/0.66 (step t31.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t31.t2.a1))
% 0.37/0.66 (step t31.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t31.t2.t3))
% 0.37/0.66 (step t31.t2.t5 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 0.37/0.66 (step t31.t2.t6 (cl (= (tptp.rearsegP tptp.sk2 tptp.sk3) (tptp.rearsegP tptp.sk4 tptp.sk3))) :rule cong :premises (t31.t2.t4 t31.t2.t5))
% 0.37/0.66 (step t31.t2.t7 (cl (= (= (tptp.rearsegP tptp.sk4 tptp.sk3) true) (tptp.rearsegP tptp.sk4 tptp.sk3))) :rule equiv_simplify)
% 0.37/0.66 (step t31.t2.t8 (cl (= (tptp.rearsegP tptp.sk4 tptp.sk3) true) (not (tptp.rearsegP tptp.sk4 tptp.sk3))) :rule equiv2 :premises (t31.t2.t7))
% 0.37/0.66 (step t31.t2.t9 (cl (= (tptp.rearsegP tptp.sk4 tptp.sk3) true)) :rule resolution :premises (t31.t2.t8 t31.t2.a0))
% 0.37/0.66 (step t31.t2.t10 (cl (= (tptp.rearsegP tptp.sk2 tptp.sk3) true)) :rule trans :premises (t31.t2.t6 t31.t2.t9))
% 0.37/0.66 (step t31.t2.t11 (cl (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t31.t2.t2 t31.t2.t10))
% 0.37/0.66 (step t31.t2 (cl (not (tptp.rearsegP tptp.sk4 tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule subproof :discharge (t31.t2.a0 t31.t2.a1))
% 0.37/0.66 (step t31.t3 (cl (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.rearsegP tptp.sk4 tptp.sk3)) :rule and_pos)
% 0.37/0.66 (step t31.t4 (cl (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.37/0.66 (step t31.t5 (cl (tptp.rearsegP tptp.sk2 tptp.sk3) (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t31.t2 t31.t3 t31.t4))
% 0.37/0.66 (step t31.t6 (cl (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule reordering :premises (t31.t5))
% 0.37/0.66 (step t31.t7 (cl (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule contraction :premises (t31.t6))
% 0.37/0.66 (step t31.t8 (cl (=> (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t31.t1 t31.t7))
% 0.37/0.66 (step t31.t9 (cl (=> (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule implies_neg2)
% 0.37/0.66 (step t31.t10 (cl (=> (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (=> (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule resolution :premises (t31.t8 t31.t9))
% 0.37/0.66 (step t31.t11 (cl (=> (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule contraction :premises (t31.t10))
% 0.37/0.66 (step t31.t12 (cl (not (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule implies :premises (t31.t11))
% 0.37/0.66 (step t31.t13 (cl (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (tptp.rearsegP tptp.sk4 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.37/0.66 (step t31.t14 (cl (and (tptp.rearsegP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t31.t13 t31.a1 t31.a0))
% 0.37/0.66 (step t31.t15 (cl (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t31.t12 t31.t14))
% 0.37/0.66 (step t31 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule subproof :discharge (t31.a0 t31.a1))
% 0.37/0.66 (step t32 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.37/0.66 (step t33 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (tptp.rearsegP tptp.sk4 tptp.sk3)) :rule and_pos)
% 0.37/0.66 (step t34 (cl (tptp.rearsegP tptp.sk2 tptp.sk3) (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)))) :rule resolution :premises (t31 t32 t33))
% 0.37/0.66 (step t35 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule reordering :premises (t34))
% 0.37/0.66 (step t36 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule contraction :premises (t35))
% 0.37/0.66 (step t37 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t30 t36))
% 0.37/0.66 (step t38 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule implies_neg2)
% 0.37/0.66 (step t39 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule resolution :premises (t37 t38))
% 0.37/0.66 (step t40 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3))) :rule contraction :premises (t39))
% 0.37/0.66 (step t41 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.rearsegP tptp.sk4 tptp.sk3))) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule implies :premises (t40))
% 0.37/0.66 (step t42 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.rearsegP tptp.sk4 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t29 t41))
% 0.37/0.66 (step t43 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.rearsegP tptp.sk4 tptp.sk3)) :rule or :premises (a195))
% 0.37/0.66 (step t44 (cl (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule and_neg)
% 0.37/0.66 (step t45 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t46)
% 0.37/0.66 (assume t46.a0 (= tptp.sk2 tptp.sk4))
% 0.37/0.66 (assume t46.a1 (tptp.neq tptp.sk2 tptp.nil))
% 0.37/0.66 (step t46.t1 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t46.t2)
% 0.37/0.66 (assume t46.t2.a0 (tptp.neq tptp.sk2 tptp.nil))
% 0.37/0.66 (assume t46.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.37/0.66 (step t46.t2.t1 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) true) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_simplify)
% 0.37/0.66 (step t46.t2.t2 (cl (not (= (tptp.neq tptp.sk4 tptp.nil) true)) (tptp.neq tptp.sk4 tptp.nil)) :rule equiv1 :premises (t46.t2.t1))
% 0.37/0.66 (step t46.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t46.t2.a1))
% 0.37/0.66 (step t46.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t46.t2.t3))
% 0.37/0.66 (step t46.t2.t5 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t46.t2.t4))
% 0.37/0.66 (step t46.t2.t6 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.37/0.66 (step t46.t2.t7 (cl (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t46.t2.t5 t46.t2.t6))
% 0.37/0.66 (step t46.t2.t8 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 0.37/0.66 (step t46.t2.t9 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t46.t2.t8))
% 0.37/0.66 (step t46.t2.t10 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t46.t2.t9 t46.t2.a0))
% 0.37/0.66 (step t46.t2.t11 (cl (= (tptp.neq tptp.sk4 tptp.nil) true)) :rule trans :premises (t46.t2.t7 t46.t2.t10))
% 0.37/0.66 (step t46.t2.t12 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t46.t2.t2 t46.t2.t11))
% 0.37/0.66 (step t46.t2 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t46.t2.a0 t46.t2.a1))
% 0.37/0.66 (step t46.t3 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.37/0.66 (step t46.t4 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.37/0.66 (step t46.t5 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t46.t2 t46.t3 t46.t4))
% 0.37/0.66 (step t46.t6 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t46.t5))
% 0.37/0.66 (step t46.t7 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t46.t6))
% 0.37/0.66 (step t46.t8 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t46.t1 t46.t7))
% 0.37/0.66 (step t46.t9 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 0.37/0.66 (step t46.t10 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t46.t8 t46.t9))
% 0.37/0.66 (step t46.t11 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t46.t10))
% 0.37/0.66 (step t46.t12 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t46.t11))
% 0.37/0.66 (step t46.t13 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.37/0.66 (step t46.t14 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t46.t13 t46.a1 t46.a0))
% 0.37/0.66 (step t46.t15 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t46.t12 t46.t14))
% 0.37/0.66 (step t46 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t46.a0 t46.a1))
% 0.37/0.66 (step t47 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.37/0.66 (step t48 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.37/0.66 (step t49 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t46 t47 t48))
% 0.37/0.66 (step t50 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t49))
% 0.37/0.66 (step t51 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t50))
% 0.37/0.66 (step t52 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t45 t51))
% 0.37/0.66 (step t53 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 0.37/0.66 (step t54 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t52 t53))
% 0.37/0.66 (step t55 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t54))
% 0.37/0.66 (step t56 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t55))
% 0.37/0.66 (step t57 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t44 t56))
% 0.37/0.66 (step t58 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t57))
% 0.37/0.66 (step t59 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t58 a189 a191))
% 0.37/0.66 (step t60 (cl (tptp.rearsegP tptp.sk4 tptp.sk3)) :rule resolution :premises (t43 t59))
% 0.37/0.66 (step t61 (cl (tptp.rearsegP tptp.sk2 tptp.sk3)) :rule resolution :premises (t42 a189 t60))
% 0.37/0.66 (step t62 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A))))) :rule implies_neg1)
% 0.37/0.66 (anchor :step t63)
% 0.37/0.66 (assume t63.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))))
% 0.37/0.66 (step t63.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk3)))
% 0.37/0.66 (step t63.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) :rule or :premises (t63.t1))
% 0.37/0.66 (step t63.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t63.t2 t63.a0))
% 0.37/0.66 (step t63 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t63.a0))
% 0.37/0.66 (step t64 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t62 t63))
% 0.37/0.66 (step t65 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 0.37/0.66 (step t66 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))))) :rule resolution :premises (t64 t65))
% 0.37/0.66 (step t67 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3))))) :rule contraction :premises (t66))
% 0.37/0.66 (step t68 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.rearsegP tptp.sk2 A)) (not (tptp.rearsegP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) :rule implies :premises (t67))
% 0.37/0.66 (step t69 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk3)) (not (tptp.rearsegP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t68 a192))
% 0.37/0.66 (step t70 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk3 tptp.nil)) :rule or :premises (a194))
% 0.37/0.66 (step t71 (cl (tptp.neq tptp.sk3 tptp.nil)) :rule resolution :premises (t70 t59))
% 0.37/0.66 (step t72 (cl) :rule resolution :premises (t2 t28 t61 t69 t71 a187))
% 0.37/0.66
% 0.37/0.66 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.VwKERtCgtN/cvc5---1.0.5_22368.smt2
% 0.37/0.67 % cvc5---1.0.5 exiting
% 0.37/0.67 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------