TSTP Solution File: SWV387+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV387+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n013.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:57 EDT 2023
% Result : Theorem 0.18s 0.52s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SWV387+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.15 % Command : do_cvc5 %s %d
% 0.12/0.36 % Computer : n013.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Tue Aug 29 03:01:32 EDT 2023
% 0.12/0.36 % CPUTime :
% 0.18/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.18/0.52 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.6CZEvJwrQJ/cvc5---1.0.5_13555.p...
% 0.18/0.52 ------- get file name : TPTP file name is SWV387+1
% 0.18/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_13555.smt2...
% 0.18/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.18/0.52 % SZS status Theorem for SWV387+1
% 0.18/0.52 % SZS output start Proof for SWV387+1
% 0.18/0.52 (
% 0.18/0.52 (let ((_let_1 (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (=> (not (tptp.check_cpq (tptp.triple U V W))) (forall ((X $$unsorted)) (let ((_let_1 (tptp.remove_cpq (tptp.triple U V W) X))) (or (not (tptp.check_cpq _let_1)) (not (tptp.ok _let_1)))))))))) (let ((_let_2 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (let ((_let_2 (tptp.remove_cpq _let_1 X))) (=> (and (tptp.check_cpq _let_2) (tptp.ok _let_2)) (tptp.check_cpq _let_1))))))) (let ((_let_3 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (BOUND_VARIABLE_1217 $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (let ((_let_2 (tptp.remove_cpq _let_1 BOUND_VARIABLE_1217))) (or (tptp.check_cpq _let_1) (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2)))))))) (let ((_let_4 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (let ((_let_2 (tptp.remove_cpq _let_1 X))) (or (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2)) (tptp.check_cpq _let_1))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (TRANS (ALPHA_EQUIV :args (_let_4 (= U U) (= V V) (= W W) (= X BOUND_VARIABLE_1217))) (MACRO_SR_PRED_INTRO :args ((= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (BOUND_VARIABLE_1217 $$unsorted)) (let ((_let_1 (tptp.triple U V W))) (let ((_let_2 (tptp.remove_cpq _let_1 BOUND_VARIABLE_1217))) (or (not (tptp.check_cpq _let_2)) (not (tptp.ok _let_2)) (tptp.check_cpq _let_1))))) _let_3) SB_DEFAULT SBA_SEQUENTIAL RW_EXT_REWRITE)))) :args ((or _let_3 (not _let_4)))) (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args (_let_3 false _let_4)) :args (false false _let_3)) :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_2 _let_1 true)))))))
% 0.18/0.53 )
% 0.18/0.53 % SZS output end Proof for SWV387+1
% 0.18/0.53 % cvc5---1.0.5 exiting
% 0.18/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------