TSTP Solution File: ARI185_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI185_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n006.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:33:20 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : ARI185_1 : TPTP v8.2.0. Released v5.0.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 27 05:37:24 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.19/0.49 %----Proving TF0_ARI
% 0.19/0.51 --- Run --finite-model-find --decision=internal at 15...
% 0.19/0.51 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.IaiIZvWIre/cvc5---1.0.5_19654.smt2
% 0.19/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.IaiIZvWIre/cvc5---1.0.5_19654.smt2
% 0.19/0.51 (assume a0 (not (=> (forall ((U Int)) (> (tptp.f U) 1)) (< (- 7 (* 2 (tptp.f 3))) 4))))
% 0.19/0.51 (assume a1 true)
% 0.19/0.51 (step t1 (cl (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)) (forall ((U Int)) (>= (tptp.f U) 2))) :rule implies_neg1)
% 0.19/0.51 (anchor :step t2)
% 0.19/0.51 (assume t2.a0 (forall ((U Int)) (>= (tptp.f U) 2)))
% 0.19/0.51 (step t2.t1 (cl (or (not (forall ((U Int)) (>= (tptp.f U) 2))) (>= (tptp.f 3) 2))) :rule forall_inst :args ((:= U 3)))
% 0.19/0.51 (step t2.t2 (cl (not (forall ((U Int)) (>= (tptp.f U) 2))) (>= (tptp.f 3) 2)) :rule or :premises (t2.t1))
% 0.19/0.51 (step t2.t3 (cl (>= (tptp.f 3) 2)) :rule resolution :premises (t2.t2 t2.a0))
% 0.19/0.51 (step t2 (cl (not (forall ((U Int)) (>= (tptp.f U) 2))) (>= (tptp.f 3) 2)) :rule subproof :discharge (t2.a0))
% 0.19/0.51 (step t3 (cl (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)) (>= (tptp.f 3) 2)) :rule resolution :premises (t1 t2))
% 0.19/0.51 (step t4 (cl (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)) (not (>= (tptp.f 3) 2))) :rule implies_neg2)
% 0.19/0.51 (step t5 (cl (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)) (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2))) :rule resolution :premises (t3 t4))
% 0.19/0.51 (step t6 (cl (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2))) :rule contraction :premises (t5))
% 0.19/0.51 (step t7 (cl (not (forall ((U Int)) (>= (tptp.f U) 2))) (>= (tptp.f 3) 2)) :rule implies :premises (t6))
% 0.19/0.51 (step t8 (cl (>= (tptp.f 3) 2) (not (forall ((U Int)) (>= (tptp.f U) 2)))) :rule reordering :premises (t7))
% 0.19/0.51 (step t9 (cl (not (= (not (=> (forall ((U Int)) (> (tptp.f U) 1)) (< (- 7 (* 2 (tptp.f 3))) 4))) (not (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2))))) (not (not (=> (forall ((U Int)) (> (tptp.f U) 1)) (< (- 7 (* 2 (tptp.f 3))) 4)))) (not (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)))) :rule equiv_pos2)
% 0.19/0.51 (anchor :step t10 :args ((U Int) (:= U U)))
% 0.19/0.51 (step t10.t1 (cl (= U U)) :rule refl)
% 0.19/0.51 (step t10.t2 (cl (= (> (tptp.f U) 1) (not (<= (tptp.f U) 1)))) :rule all_simplify)
% 0.19/0.51 (step t10.t3 (cl (= (<= (tptp.f U) 1) (not (>= (tptp.f U) 2)))) :rule all_simplify)
% 0.19/0.51 (step t10.t4 (cl (= (not (<= (tptp.f U) 1)) (not (not (>= (tptp.f U) 2))))) :rule cong :premises (t10.t3))
% 0.19/0.51 (step t10.t5 (cl (= (not (not (>= (tptp.f U) 2))) (>= (tptp.f U) 2))) :rule all_simplify)
% 0.19/0.51 (step t10.t6 (cl (= (not (<= (tptp.f U) 1)) (>= (tptp.f U) 2))) :rule trans :premises (t10.t4 t10.t5))
% 0.19/0.51 (step t10.t7 (cl (= (> (tptp.f U) 1) (>= (tptp.f U) 2))) :rule trans :premises (t10.t2 t10.t6))
% 0.19/0.51 (step t10 (cl (= (forall ((U Int)) (> (tptp.f U) 1)) (forall ((U Int)) (>= (tptp.f U) 2)))) :rule bind)
% 0.19/0.51 (step t11 (cl (= (< (- 7 (* 2 (tptp.f 3))) 4) (not (>= (- 7 (* 2 (tptp.f 3))) 4)))) :rule all_simplify)
% 0.19/0.51 (step t12 (cl (= (- 7 (* 2 (tptp.f 3))) (+ 7 (* (- 1) (* 2 (tptp.f 3)))))) :rule all_simplify)
% 0.19/0.51 (step t13 (cl (= 7 7)) :rule refl)
% 0.19/0.51 (step t14 (cl (= (* (- 1) (* 2 (tptp.f 3))) (* (- 2) (tptp.f 3)))) :rule all_simplify)
% 0.19/0.51 (step t15 (cl (= (+ 7 (* (- 1) (* 2 (tptp.f 3)))) (+ 7 (* (- 2) (tptp.f 3))))) :rule cong :premises (t13 t14))
% 0.19/0.51 (step t16 (cl (= (- 7 (* 2 (tptp.f 3))) (+ 7 (* (- 2) (tptp.f 3))))) :rule trans :premises (t12 t15))
% 0.19/0.51 (step t17 (cl (= 4 4)) :rule refl)
% 0.19/0.51 (step t18 (cl (= (>= (- 7 (* 2 (tptp.f 3))) 4) (>= (+ 7 (* (- 2) (tptp.f 3))) 4))) :rule cong :premises (t16 t17))
% 0.19/0.51 (step t19 (cl (= (>= (+ 7 (* (- 2) (tptp.f 3))) 4) (not (>= (tptp.f 3) 2)))) :rule all_simplify)
% 0.19/0.51 (step t20 (cl (= (>= (- 7 (* 2 (tptp.f 3))) 4) (not (>= (tptp.f 3) 2)))) :rule trans :premises (t18 t19))
% 0.19/0.51 (step t21 (cl (= (not (>= (- 7 (* 2 (tptp.f 3))) 4)) (not (not (>= (tptp.f 3) 2))))) :rule cong :premises (t20))
% 0.19/0.51 (step t22 (cl (= (not (not (>= (tptp.f 3) 2))) (>= (tptp.f 3) 2))) :rule all_simplify)
% 0.19/0.51 (step t23 (cl (= (not (>= (- 7 (* 2 (tptp.f 3))) 4)) (>= (tptp.f 3) 2))) :rule trans :premises (t21 t22))
% 0.19/0.51 (step t24 (cl (= (< (- 7 (* 2 (tptp.f 3))) 4) (>= (tptp.f 3) 2))) :rule trans :premises (t11 t23))
% 0.19/0.51 (step t25 (cl (= (=> (forall ((U Int)) (> (tptp.f U) 1)) (< (- 7 (* 2 (tptp.f 3))) 4)) (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)))) :rule cong :premises (t10 t24))
% 0.19/0.52 (step t26 (cl (= (not (=> (forall ((U Int)) (> (tptp.f U) 1)) (< (- 7 (* 2 (tptp.f 3))) 4))) (not (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2))))) :rule cong :premises (t25))
% 0.19/0.52 (step t27 (cl (not (=> (forall ((U Int)) (>= (tptp.f U) 2)) (>= (tptp.f 3) 2)))) :rule resolution :premises (t9 t26 a0))
% 0.19/0.52 (step t28 (cl (not (>= (tptp.f 3) 2))) :rule not_implies2 :premises (t27))
% 0.19/0.52 (step t29 (cl (forall ((U Int)) (>= (tptp.f U) 2))) :rule not_implies1 :premises (t27))
% 0.19/0.52 (step t30 (cl) :rule resolution :premises (t8 t28 t29))
% 0.19/0.52
% 0.19/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.IaiIZvWIre/cvc5---1.0.5_19654.smt2
% 0.19/0.52 % cvc5---1.0.5 exiting
% 0.19/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------