TSTP Solution File: ARI594_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI594_1 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n021.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 : Wed May 29 16:34:12 EDT 2024
% Result : Theorem 30.38s 30.61s
% Output : Proof 30.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ARI594_1 : TPTP v8.2.0. Released v5.1.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 27 05:13:54 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 %----Proving TF0_ARI
% 30.38/30.61 --- Run --finite-model-find --decision=internal at 15...
% 30.38/30.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 30.38/30.61 --- Run --no-e-matching --full-saturate-quant at 15...
% 30.38/30.61 --- Run --cegqi-all --purify-triggers --full-saturate-quant at 15...
% 30.38/30.61 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.q9dvBTJgv8/cvc5---1.0.5_24515.smt2
% 30.38/30.61 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.q9dvBTJgv8/cvc5---1.0.5_24515.smt2
% 30.38/30.61 (assume a0 (not (=> (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (exists ((X Int)) (tptp.p (* 3 X))))))
% 30.38/30.61 (assume a1 true)
% 30.38/30.61 (step t1 (cl (not (= (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (tptp.p 6)))) (not (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)))) (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (tptp.p 6))) :rule equiv_pos2)
% 30.38/30.61 (step t2 (cl (= (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))))) :rule refl)
% 30.38/30.61 (step t3 (cl (= (>= 6 5) true)) :rule all_simplify)
% 30.38/30.61 (step t4 (cl (= (not (>= 6 5)) (not true))) :rule cong :premises (t3))
% 30.38/30.61 (step t5 (cl (= (not true) false)) :rule all_simplify)
% 30.38/30.61 (step t6 (cl (= (not (>= 6 5)) false)) :rule trans :premises (t4 t5))
% 30.38/30.61 (step t7 (cl (= (>= 6 8) false)) :rule all_simplify)
% 30.38/30.61 (step t8 (cl (= (tptp.p 6) (tptp.p 6))) :rule refl)
% 30.38/30.61 (step t9 (cl (= (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)) (or false false (tptp.p 6)))) :rule cong :premises (t6 t7 t8))
% 30.38/30.61 (step t10 (cl (= (or false false (tptp.p 6)) (tptp.p 6))) :rule all_simplify)
% 30.38/30.61 (step t11 (cl (= (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)) (tptp.p 6))) :rule trans :premises (t9 t10))
% 30.38/30.61 (step t12 (cl (= (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (tptp.p 6)))) :rule cong :premises (t2 t11))
% 30.38/30.61 (step t13 (cl (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z)))) :rule implies_neg1)
% 30.38/30.61 (anchor :step t14)
% 30.38/30.61 (assume t14.a0 (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))))
% 30.38/30.61 (step t14.t1 (cl (or (not (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z)))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)))) :rule forall_inst :args ((:= Z 6)))
% 30.38/30.61 (step t14.t2 (cl (not (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z)))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) :rule or :premises (t14.t1))
% 30.38/30.61 (step t14.t3 (cl (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) :rule resolution :premises (t14.t2 t14.a0))
% 30.38/30.61 (step t14 (cl (not (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z)))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) :rule subproof :discharge (t14.a0))
% 30.38/30.61 (step t15 (cl (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) :rule resolution :premises (t13 t14))
% 30.38/30.61 (step t16 (cl (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) (not (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)))) :rule implies_neg2)
% 30.38/30.61 (step t17 (cl (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6))) (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)))) :rule resolution :premises (t15 t16))
% 30.38/30.61 (step t18 (cl (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (or (not (>= 6 5)) (>= 6 8) (tptp.p 6)))) :rule contraction :premises (t17))
% 30.38/30.61 (step t19 (cl (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (tptp.p 6))) :rule resolution :premises (t1 t12 t18))
% 30.38/30.61 (step t20 (cl (not (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z)))) (tptp.p 6)) :rule implies :premises (t19))
% 30.38/30.61 (step t21 (cl (not (= (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2)))) (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p 6))))) (not (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2))))) (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p 6)))) :rule equiv_pos2)
% 30.38/30.61 (step t22 (cl (= (forall ((X Int)) (not (tptp.p (* 3 X)))) (forall ((X Int)) (not (tptp.p (* 3 X)))))) :rule refl)
% 30.38/30.61 (step t23 (cl (= (* 3 2) 6)) :rule all_simplify)
% 30.38/30.61 (step t24 (cl (= (tptp.p (* 3 2)) (tptp.p 6))) :rule cong :premises (t23))
% 30.38/30.61 (step t25 (cl (= (not (tptp.p (* 3 2))) (not (tptp.p 6)))) :rule cong :premises (t24))
% 30.38/30.61 (step t26 (cl (= (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2)))) (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p 6))))) :rule cong :premises (t22 t25))
% 30.38/30.61 (step t27 (cl (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2)))) (forall ((X Int)) (not (tptp.p (* 3 X))))) :rule implies_neg1)
% 30.38/30.61 (anchor :step t28)
% 30.38/30.61 (assume t28.a0 (forall ((X Int)) (not (tptp.p (* 3 X)))))
% 30.38/30.61 (step t28.t1 (cl (or (not (forall ((X Int)) (not (tptp.p (* 3 X))))) (not (tptp.p (* 3 2))))) :rule forall_inst :args ((:= X 2)))
% 30.38/30.61 (step t28.t2 (cl (not (forall ((X Int)) (not (tptp.p (* 3 X))))) (not (tptp.p (* 3 2)))) :rule or :premises (t28.t1))
% 30.38/30.61 (step t28.t3 (cl (not (tptp.p (* 3 2)))) :rule resolution :premises (t28.t2 t28.a0))
% 30.38/30.61 (step t28 (cl (not (forall ((X Int)) (not (tptp.p (* 3 X))))) (not (tptp.p (* 3 2)))) :rule subproof :discharge (t28.a0))
% 30.38/30.61 (step t29 (cl (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2)))) (not (tptp.p (* 3 2)))) :rule resolution :premises (t27 t28))
% 30.38/30.61 (step t30 (cl (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2)))) (not (not (tptp.p (* 3 2))))) :rule implies_neg2)
% 30.38/30.61 (step t31 (cl (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2)))) (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2))))) :rule resolution :premises (t29 t30))
% 30.38/30.61 (step t32 (cl (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p (* 3 2))))) :rule contraction :premises (t31))
% 30.38/30.61 (step t33 (cl (=> (forall ((X Int)) (not (tptp.p (* 3 X)))) (not (tptp.p 6)))) :rule resolution :premises (t21 t26 t32))
% 30.38/30.61 (step t34 (cl (not (forall ((X Int)) (not (tptp.p (* 3 X))))) (not (tptp.p 6))) :rule implies :premises (t33))
% 30.38/30.61 (step t35 (cl (not (not (not (forall ((X Int)) (not (tptp.p (* 3 X))))))) (forall ((X Int)) (not (tptp.p (* 3 X))))) :rule not_not)
% 30.38/30.61 (step t36 (cl (not (= (not (=> (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (exists ((X Int)) (tptp.p (* 3 X))))) (not (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (not (forall ((X Int)) (not (tptp.p (* 3 X))))))))) (not (not (=> (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (exists ((X Int)) (tptp.p (* 3 X)))))) (not (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (not (forall ((X Int)) (not (tptp.p (* 3 X)))))))) :rule equiv_pos2)
% 30.38/30.61 (anchor :step t37 :args ((Z Int) (:= Z Z)))
% 30.38/30.61 (step t37.t1 (cl (= Z Z)) :rule refl)
% 30.38/30.61 (step t37.t2 (cl (= (<= 5 Z) (>= Z 5))) :rule all_simplify)
% 30.38/30.61 (step t37.t3 (cl (= (<= Z 7) (not (>= Z 8)))) :rule all_simplify)
% 30.38/30.61 (step t37.t4 (cl (= (and (<= 5 Z) (<= Z 7)) (and (>= Z 5) (not (>= Z 8))))) :rule cong :premises (t37.t2 t37.t3))
% 30.38/30.61 (step t37.t5 (cl (= (tptp.p Z) (tptp.p Z))) :rule refl)
% 30.38/30.61 (step t37.t6 (cl (= (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z)) (=> (and (>= Z 5) (not (>= Z 8))) (tptp.p Z)))) :rule cong :premises (t37.t4 t37.t5))
% 30.38/30.61 (step t37 (cl (= (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (forall ((Z Int)) (=> (and (>= Z 5) (not (>= Z 8))) (tptp.p Z))))) :rule bind)
% 30.38/30.61 (step t38 (cl (= (forall ((Z Int)) (=> (and (>= Z 5) (not (>= Z 8))) (tptp.p Z))) (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))))) :rule all_simplify)
% 30.38/30.61 (step t39 (cl (= (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))))) :rule trans :premises (t37 t38))
% 30.38/30.61 (step t40 (cl (= (exists ((X Int)) (tptp.p (* 3 X))) (not (forall ((X Int)) (not (tptp.p (* 3 X))))))) :rule all_simplify)
% 30.38/30.61 (step t41 (cl (= (=> (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (exists ((X Int)) (tptp.p (* 3 X)))) (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (not (forall ((X Int)) (not (tptp.p (* 3 X)))))))) :rule cong :premises (t39 t40))
% 30.38/30.61 (step t42 (cl (= (not (=> (forall ((Z Int)) (=> (and (<= 5 Z) (<= Z 7)) (tptp.p Z))) (exists ((X Int)) (tptp.p (* 3 X))))) (not (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (not (forall ((X Int)) (not (tptp.p (* 3 X))))))))) :rule cong :premises (t41))
% 30.38/30.61 (step t43 (cl (not (=> (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z))) (not (forall ((X Int)) (not (tptp.p (* 3 X)))))))) :rule resolution :premises (t36 t42 a0))
% 30.38/30.61 (step t44 (cl (not (not (forall ((X Int)) (not (tptp.p (* 3 X))))))) :rule not_implies2 :premises (t43))
% 30.38/30.61 (step t45 (cl (forall ((X Int)) (not (tptp.p (* 3 X))))) :rule resolution :premises (t35 t44))
% 30.38/30.61 (step t46 (cl (not (tptp.p 6))) :rule resolution :premises (t34 t45))
% 30.38/30.61 (step t47 (cl (forall ((Z Int)) (or (not (>= Z 5)) (>= Z 8) (tptp.p Z)))) :rule not_implies1 :premises (t43))
% 30.38/30.61 (step t48 (cl) :rule resolution :premises (t20 t46 t47))
% 30.38/30.61
% 30.38/30.61 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.q9dvBTJgv8/cvc5---1.0.5_24515.smt2
% 30.38/30.61 % cvc5---1.0.5 exiting
% 30.38/30.61 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------