TSTP Solution File: SWC353+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC353+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n017.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:24:59 EDT 2023
% Result : Theorem 0.24s 0.64s
% Output : Proof 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SWC353+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : do_cvc5 %s %d
% 0.15/0.39 % Computer : n017.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Mon Aug 28 14:03:58 EDT 2023
% 0.15/0.39 % CPUTime :
% 0.24/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.24/0.64 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.e2EOW6taHk/cvc5---1.0.5_24022.p...
% 0.24/0.64 ------- get file name : TPTP file name is SWC353+1
% 0.24/0.64 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24022.smt2...
% 0.24/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.24/0.64 % SZS status Theorem for SWC353+1
% 0.24/0.64 % SZS output start Proof for SWC353+1
% 0.24/0.64 (
% 0.24/0.64 (let ((_let_1 (not (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (or (not (= V X)) (not (= U W)) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (or (not (= (tptp.app W Y) X)) (not (tptp.totalorderedP W)) (exists ((Z $$unsorted)) (and (tptp.ssItem Z) (exists ((X1 $$unsorted)) (and (tptp.ssList X1) (= (tptp.app (tptp.cons Z tptp.nil) X1) Y) (exists ((X2 $$unsorted)) (and (tptp.ssItem X2) (exists ((X3 $$unsorted)) (and (tptp.ssList X3) (= (tptp.app X3 (tptp.cons X2 tptp.nil)) W) (tptp.leq X2 Z)))))))))))) (tptp.frontsegP V U) (and (not (= tptp.nil X)) (= tptp.nil W)))))))))))))) (let ((_let_2 (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (tptp.frontsegP U V) (tptp.frontsegP (tptp.app U W) V)))))))))) (let ((_let_3 (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.frontsegP U U))))) (let ((_let_4 (tptp.ssList SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_5 (tptp.app SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_6 (tptp.frontsegP _let_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_7 (tptp.ssList SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_8 (not _let_7))) (let ((_let_9 (tptp.frontsegP SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_10 (not _let_9))) (let ((_let_11 (not _let_4))) (let ((_let_12 (or _let_11 _let_11 _let_10 _let_8 _let_6))) (let ((_let_13 (and (not (= tptp.nil _let_5)) (= tptp.nil SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))) (let ((_let_14 (not (tptp.ssList _let_5)))) (let ((_let_15 (not (tptp.totalorderedP SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))) (let ((_let_16 (or _let_11 _let_15 _let_14 _let_6 _let_13 _let_8 (not (forall ((Z $$unsorted) (BOUND_VARIABLE_5304 $$unsorted) (BOUND_VARIABLE_5291 $$unsorted) (BOUND_VARIABLE_5289 $$unsorted)) (or (not (tptp.ssItem Z)) (not (tptp.ssItem BOUND_VARIABLE_5289)) (not (tptp.leq BOUND_VARIABLE_5289 Z)) (not (tptp.ssList BOUND_VARIABLE_5291)) (not (= (tptp.app BOUND_VARIABLE_5291 (tptp.cons BOUND_VARIABLE_5289 tptp.nil)) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)) (not (tptp.ssList BOUND_VARIABLE_5304)) (not (= (tptp.app (tptp.cons Z tptp.nil) BOUND_VARIABLE_5304) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5)))))))) (let ((_let_17 (forall ((U $$unsorted) (BOUND_VARIABLE_5475 $$unsorted)) (let ((_let_1 (tptp.app U BOUND_VARIABLE_5475))) (or (not (tptp.ssList U)) (not (tptp.totalorderedP U)) (not (tptp.ssList _let_1)) (tptp.frontsegP _let_1 U) (and (not (= tptp.nil _let_1)) (= tptp.nil U)) (not (tptp.ssList BOUND_VARIABLE_5475)) (not (forall ((Z $$unsorted) (BOUND_VARIABLE_5304 $$unsorted) (BOUND_VARIABLE_5291 $$unsorted) (BOUND_VARIABLE_5289 $$unsorted)) (or (not (tptp.ssItem Z)) (not (tptp.ssItem BOUND_VARIABLE_5289)) (not (tptp.leq BOUND_VARIABLE_5289 Z)) (not (tptp.ssList BOUND_VARIABLE_5291)) (not (= U (tptp.app BOUND_VARIABLE_5291 (tptp.cons BOUND_VARIABLE_5289 tptp.nil)))) (not (tptp.ssList BOUND_VARIABLE_5304)) (not (= (tptp.app (tptp.cons Z tptp.nil) BOUND_VARIABLE_5304) BOUND_VARIABLE_5475)))))))))) (let ((_let_18 (not _let_16))) (let ((_let_19 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_20 (or))) (let ((_let_21 (not _let_17))) (let ((_let_22 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_19) :args (_let_21)) (REWRITE :args ((=> _let_21 (not (or _let_11 _let_15 _let_14 _let_6 _let_13 _let_8 (not (forall ((Z $$unsorted) (BOUND_VARIABLE_5304 $$unsorted) (BOUND_VARIABLE_5291 $$unsorted) (BOUND_VARIABLE_5289 $$unsorted)) (or (not (tptp.ssItem Z)) (not (tptp.ssItem BOUND_VARIABLE_5289)) (not (tptp.leq BOUND_VARIABLE_5289 Z)) (not (tptp.ssList BOUND_VARIABLE_5291)) (not (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 (tptp.app BOUND_VARIABLE_5291 (tptp.cons BOUND_VARIABLE_5289 tptp.nil)))) (not (tptp.ssList BOUND_VARIABLE_5304)) (not (= (tptp.app (tptp.cons Z tptp.nil) BOUND_VARIABLE_5304) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5)))))))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_21) _let_17))) (REFL :args (_let_18)) :args _let_20)) _let_19 :args (_let_18 true _let_17)))) (let ((_let_23 (REFL :args (_let_16)))) (let ((_let_24 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_16 0)) (CONG _let_23 (MACRO_SR_PRED_INTRO :args ((= (not _let_11) _let_4))) :args _let_20)) :args ((or _let_4 _let_16))) _let_22 :args (_let_4 true _let_16)))) (let ((_let_25 (forall ((U $$unsorted) (BOUND_VARIABLE_4074 $$unsorted) (BOUND_VARIABLE_4072 $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList BOUND_VARIABLE_4072)) (not (tptp.frontsegP U BOUND_VARIABLE_4072)) (not (tptp.ssList BOUND_VARIABLE_4074)) (tptp.frontsegP (tptp.app U BOUND_VARIABLE_4074) BOUND_VARIABLE_4072))))) (let ((_let_26 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_27 (or _let_11 _let_9))) (let ((_let_28 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (FACTORING (CNF_OR_POS :args (_let_12))) :args ((or _let_11 _let_6 _let_8 _let_10 (not _let_12)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_27)) :args ((or _let_11 _let_9 (not _let_27)))) _let_24 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_29 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.ssList U) false))))) :args (_let_28))) _let_29 :args (_let_27 false _let_28)) :args (_let_9 false _let_4 false _let_27)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.frontsegP (tptp.app U BOUND_VARIABLE_4074) BOUND_VARIABLE_4072) true))))) :args (_let_25))) _let_26 :args (_let_12 false _let_25)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_16 5)) (CONG _let_23 (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_7))) :args _let_20)) :args ((or _let_7 _let_16))) _let_22 :args (_let_7 true _let_16)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_16 3)) _let_22 :args ((not _let_6) true _let_16)) _let_24 :args (false false _let_9 false _let_12 false _let_7 true _let_6 false _let_4)) :args ((forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.neq U V) (not (= U V))))))) (exists ((U $$unsorted)) (and (tptp.ssItem U) (exists ((V $$unsorted)) (and (tptp.ssItem V) (not (= U V)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.memberP U V) (exists ((W $$unsorted)) (and (tptp.ssList W) (exists ((X $$unsorted)) (and (tptp.ssList X) (= (tptp.app W (tptp.cons V X)) U)))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.singletonP U) (exists ((V $$unsorted)) (and (tptp.ssItem V) (= (tptp.cons V tptp.nil) U)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (= (tptp.frontsegP U V) (exists ((W $$unsorted)) (and (tptp.ssList W) (= (tptp.app V W) U)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (= (tptp.rearsegP U V) (exists ((W $$unsorted)) (and (tptp.ssList W) (= (tptp.app W V) U)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (= (tptp.segmentP U V) (exists ((W $$unsorted)) (and (tptp.ssList W) (exists ((X $$unsorted)) (and (tptp.ssList X) (= (tptp.app (tptp.app W V) X) U)))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.cyclefreeP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (=> (tptp.ssList Z) (=> (= (tptp.app (tptp.app X (tptp.cons V Y)) (tptp.cons W Z)) U) (not (and (tptp.leq V W) (tptp.leq W V))))))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.totalorderP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (=> (tptp.ssList Z) (=> (= (tptp.app (tptp.app X (tptp.cons V Y)) (tptp.cons W Z)) U) (or (tptp.leq V W) (tptp.leq W V)))))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.strictorderP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (=> (tptp.ssList Z) (=> (= (tptp.app (tptp.app X (tptp.cons V Y)) (tptp.cons W Z)) U) (or (tptp.lt V W) (tptp.lt W V)))))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.totalorderedP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (=> (tptp.ssList Z) (=> (= (tptp.app (tptp.app X (tptp.cons V Y)) (tptp.cons W Z)) U) (tptp.leq V W))))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.strictorderedP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (=> (tptp.ssList Z) (=> (= (tptp.app (tptp.app X (tptp.cons V Y)) (tptp.cons W Z)) U) (tptp.lt V W))))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.duplicatefreeP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (=> (tptp.ssList Z) (=> (= (tptp.app (tptp.app X (tptp.cons V Y)) (tptp.cons W Z)) U) (not (= V W)))))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.equalelemsP U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (=> (= (tptp.app X (tptp.cons V (tptp.cons W Y))) U) (= V W))))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (= (tptp.neq U V) (not (= U V))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (tptp.ssList (tptp.cons V U)))))) (tptp.ssList tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (not (= (tptp.cons V U) U)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (forall ((X $$unsorted)) (=> (tptp.ssItem X) (=> (= (tptp.cons W U) (tptp.cons X V)) (and (= W X) (= V U))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (or (= tptp.nil U) (exists ((V $$unsorted)) (and (tptp.ssList V) (exists ((W $$unsorted)) (and (tptp.ssItem W) (= (tptp.cons W V) U)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (not (= tptp.nil (tptp.cons V U))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (=> (not (= tptp.nil U)) (tptp.ssItem (tptp.hd U))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.hd (tptp.cons V U)) V))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (=> (not (= tptp.nil U)) (tptp.ssList (tptp.tl U))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.tl (tptp.cons V U)) U))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (tptp.ssList (tptp.app U V)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (= (tptp.cons W (tptp.app V U)) (tptp.app (tptp.cons W V) U)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (=> (and (tptp.leq U V) (tptp.leq V U)) (= U V)))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (=> (and (tptp.leq U V) (tptp.leq V W)) (tptp.leq U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.leq U U))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.geq U V) (tptp.leq V U)))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (=> (tptp.lt U V) (not (tptp.lt V U))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (=> (and (tptp.lt U V) (tptp.lt V W)) (tptp.lt U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.gt U V) (tptp.lt V U)))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (= (tptp.memberP (tptp.app V W) U) (or (tptp.memberP V U) (tptp.memberP W U))))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (= (tptp.memberP (tptp.cons V W) U) (or (= U V) (tptp.memberP W U))))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (not (tptp.memberP tptp.nil U)))) (not (tptp.singletonP tptp.nil)) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (and (tptp.frontsegP U V) (tptp.frontsegP V W)) (tptp.frontsegP U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (=> (and (tptp.frontsegP U V) (tptp.frontsegP V U)) (= U V)))))) _let_3 _let_2 (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (= (tptp.frontsegP (tptp.cons U W) (tptp.cons V X)) (and (= U V) (tptp.frontsegP W X))))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.frontsegP U tptp.nil))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.frontsegP tptp.nil U) (= tptp.nil U)))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (and (tptp.rearsegP U V) (tptp.rearsegP V W)) (tptp.rearsegP U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (=> (and (tptp.rearsegP U V) (tptp.rearsegP V U)) (= U V)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.rearsegP U U))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (tptp.rearsegP U V) (tptp.rearsegP (tptp.app W U) V)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.rearsegP U tptp.nil))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.rearsegP tptp.nil U) (= tptp.nil U)))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (and (tptp.segmentP U V) (tptp.segmentP V W)) (tptp.segmentP U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (=> (and (tptp.segmentP U V) (tptp.segmentP V U)) (= U V)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.segmentP U U))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (forall ((X $$unsorted)) (=> (tptp.ssList X) (=> (tptp.segmentP U V) (tptp.segmentP (tptp.app (tptp.app W U) X) V)))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.segmentP U tptp.nil))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.segmentP tptp.nil U) (= tptp.nil U)))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.cyclefreeP (tptp.cons U tptp.nil)))) (tptp.cyclefreeP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.totalorderP (tptp.cons U tptp.nil)))) (tptp.totalorderP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.strictorderP (tptp.cons U tptp.nil)))) (tptp.strictorderP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (tptp.totalorderedP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (let ((_let_1 (= tptp.nil V))) (=> (tptp.ssList V) (= (tptp.totalorderedP (tptp.cons U V)) (or _let_1 (and (not _let_1) (tptp.totalorderedP V) (tptp.leq U (tptp.hd V)))))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.strictorderedP (tptp.cons U tptp.nil)))) (tptp.strictorderedP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (let ((_let_1 (= tptp.nil V))) (=> (tptp.ssList V) (= (tptp.strictorderedP (tptp.cons U V)) (or _let_1 (and (not _let_1) (tptp.strictorderedP V) (tptp.lt U (tptp.hd V)))))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))) (tptp.duplicatefreeP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.equalelemsP (tptp.cons U tptp.nil)))) (tptp.equalelemsP tptp.nil) (forall ((U $$unsorted)) (=> (tptp.ssList U) (=> (not (= tptp.nil U)) (exists ((V $$unsorted)) (and (tptp.ssItem V) (= (tptp.hd U) V)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (=> (not (= tptp.nil U)) (exists ((V $$unsorted)) (and (tptp.ssList V) (= (tptp.tl U) V)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (=> (and (not (= tptp.nil V)) (not (= tptp.nil U)) (= (tptp.hd V) (tptp.hd U)) (= (tptp.tl V) (tptp.tl U))) (= V U)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (=> (not (= tptp.nil U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U)))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (= (tptp.app W V) (tptp.app U V)) (= W U)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (=> (= (tptp.app V W) (tptp.app V U)) (= W U)))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.cons V U) (tptp.app (tptp.cons V tptp.nil) U)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (forall ((W $$unsorted)) (=> (tptp.ssList W) (= (tptp.app (tptp.app U V) W) (tptp.app U (tptp.app V W))))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (= (= tptp.nil (tptp.app U V)) (and (= tptp.nil V) (= tptp.nil U))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (=> (not (= tptp.nil U)) (= (tptp.hd (tptp.app U V)) (tptp.hd U))))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (forall ((V $$unsorted)) (=> (tptp.ssList V) (=> (not (= tptp.nil U)) (= (tptp.tl (tptp.app U V)) (tptp.app (tptp.tl U) V))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (=> (and (tptp.geq U V) (tptp.geq V U)) (= U V)))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (=> (and (tptp.geq U V) (tptp.geq V W)) (tptp.geq U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (tptp.geq U U))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (not (tptp.lt U U)))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (=> (and (tptp.leq U V) (tptp.lt V W)) (tptp.lt U W)))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (=> (tptp.leq U V) (or (= U V) (tptp.lt U V))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (= (tptp.lt U V) (and (not (= U V)) (tptp.leq U V))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (=> (tptp.gt U V) (not (tptp.gt V U))))))) (forall ((U $$unsorted)) (=> (tptp.ssItem U) (forall ((V $$unsorted)) (=> (tptp.ssItem V) (forall ((W $$unsorted)) (=> (tptp.ssItem W) (=> (and (tptp.gt U V) (tptp.gt V W)) (tptp.gt U W)))))))) _let_1 true))))))))))))))))))))))))))))))))
% 0.24/0.65 )
% 0.24/0.65 % SZS output end Proof for SWC353+1
% 0.24/0.65 % cvc5---1.0.5 exiting
% 0.24/0.65 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------