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

% Computer : n025.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:56 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    : SWV384+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n025.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 03:31:40 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.slYgys63TR/cvc5---1.0.5_19708.p...
% 0.21/0.55  ------- get file name : TPTP file name is SWV384+1
% 0.21/0.55  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_19708.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 SWV384+1
% 0.21/0.55  % SZS output start Proof for SWV384+1
% 0.21/0.55  (
% 0.21/0.55  (let ((_let_1 (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (=> (or (not (tptp.check_cpq _let_1)) (not (tptp.ok _let_1))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.triple X Y Z))) (=> (tptp.succ_cpq (tptp.triple U V W) _let_1) (or (not (tptp.ok _let_1)) (not (tptp.check_cpq _let_1)))))))))))) (let ((_let_2 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (let ((_let_2 (tptp.im_succ_cpq _let_1))) (=> (or (not (tptp.check_cpq _let_1)) (not (tptp.ok _let_1))) (or (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2))))))))) (let ((_let_3 (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.triple X Y Z))) (let ((_let_2 (tptp.im_succ_cpq _let_1))) (=> (tptp.succ_cpq (tptp.triple U V W) _let_1) (=> (or (not (tptp.check_cpq _let_1)) (not (tptp.ok _let_1))) (or (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2)))))))) (forall ((X1 $$unsorted) (X2 $$unsorted) (X3 $$unsorted)) (let ((_let_1 (tptp.triple X1 X2 X3))) (=> (or (not (tptp.check_cpq _let_1)) (not (tptp.ok _let_1))) (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (let ((_let_1 (tptp.triple X4 X5 X6))) (=> (tptp.succ_cpq (tptp.triple X1 X2 X3) _let_1) (or (not (tptp.ok _let_1)) (not (tptp.check_cpq _let_1)))))))))))) (let ((_let_4 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (let ((_let_2 (tptp.im_succ_cpq _let_1))) (or (and (tptp.check_cpq _let_1) (tptp.ok _let_1)) (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2)))))))) (let ((_let_5 (tptp.triple SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_11 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_12 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_13))) (let ((_let_6 (tptp.im_succ_cpq _let_5))) (let ((_let_7 (tptp.ok _let_6))) (let ((_let_8 (not _let_7))) (let ((_let_9 (tptp.check_cpq _let_6))) (let ((_let_10 (not _let_9))) (let ((_let_11 (and (tptp.check_cpq _let_5) (tptp.ok _let_5)))) (let ((_let_12 (or _let_11 _let_10 _let_8))) (let ((_let_13 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_14 (not _let_12))) (let ((_let_15 (or (not (tptp.succ_cpq (tptp.triple SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_10) _let_5)) _let_11 _let_10 _let_8))) (let ((_let_16 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.triple X Y Z))) (let ((_let_2 (tptp.im_succ_cpq _let_1))) (or (not (tptp.succ_cpq (tptp.triple U V W) _let_1)) (and (tptp.check_cpq _let_1) (tptp.ok _let_1)) (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2)))))))) (let ((_let_17 (not _let_15))) (let ((_let_18 (forall ((X1 $$unsorted) (X2 $$unsorted) (X3 $$unsorted) (BOUND_VARIABLE_1290 $$unsorted) (BOUND_VARIABLE_1288 $$unsorted) (BOUND_VARIABLE_1286 $$unsorted)) (let ((_let_1 (tptp.triple BOUND_VARIABLE_1286 BOUND_VARIABLE_1288 BOUND_VARIABLE_1290))) (let ((_let_2 (tptp.triple X1 X2 X3))) (or (and (tptp.check_cpq _let_2) (tptp.ok _let_2)) (not (tptp.succ_cpq _let_2 _let_1)) (not (tptp.ok _let_1)) (not (tptp.check_cpq _let_1)))))))) (let ((_let_19 (not _let_16))) (let ((_let_20 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (BOUND_VARIABLE_1325 $$unsorted) (BOUND_VARIABLE_1323 $$unsorted) (BOUND_VARIABLE_1321 $$unsorted)) (let ((_let_1 (tptp.triple BOUND_VARIABLE_1321 BOUND_VARIABLE_1323 BOUND_VARIABLE_1325))) (let ((_let_2 (tptp.triple U V W))) (or (and (tptp.check_cpq _let_2) (tptp.ok _let_2)) (not (tptp.succ_cpq _let_2 _let_1)) (not (tptp.ok _let_1)) (not (tptp.check_cpq _let_1)))))))) (let ((_let_21 (not _let_18))) (let ((_let_22 (or))) (let ((_let_23 (_let_19))) (let ((_let_24 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_23)) :args _let_23)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_16))) (REFL :args (_let_17)) :args _let_22)) (MACRO_RESOLUTION_TRUST (REORDERING (IMPLIES_ELIM (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT)))) :args ((or _let_18 _let_19))) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_18 (= X1 U) (= X2 V) (= X3 W) (= BOUND_VARIABLE_1286 BOUND_VARIABLE_1321) (= BOUND_VARIABLE_1288 BOUND_VARIABLE_1323) (= BOUND_VARIABLE_1290 BOUND_VARIABLE_1325)))) :args ((or _let_20 _let_21))) (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (_let_21 true _let_20)) :args (_let_19 true _let_18)) :args (_let_17 true _let_16)))) (let ((_let_25 (REFL :args (_let_15)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_13 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_11 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_12 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_13 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.triple U V W)))) :args (_let_4))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_12)) :args ((or _let_11 _let_10 _let_8 _let_14))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_15 1)) _let_24 :args ((not _let_11) true _let_15)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 2)) (CONG _let_25 (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_9))) :args _let_22)) :args ((or _let_9 _let_15))) _let_24 :args (_let_9 true _let_15)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 3)) (CONG _let_25 (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_7))) :args _let_22)) :args ((or _let_7 _let_15))) _let_24 :args (_let_7 true _let_15)) :args (_let_14 true _let_11 false _let_9 false _let_7)) _let_13 :args (false true _let_12 false _let_4)) :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)))) (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 _let_2 _let_1 true))))))))))))))))))))))))))))
% 0.21/0.56  )
% 0.21/0.56  % SZS output end Proof for SWV384+1
% 0.21/0.56  % cvc5---1.0.5 exiting
% 0.21/0.56  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------