%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n007.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 21:51:01 EDT 2023

% Result   : Theorem 0.20s 0.55s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 29 06:50:43 EDT 2023
% 0.20/0.35  % CPUTime    : 
% 0.20/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.55  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.5SrJ7V7Cnm/cvc5---1.0.5_7797.p...
% 0.20/0.55  ------- get file name : TPTP file name is SWV405+1
% 0.20/0.55  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_7797.smt2...
% 0.20/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.55  % SZS status Theorem for SWV405+1
% 0.20/0.55  % SZS output start Proof for SWV405+1
% 0.20/0.55  (
% 0.20/0.55  (let ((_let_1 (not (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.check_cpq (tptp.triple U tptp.create_slb V)) (forall ((W $$unsorted) (X $$unsorted)) (=> (tptp.pair_in_list tptp.create_slb W X) (tptp.less_than X W)))))))) (let ((_let_2 (forall ((U $$unsorted) (V $$unsorted)) (tptp.check_cpq (tptp.triple U tptp.create_slb V))))) (let ((_let_3 (forall ((U $$unsorted) (V $$unsorted)) (not (tptp.pair_in_list tptp.create_slb U V))))) (let ((_let_4 (tptp.check_cpq (tptp.triple SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 tptp.create_slb SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3)))) (let ((_let_5 (_let_2))) (let ((_let_6 (ASSUME :args _let_5))) (let ((_let_7 (forall ((W $$unsorted) (X $$unsorted)) (or (not (tptp.pair_in_list tptp.create_slb W X)) (tptp.less_than X W))))) (let ((_let_8 (= _let_7 _let_4))) (let ((_let_9 (tptp.pair_in_list tptp.create_slb SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_10 (not _let_9))) (let ((_let_11 (or _let_10 (tptp.less_than SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))) (let ((_let_12 (_let_3))) (let ((_let_13 (ASSUME :args _let_12))) (let ((_let_14 (or))) (let ((_let_15 (not _let_7))) (let ((_let_16 (_let_15))) (let ((_let_17 (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.check_cpq (tptp.triple U tptp.create_slb V)) (forall ((W $$unsorted) (X $$unsorted)) (or (not (tptp.pair_in_list tptp.create_slb W X)) (tptp.less_than X W))))))) (let ((_let_18 (not _let_8))) (let ((_let_19 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_20 (not _let_17))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_6 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.triple U tptp.create_slb V)))) :args _let_5)) (MACRO_RESOLUTION_TRUST (CNF_EQUIV_NEG2 :args (_let_8)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_19) :args (_let_20)) (REWRITE :args ((=> _let_20 (not (= _let_4 _let_7))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_20) _let_17))) (REFL :args (_let_18)) :args _let_14)) _let_19 :args (_let_18 true _let_17)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_16)) :args _let_16)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_15) _let_7))) (REFL :args ((not _let_11))) :args _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_11 0)) (CONG (REFL :args (_let_11)) (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_9))) :args _let_14)) :args ((or _let_9 _let_11))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_13 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.pair_in_list tptp.create_slb U V) false))))) :args _let_12)) _let_13 :args (_let_10 false _let_3)) :args (_let_11 true _let_9)) :args (_let_7 false _let_11)) :args ((not _let_4) true _let_8 false _let_7)) _let_6 :args (false true _let_4 false _let_2)) :args ((forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (=> (and (tptp.less_than U V) (tptp.less_than V W)) (tptp.less_than U W))) (forall ((U $$unsorted) (V $$unsorted)) (or (tptp.less_than U V) (tptp.less_than V U))) (forall ((U $$unsorted)) (tptp.less_than U U)) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.strictly_less_than U V) (and (tptp.less_than U V) (not (tptp.less_than V U))))) (forall ((U $$unsorted)) (tptp.less_than tptp.bottom U)) (not (tptp.isnonempty_slb tptp.create_slb)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (tptp.isnonempty_slb (tptp.insert_slb U (tptp.pair V W)))) (forall ((U $$unsorted)) (not (tptp.contains_slb tptp.create_slb U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (= (tptp.contains_slb (tptp.insert_slb U (tptp.pair V X)) W) (or (tptp.contains_slb U W) (= V W)))) _let_3 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.pair_in_list (tptp.insert_slb U (tptp.pair V X)) W Y) (or (tptp.pair_in_list U W Y) (and (= V W) (= X Y))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (= (tptp.remove_slb (tptp.insert_slb U (tptp.pair V W)) V) U)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.pair V X))) (=> (and (not (= V W)) (tptp.contains_slb U W)) (= (tptp.remove_slb (tptp.insert_slb U _let_1) W) (tptp.insert_slb (tptp.remove_slb U W) _let_1))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (= (tptp.lookup_slb (tptp.insert_slb U (tptp.pair V W)) V) W)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (=> (and (not (= V W)) (tptp.contains_slb U W)) (= (tptp.lookup_slb (tptp.insert_slb U (tptp.pair V X)) W) (tptp.lookup_slb U W)))) (forall ((U $$unsorted)) (= (tptp.update_slb tptp.create_slb U) tptp.create_slb)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (=> (tptp.strictly_less_than X W) (= (tptp.update_slb (tptp.insert_slb U (tptp.pair V X)) W) (tptp.insert_slb (tptp.update_slb U W) (tptp.pair V W))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.pair V X))) (=> (tptp.less_than W X) (= (tptp.update_slb (tptp.insert_slb U _let_1) W) (tptp.insert_slb (tptp.update_slb U W) _let_1))))) (forall ((U $$unsorted)) (tptp.succ_cpq U U)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (=> (tptp.succ_cpq U V) (tptp.succ_cpq U (tptp.insert_cpq V W)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (=> (tptp.succ_cpq U V) (tptp.succ_cpq U (tptp.remove_cpq V W)))) (forall ((U $$unsorted) (V $$unsorted)) (=> (tptp.succ_cpq U V) (tptp.succ_cpq U (tptp.findmin_cpq_eff V)))) (forall ((U $$unsorted) (V $$unsorted)) (=> (tptp.succ_cpq U V) (tptp.succ_cpq U (tptp.removemin_cpq_eff V)))) _let_2 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (=> (tptp.less_than Y X) (= (tptp.check_cpq (tptp.triple U (tptp.insert_slb V (tptp.pair X Y)) W)) (tptp.check_cpq (tptp.triple U V W))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (=> (tptp.strictly_less_than X Y) (= (tptp.check_cpq (tptp.triple U (tptp.insert_slb V (tptp.pair X Y)) W)) false))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (= (tptp.contains_cpq (tptp.triple U V W) X) (tptp.contains_slb V X))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.ok (tptp.triple U V tptp.bad)) false)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (=> (not (tptp.ok (tptp.triple U V W))) (= W tptp.bad))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (= (tptp.insert_cpq (tptp.triple U V W) X) (tptp.triple (tptp.insert_pqp U X) (tptp.insert_slb V (tptp.pair X tptp.bottom)) W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (=> (not (tptp.contains_slb V X)) (= (tptp.remove_cpq (tptp.triple U V W) X) (tptp.triple U V tptp.bad)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (=> (and (tptp.contains_slb V X) (tptp.less_than (tptp.lookup_slb V X) X)) (= (tptp.remove_cpq (tptp.triple U V W) X) (tptp.triple (tptp.remove_pqp U X) (tptp.remove_slb V X) W)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (=> (and (tptp.contains_slb V X) (tptp.strictly_less_than X (tptp.lookup_slb V X))) (= (tptp.remove_cpq (tptp.triple U V W) X) (tptp.triple (tptp.remove_pqp U X) (tptp.remove_slb V X) tptp.bad)))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.findmin_cpq_eff (tptp.triple U tptp.create_slb V)) (tptp.triple U tptp.create_slb tptp.bad))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.findmin_pqp_res U))) (=> (and (not (= V tptp.create_slb)) (not (tptp.contains_slb V _let_1))) (= (tptp.findmin_cpq_eff (tptp.triple U V W)) (tptp.triple U (tptp.update_slb V _let_1) tptp.bad))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.findmin_pqp_res U))) (=> (and (not (= V tptp.create_slb)) (tptp.contains_slb V _let_1) (tptp.strictly_less_than _let_1 (tptp.lookup_slb V _let_1))) (= (tptp.findmin_cpq_eff (tptp.triple U V W)) (tptp.triple U (tptp.update_slb V _let_1) tptp.bad))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.findmin_pqp_res U))) (=> (and (not (= V tptp.create_slb)) (tptp.contains_slb V _let_1) (tptp.less_than (tptp.lookup_slb V _let_1) _let_1)) (= (tptp.findmin_cpq_eff (tptp.triple U V W)) (tptp.triple U (tptp.update_slb V _let_1) W))))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.findmin_cpq_res (tptp.triple U tptp.create_slb V)) tptp.bottom)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (=> (not (= V tptp.create_slb)) (= (tptp.findmin_cpq_res (tptp.triple U V W)) (tptp.findmin_pqp_res U)))) (forall ((U $$unsorted)) (= (tptp.removemin_cpq_eff U) (tptp.remove_cpq (tptp.findmin_cpq_eff U) (tptp.findmin_cpq_res U)))) (forall ((U $$unsorted)) (= (tptp.removemin_cpq_res U) (tptp.findmin_cpq_res U))) _let_1 true)))))))))))))))))))))))
% 0.20/0.55  )
% 0.20/0.55  % SZS output end Proof for SWV405+1
% 0.20/0.55  % cvc5---1.0.5 exiting
% 0.20/0.55  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------