%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWC378+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n031.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:25:11 EDT 2023

% Result   : Theorem 0.21s 0.66s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : SWC378+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n031.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 16:34:10 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.66  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.TZtW3PIl9Q/cvc5---1.0.5_4070.p...
% 0.21/0.66  ------- get file name : TPTP file name is SWC378+1
% 0.21/0.66  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_4070.smt2...
% 0.21/0.66  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.66  % SZS status Theorem for SWC378+1
% 0.21/0.66  % SZS output start Proof for SWC378+1
% 0.21/0.66  (
% 0.21/0.66  (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)) (or (not (tptp.ssList X)) (not (= V X)) (not (= U W)) (forall ((Y $$unsorted)) (=> (tptp.ssList Y) (forall ((Z $$unsorted)) (or (not (tptp.ssList Z)) (not (= (tptp.app Y Z) X)) (not (= (tptp.app Z Y) W)))))) (forall ((X1 $$unsorted)) (let ((_let_1 (tptp.memberP U X1))) (let ((_let_2 (tptp.memberP V X1))) (or (not (tptp.ssItem X1)) (and (not _let_2) (not _let_1)) (and _let_2 _let_1)))))))))))))))) (let ((_let_2 (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))))))))))) (let ((_let_3 (tptp.memberP SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_4 (tptp.memberP SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_5 (or _let_4 _let_3))) (let ((_let_6 (tptp.app SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_7 (tptp.memberP _let_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_8 (= _let_7 _let_5))) (let ((_let_9 (tptp.ssList SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_10 (not _let_9))) (let ((_let_11 (tptp.ssList SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_12 (not _let_11))) (let ((_let_13 (tptp.ssItem SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_14 (not _let_13))) (let ((_let_15 (or _let_14 _let_12 _let_10 _let_8))) (let ((_let_16 (forall ((U $$unsorted) (BOUND_VARIABLE_3869 $$unsorted) (BOUND_VARIABLE_3867 $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList BOUND_VARIABLE_3867)) (not (tptp.ssList BOUND_VARIABLE_3869)) (= (tptp.memberP (tptp.app BOUND_VARIABLE_3867 BOUND_VARIABLE_3869) U) (or (tptp.memberP BOUND_VARIABLE_3867 U) (tptp.memberP BOUND_VARIABLE_3869 U))))))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (_let_16))) (let ((_let_19 ((tptp.memberP (tptp.app BOUND_VARIABLE_3867 BOUND_VARIABLE_3869) U)))) (let ((_let_20 (tptp.app SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_21 (tptp.memberP _let_20 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_22 (and _let_7 _let_21))) (let ((_let_23 (not _let_21))) (let ((_let_24 (not _let_7))) (let ((_let_25 (and _let_24 _let_23))) (let ((_let_26 (or (not (tptp.ssList _let_20)) (not (tptp.ssList _let_6)) _let_14 _let_25 _let_22 _let_12 _let_10))) (let ((_let_27 (forall ((BOUND_VARIABLE_5386 $$unsorted) (BOUND_VARIABLE_5384 $$unsorted) (BOUND_VARIABLE_5382 $$unsorted)) (let ((_let_1 (tptp.app BOUND_VARIABLE_5384 BOUND_VARIABLE_5382))) (let ((_let_2 (tptp.memberP _let_1 BOUND_VARIABLE_5386))) (let ((_let_3 (tptp.app BOUND_VARIABLE_5382 BOUND_VARIABLE_5384))) (let ((_let_4 (tptp.memberP _let_3 BOUND_VARIABLE_5386))) (or (not (tptp.ssList _let_1)) (not (tptp.ssList _let_3)) (not (tptp.ssItem BOUND_VARIABLE_5386)) (and (not _let_4) (not _let_2)) (and _let_4 _let_2) (not (tptp.ssList BOUND_VARIABLE_5382)) (not (tptp.ssList BOUND_VARIABLE_5384)))))))))) (let ((_let_28 (not _let_26))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_30 (or))) (let ((_let_31 (not _let_27))) (let ((_let_32 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_29) :args (_let_31))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_31) _let_27))) (REFL :args (_let_28)) :args _let_30)) _let_29 :args (_let_28 true _let_27)))) (let ((_let_33 (REFL :args (_let_26)))) (let ((_let_34 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_26 6)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_9))) :args _let_30)) :args ((or _let_9 _let_26))) _let_32 :args (_let_9 true _let_26)))) (let ((_let_35 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_26 5)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_11))) :args _let_30)) :args ((or _let_11 _let_26))) _let_32 :args (_let_11 true _let_26)))) (let ((_let_36 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_26 2)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_13))) :args _let_30)) :args ((or _let_13 _let_26))) _let_32 :args (_let_13 true _let_26)))) (let ((_let_37 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_15)) :args ((or _let_14 _let_12 _let_10 _let_8 (not _let_15)))) _let_36 _let_35 _let_34 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_E_MATCHING _let_19)) :args _let_18)) _let_17 :args (_let_15 false _let_16)) :args (_let_8 false _let_13 false _let_11 false _let_9 false _let_15)))) (let ((_let_38 (or _let_3 _let_4))) (let ((_let_39 (= _let_21 _let_38))) (let ((_let_40 (_let_25))) (let ((_let_41 (not _let_8))) (let ((_let_42 (not _let_5))) (let ((_let_43 (_let_8))) (let ((_let_44 (or _let_14 _let_10 _let_12 _let_39))) (let ((_let_45 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_44)) :args ((or _let_14 _let_12 _let_10 _let_39 (not _let_44)))) _let_36 _let_35 _let_34 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING _let_19)) :args _let_18)) _let_17 :args (_let_44 false _let_16)) :args (_let_39 false _let_13 false _let_11 false _let_9 false _let_44)))) (let ((_let_46 (not _let_39))) (let ((_let_47 (_let_39))) (let ((_let_48 (not _let_38))) (let ((_let_49 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_38)) :args ((or _let_4 _let_3 _let_48))) (CNF_OR_NEG :args (_let_5 1)) (CNF_OR_NEG :args (_let_5 0)) (REORDERING (CNF_EQUIV_POS1 :args _let_47) :args ((or _let_23 _let_38 _let_46))) _let_45 (REORDERING (CNF_EQUIV_POS2 :args _let_43) :args ((or _let_7 _let_42 _let_41))) _let_37 (REORDERING (EQ_RESOLVE (CNF_AND_NEG :args _let_40) (CONG (REFL :args _let_40) (MACRO_SR_PRED_INTRO :args ((= (not _let_24) _let_7))) (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_21))) :args _let_30)) :args ((or _let_7 _let_21 _let_25))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_26 3)) _let_32 :args ((not _let_25) true _let_26)) :args (_let_7 true _let_3 true _let_4 false _let_38 false _let_39 true _let_5 false _let_8 false _let_21 true _let_25)))) (let ((_let_50 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args _let_47) :args ((or _let_21 _let_48 _let_46))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_NEG :args (_let_22)) :args ((or _let_24 _let_23 _let_22))) _let_49 (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_26 4)) _let_32 :args ((not _let_22) true _let_26)) :args (_let_23 false _let_7 true _let_22)) _let_45 :args (_let_48 true _let_21 false _let_39)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_5)) :args ((or _let_4 _let_3 _let_42))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_38 1)) _let_50 :args ((not _let_4) true _let_38)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_38 0)) _let_50 :args ((not _let_3) true _let_38)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args _let_43) :args ((or _let_24 _let_5 _let_41))) _let_49 _let_37 :args (_let_5 false _let_7 false _let_8)) :args (false true _let_4 true _let_3 false _let_5)) :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)))))) _let_2 (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)))))) (forall ((U $$unsorted)) (=> (tptp.ssList U) (tptp.frontsegP U U))) (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)))))))) (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.21/0.66  )
% 0.21/0.66  % SZS output end Proof for SWC378+1
% 0.21/0.66  % cvc5---1.0.5 exiting
% 0.21/0.67  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------