TSTP Solution File: SWC118-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC118-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp
% 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 : Thu Aug 31 20:23:23 EDT 2023
% Result : Unsatisfiable 0.22s 0.71s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC118-1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/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 : Mon Aug 28 18:36:04 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.53 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.xbB6tjAP7I/cvc5---1.0.5_12499.p...
% 0.22/0.56 ------- get file name : TPTP file name is SWC118-1
% 0.22/0.57 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_12499.smt2...
% 0.22/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.71 % SZS status Unsatisfiable for SWC118-1
% 0.22/0.71 % SZS output start Proof for SWC118-1
% 0.22/0.71 (
% 0.22/0.71 (let ((_let_1 (tptp.segmentP tptp.sk2 tptp.sk1))) (let ((_let_2 (tptp.neq tptp.sk1 tptp.nil))) (let ((_let_3 (not _let_2))) (let ((_let_4 (or _let_3 (not _let_1)))) (let ((_let_5 (= tptp.nil tptp.sk1))) (let ((_let_6 (not _let_5))) (let ((_let_7 (= tptp.nil tptp.sk2))) (let ((_let_8 (not _let_7))) (let ((_let_9 (or _let_8 _let_6))) (let ((_let_10 (= tptp.nil tptp.sk3))) (let ((_let_11 (= tptp.nil tptp.sk4))) (let ((_let_12 (or _let_11 (not _let_10)))) (let ((_let_13 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (let ((_let_14 (= _let_13 tptp.sk4))) (let ((_let_15 (tptp.ssList tptp.sk6))) (let ((_let_16 (tptp.ssList tptp.sk5))) (let ((_let_17 (= tptp.sk1 tptp.sk3))) (let ((_let_18 (= tptp.sk2 tptp.sk4))) (let ((_let_19 (tptp.ssList tptp.sk3))) (let ((_let_20 (tptp.ssList tptp.sk2))) (let ((_let_21 (tptp.ssList tptp.sk1))) (let ((_let_22 (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))))) (let ((_let_23 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))) (let ((_let_24 (tptp.ssList tptp.nil))) (let ((_let_25 (ASSUME :args (_let_17)))) (let ((_let_26 (not _let_21))) (let ((_let_27 (not _let_24))) (let ((_let_28 (or _let_27 _let_26 _let_2 _let_5))) (let ((_let_29 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (let ((_let_30 (EQ_RESOLVE (ASSUME :args (_let_23)) (MACRO_SR_EQ_INTRO :args (_let_23 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_31 (tptp.segmentP _let_13 tptp.sk3))) (let ((_let_32 (= tptp.sk4 _let_13))) (let ((_let_33 (tptp.ssList _let_13))) (let ((_let_34 (not _let_33))) (let ((_let_35 (not _let_19))) (let ((_let_36 (not _let_16))) (let ((_let_37 (not _let_15))) (let ((_let_38 (or _let_37 _let_36 _let_35 _let_34 _let_31))) (let ((_let_39 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (tptp.app (tptp.app U V) W))) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList _let_1)) (tptp.segmentP _let_1 V)))))) (let ((_let_40 (EQ_RESOLVE (ASSUME :args (_let_22)) (MACRO_SR_EQ_INTRO :args (_let_22 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_41 (SYMM (ASSUME :args (_let_14))))) (let ((_let_42 (ASSUME :args (_let_18)))) (let ((_let_43 (ASSUME :args (_let_20)))) (let ((_let_44 (and _let_20 _let_18 _let_32))) (let ((_let_45 (_let_20 _let_18 _let_32))) (let ((_let_46 (SYMM _let_42))) (let ((_let_47 (SYMM _let_46))) (let ((_let_48 (SYMM (SYMM _let_41)))) (let ((_let_49 (not _let_17))) (let ((_let_50 (not _let_18))) (let ((_let_51 (and _let_18 _let_17 _let_32 _let_31))) (let ((_let_52 (ASSUME :args (_let_31)))) (let ((_let_53 (SYMM (SYMM _let_25)))) (let ((_let_54 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_28)) :args ((or _let_5 _let_2 _let_27 _let_26 (not _let_28)))) (MACRO_RESOLUTION_TRUST (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_51)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_52 _let_41 _let_42 _let_25) (SCOPE (TRUE_ELIM (TRANS (CONG (TRANS _let_47 _let_48) _let_53 :args (APPLY_UF tptp.segmentP)) (TRUE_INTRO _let_52))) :args (_let_31 _let_32 _let_18 _let_17))) :args (_let_18 _let_17 _let_32 _let_31))) :args (true _let_51)) :args ((or _let_1 _let_50 _let_49 (not _let_32) (not _let_31)))) _let_42 _let_25 _let_41 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_38)) :args ((or _let_35 _let_36 _let_37 _let_34 _let_31 (not _let_38)))) (ASSUME :args (_let_19)) (ASSUME :args (_let_16)) (ASSUME :args (_let_15)) (MACRO_RESOLUTION_TRUST (RESOLUTION (CNF_AND_NEG :args (_let_44)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_43 _let_42 _let_41) (SCOPE (TRUE_ELIM (TRANS (CONG (TRANS (SYMM _let_48) (SYMM _let_47)) :args (APPLY_UF tptp.ssList)) (TRUE_INTRO _let_43))) :args _let_45)) :args _let_45)) :args (true _let_44)) _let_43 _let_42 _let_41 :args (_let_33 false _let_20 false _let_18 false _let_32)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_40 :args (tptp.sk5 tptp.sk3 tptp.sk6 QUANTIFIERS_INST_E_MATCHING ((tptp.app (tptp.app U V) W)))) :args (_let_39))) _let_40 :args (_let_38 false _let_39)) :args (_let_31 false _let_19 false _let_16 false _let_15 false _let_33 false _let_38)) :args (_let_1 false _let_18 false _let_17 false _let_32 false _let_31)) :args (_let_3 false _let_1)) (ASSUME :args (_let_24)) (ASSUME :args (_let_21)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (tptp.nil tptp.sk1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.neq V U) true))))) :args (_let_29))) _let_30 :args (_let_28 false _let_29)) :args (_let_5 true _let_2 false _let_24 false _let_21 false _let_28)))) (let ((_let_55 (and _let_17 _let_5))) (let ((_let_56 (_let_17 _let_5))) (let ((_let_57 (ASSUME :args (_let_5)))) (let ((_let_58 (not _let_11))) (let ((_let_59 (and _let_18 _let_8))) (let ((_let_60 (ASSUME :args (_let_8)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (ASSUME :args (_let_12)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_59)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_60 _let_42) (SCOPE (FALSE_ELIM (TRANS (CONG (REFL :args (tptp.nil)) _let_46 :args (=)) (FALSE_INTRO _let_60))) :args (_let_8 _let_18))) :args (_let_18 _let_8))) :args (true _let_59)) (CONG (REFL :args (_let_50)) (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_7))) (REFL :args (_let_58)) :args (or))) :args ((or _let_7 _let_50 _let_58))) (MACRO_RESOLUTION_TRUST (ASSUME :args (_let_9)) _let_54 :args (_let_8 false _let_5)) _let_42 :args (_let_58 true _let_7 false _let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_55)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_25 _let_57) (SCOPE (TRANS (SYMM (SYMM _let_57)) _let_53) :args _let_56)) :args _let_56)) :args (true _let_55)) :args ((or _let_10 _let_6 _let_49))) _let_54 _let_25 :args (_let_10 false _let_5 false _let_17)) :args (false true _let_11 false _let_10)) :args ((tptp.equalelemsP tptp.nil) (tptp.duplicatefreeP tptp.nil) (tptp.strictorderedP tptp.nil) (tptp.totalorderedP tptp.nil) (tptp.strictorderP tptp.nil) (tptp.totalorderP tptp.nil) (tptp.cyclefreeP tptp.nil) _let_24 (tptp.ssItem tptp.skac3) (tptp.ssItem tptp.skac2) (not (tptp.singletonP tptp.nil)) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (not (= tptp.skac3 tptp.skac2)) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))) (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))) (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))) (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))) (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))) (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))) (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))) (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) _let_23 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (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)))) (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))) (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))) (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)))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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)))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))) (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))) (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))) (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))) (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))))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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)))) (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))) (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))) (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))) (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))) (forall ((U $$unsorted)) (let ((_let_1 (tptp.skaf74 U))) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons _let_1 (tptp.skaf76 U))) (tptp.cons _let_1 (tptp.skaf77 U))) U)))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) (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))) _let_22 (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))) (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))) (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))) (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))) (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)))) (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)))) (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))) (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))) (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))) (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))) (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))) (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)))) _let_21 _let_20 _let_19 (tptp.ssList tptp.sk4) _let_18 _let_17 _let_16 _let_15 _let_14 (tptp.totalorderedP tptp.sk3) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.leq A C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.leq C A)))) _let_12 _let_9 _let_4)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.22/0.71 )
% 0.22/0.71 % SZS output end Proof for SWC118-1
% 0.22/0.72 % cvc5---1.0.5 exiting
% 0.22/0.72 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------