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

% Computer : n015.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:50:51 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SWV365+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n015.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Aug 29 07:36:56 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.55  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.woSeh3Iqrf/cvc5---1.0.5_19764.p...
% 0.21/0.55  ------- get file name : TPTP file name is SWV365+1
% 0.21/0.55  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_19764.smt2...
% 0.21/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.55  % SZS status Theorem for SWV365+1
% 0.21/0.55  % SZS output start Proof for SWV365+1
% 0.21/0.55  (
% 0.21/0.55  (let ((_let_1 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.i (tptp.triple U tptp.create_slb X)) (tptp.i (tptp.triple V tptp.create_slb Y)))))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.i (tptp.triple U tptp.create_slb V)) tptp.create_pq)))) (let ((_let_4 (tptp.i (tptp.triple SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 tptp.create_slb SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5)))) (let ((_let_5 (tptp.i (tptp.triple SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 tptp.create_slb SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))) (let ((_let_6 (= _let_5 _let_4))) (let ((_let_7 (= tptp.create_pq _let_5))) (let ((_let_8 (= tptp.create_pq _let_4))) (let ((_let_9 (not _let_6))) (let ((_let_10 (_let_2))) (let ((_let_11 (ASSUME :args _let_10))) (let ((_let_12 (or))) (let ((_let_13 (_let_9))) (let ((_let_14 (forall ((U $$unsorted) (V $$unsorted)) (= tptp.create_pq (tptp.i (tptp.triple U tptp.create_slb V)))))) (let ((_let_15 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_16 (_let_14))) (let ((_let_17 ((tptp.triple U tptp.create_slb V)))) (let ((_let_18 (and _let_9 _let_7))) (let ((_let_19 (_let_9 _let_7))) (let ((_let_20 (ASSUME :args _let_13))) (let ((_let_21 (ASSUME :args (_let_7)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_18)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_20 _let_21) (SCOPE (FALSE_ELIM (TRANS (CONG (SYMM (SYMM _let_21)) (REFL :args (_let_4)) :args (=)) (FALSE_INTRO _let_20))) :args _let_19)) :args _let_19)) :args (true _let_18)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_9) _let_6))) (REFL :args ((not _let_7))) (REFL :args ((not _let_8))) :args _let_12)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_15 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_17)) :args _let_16)) _let_15 :args (_let_8 false _let_14)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_15 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_17)) :args _let_16)) _let_15 :args (_let_7 false _let_14)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_11) :args _let_10)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args _let_13) :args _let_12)) _let_11 :args (_let_9 true _let_1)) :args (false false _let_8 false _let_7 true _let_6)) :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_pq tptp.create_pq)) (forall ((U $$unsorted) (V $$unsorted)) (tptp.isnonempty_pq (tptp.insert_pq U V))) (forall ((U $$unsorted)) (not (tptp.contains_pq tptp.create_pq U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (= (tptp.contains_pq (tptp.insert_pq U V) W) (or (tptp.contains_pq U W) (= V W)))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.issmallestelement_pq U V) (forall ((W $$unsorted)) (=> (tptp.contains_pq U W) (tptp.less_than V W))))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.remove_pq (tptp.insert_pq U V) V) U)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (=> (and (tptp.contains_pq U W) (not (= V W))) (= (tptp.remove_pq (tptp.insert_pq U V) W) (tptp.insert_pq (tptp.remove_pq U W) V)))) (forall ((U $$unsorted) (V $$unsorted)) (=> (and (tptp.contains_pq U V) (tptp.issmallestelement_pq U V)) (= (tptp.findmin_pq_eff U V) U))) (forall ((U $$unsorted) (V $$unsorted)) (=> (and (tptp.contains_pq U V) (tptp.issmallestelement_pq U V)) (= (tptp.findmin_pq_res U V) V))) (forall ((U $$unsorted) (V $$unsorted)) (=> (and (tptp.contains_pq U V) (tptp.issmallestelement_pq U V)) (= (tptp.removemin_pq_eff U V) (tptp.remove_pq U V)))) (forall ((U $$unsorted) (V $$unsorted)) (=> (and (tptp.contains_pq U V) (tptp.issmallestelement_pq U V)) (= (tptp.removemin_pq_res U V) V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (= (tptp.insert_pq (tptp.insert_pq U V) W) (tptp.insert_pq (tptp.insert_pq U W) V))) (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)))) (forall ((U $$unsorted) (V $$unsorted)) (not (tptp.pair_in_list tptp.create_slb U V))) (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)))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.check_cpq (tptp.triple U tptp.create_slb V))) (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_3 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.i (tptp.triple U (tptp.insert_slb V (tptp.pair X Y)) W)) (tptp.insert_pq (tptp.i (tptp.triple U V W)) X))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.pi_sharp_remove U V) (tptp.contains_pq U V))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.pi_remove U V) (tptp.pi_sharp_remove (tptp.i U) V))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.pi_sharp_find_min U V) (and (tptp.contains_pq U V) (tptp.issmallestelement_pq U V)))) (forall ((U $$unsorted)) (= (tptp.pi_find_min U) (exists ((V $$unsorted)) (tptp.pi_sharp_find_min (tptp.i U) V)))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.pi_sharp_removemin U V) (and (tptp.contains_pq U V) (tptp.issmallestelement_pq U V)))) (forall ((U $$unsorted)) (= (tptp.pi_removemin U) (exists ((V $$unsorted)) (tptp.pi_sharp_find_min (tptp.i U) V)))) (forall ((U $$unsorted)) (= (tptp.phi U) (exists ((V $$unsorted)) (and (tptp.succ_cpq U V) (tptp.ok V) (tptp.check_cpq V))))) _let_2 true))))))))))))))))))))))))
% 0.21/0.56  )
% 0.21/0.56  % SZS output end Proof for SWV365+1
% 0.21/0.56  % cvc5---1.0.5 exiting
% 0.21/0.56  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------