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