0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : do_CVC4 %s %d 0.13/0.34 % Computer : n027.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.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Thu Jul 2 06:52:46 EDT 2020 0.13/0.34 % CPUTime : 0.20/0.47 %----Proving TF0_NAR, FOF, or CNF 0.20/0.48 ------- cvc4-fof casc j10 : /export/starexec/sandbox2/benchmark/theBenchmark.p at 960... 0.20/0.48 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-quant-cf --full-saturate-quant at 20... 0.20/0.51 % SZS status Theorem for theBenchmark 0.20/0.51 % SZS output start Proof for theBenchmark 0.20/0.51 (skolem (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_0 (triple U V W))) (or (ok _let_0) (not (ok (insert_cpq _let_0 X))))) ) 0.20/0.51 ( skv_1 skv_2 skv_3 skv_4 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted)) (= (and (not (less_than V U)) (less_than U V)) (strictly_less_than U V)) ) 0.20/0.51 ( (findmin_pqp_res skv_1), (lookup_slb skv_2 (findmin_pqp_res skv_1)) ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (isnonempty_slb (insert_slb U (pair V W))) ) 0.20/0.51 ( skv_2, skv_4, bottom ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted)) (check_cpq (triple U create_slb V)) ) 0.20/0.51 ( skv_1, skv_3 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted)) (= bottom (findmin_cpq_res (triple U create_slb V))) ) 0.20/0.51 ( skv_1, skv_3 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (= W (lookup_slb (insert_slb U (pair V W)) V)) ) 0.20/0.51 ( skv_2, skv_4, bottom ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted)) (= create_slb (update_slb create_slb U)) ) 0.20/0.51 ( (findmin_pqp_res skv_1) ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (= U (remove_slb (insert_slb U (pair V W)) V)) ) 0.20/0.51 ( skv_2, skv_4, bottom ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted)) (= (removemin_cpq_res U) (findmin_cpq_res U)) ) 0.20/0.51 ( (triple skv_1 skv_2 skv_3) ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_0 (findmin_pqp_res U))) (or (not (contains_slb V _let_0)) (not (less_than (lookup_slb V _let_0) _let_0)) (= create_slb V) (= (triple U (update_slb V _let_0) W) (findmin_cpq_eff (triple U V W))))) ) 0.20/0.51 ( skv_1, skv_2, bad ) 0.20/0.51 ( skv_1, skv_2, skv_3 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted)) (not (ok (triple U V bad))) ) 0.20/0.51 ( skv_1, skv_2 ) 0.20/0.51 ( skv_1, (update_slb skv_2 (findmin_pqp_res skv_1)) ) 0.20/0.51 ( (insert_pqp skv_1 skv_4), (insert_slb skv_2 (pair skv_4 bottom)) ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (less_than Y X)) (= (check_cpq (triple U (insert_slb V (pair X Y)) W)) (check_cpq (triple U V W)))) ) 0.20/0.51 ( (insert_pqp skv_1 skv_4), skv_2, skv_3, skv_4, bottom ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (ok (triple U V W)) (= bad W)) ) 0.20/0.51 ( skv_1, skv_2, skv_3 ) 0.20/0.51 ( skv_1, (update_slb skv_2 (findmin_pqp_res skv_1)), bad ) 0.20/0.51 ( (insert_pqp skv_1 skv_4), (insert_slb skv_2 (pair skv_4 bottom)), skv_3 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (= (insert_cpq (triple U V W) X) (triple (insert_pqp U X) (insert_slb V (pair X bottom)) W)) ) 0.20/0.51 ( skv_1, skv_2, skv_3, skv_4 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted)) (let ((_let_0 (findmin_pqp_res U))) (or (= create_slb V) (not (strictly_less_than _let_0 (lookup_slb V _let_0))) (not (contains_slb V _let_0)) (= (triple U (update_slb V _let_0) bad) (findmin_cpq_eff (triple U V W))))) ) 0.20/0.51 ( skv_2, skv_1, skv_3 ) 0.20/0.51 ( (insert_slb skv_2 (pair skv_4 bottom)), (insert_pqp skv_1 skv_4), skv_3 ) 0.20/0.51 ( (update_slb skv_2 (findmin_pqp_res skv_1)), skv_1, bad ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted)) (= (findmin_cpq_eff (triple U create_slb V)) (triple U create_slb bad)) ) 0.20/0.51 ( skv_1, skv_3 ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (strictly_less_than X Y)) (not (check_cpq (triple U (insert_slb V (pair X Y)) W)))) ) 0.20/0.51 ( (insert_pqp skv_1 skv_4), skv_2, skv_3, skv_4, bottom ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted)) (= (remove_cpq (findmin_cpq_eff U) (findmin_cpq_res U)) (removemin_cpq_eff U)) ) 0.20/0.51 ( (triple skv_1 skv_2 skv_3) ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted)) (or (= create_slb V) (= (findmin_pqp_res U) (findmin_cpq_res (triple U V W)))) ) 0.20/0.51 ( skv_2, skv_1, skv_3 ) 0.20/0.51 ( (insert_slb skv_2 (pair skv_4 bottom)), (insert_pqp skv_1 skv_4), skv_3 ) 0.20/0.51 ( (update_slb skv_2 (findmin_pqp_res skv_1)), skv_1, bad ) 0.20/0.51 ) 0.20/0.51 (instantiation (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_0 (findmin_pqp_res U))) (or (contains_slb V _let_0) (= create_slb V) (= (triple U (update_slb V _let_0) bad) (findmin_cpq_eff (triple U V W))))) ) 0.20/0.51 ( skv_1, skv_2, skv_3 ) 0.20/0.51 ( skv_1, (update_slb skv_2 (findmin_pqp_res skv_1)), bad ) 0.20/0.51 ( (insert_pqp skv_1 skv_4), (insert_slb skv_2 (pair skv_4 bottom)), skv_3 ) 0.20/0.51 ) 0.20/0.51 % SZS output end Proof for theBenchmark 0.20/0.51 EOF