TSTP Solution File: SWW592_2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWW592_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n023.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 18:20:14 EDT 2024
% Result : Theorem 0.38s 0.56s
% Output : Proof 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW592_2 : TPTP v8.2.0. Released v6.1.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 26 04:49:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_ARI
% 0.38/0.56 --- Run --finite-model-find --decision=internal at 15...
% 0.38/0.56 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.HTkE5ughMF/cvc5---1.0.5_26273.smt2
% 0.38/0.56 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.HTkE5ughMF/cvc5---1.0.5_26273.smt2
% 0.38/0.56 (assume a0 (forall ((A tptp.ty)) (tptp.sort1 A (tptp.witness1 A))))
% 0.38/0.56 (assume a1 (forall ((A tptp.ty) (X tptp.bool1) (X1 tptp.uni) (X2 tptp.uni)) (tptp.sort1 A (tptp.match_bool1 A X X1 X2))))
% 0.38/0.56 (assume a2 (forall ((A tptp.ty) (Z tptp.uni) (Z1 tptp.uni)) (=> (tptp.sort1 A Z) (= (tptp.match_bool1 A tptp.true1 Z Z1) Z))))
% 0.38/0.56 (assume a3 (forall ((A tptp.ty) (Z tptp.uni) (Z1 tptp.uni)) (=> (tptp.sort1 A Z1) (= (tptp.match_bool1 A tptp.false1 Z Z1) Z1))))
% 0.38/0.56 (assume a4 (not (= tptp.true1 tptp.false1)))
% 0.38/0.56 (assume a5 (forall ((U tptp.bool1)) (or (= U tptp.true1) (= U tptp.false1))))
% 0.38/0.56 (assume a6 (forall ((U tptp.tuple02)) (= U tptp.tuple03)))
% 0.38/0.56 (assume a7 (forall ((X Int) (Y Int) (Z Int)) (=> (<= X Y) (=> (<= 0 Z) (<= (* X Z) (* Y Z))))))
% 0.38/0.56 (assume a8 (= (tptp.fib1 0) 0))
% 0.38/0.56 (assume a9 (= (tptp.fib1 1) 1))
% 0.38/0.56 (assume a10 (forall ((N Int)) (=> (<= 2 N) (= (tptp.fib1 N) (+ (tptp.fib1 (- N 1)) (tptp.fib1 (- N 2)))))))
% 0.38/0.56 (assume a11 (forall ((X Int)) (and (=> (<= 0 X) (= (tptp.abs1 X) X)) (=> (not (<= 0 X)) (= (tptp.abs1 X) (- X))))))
% 0.38/0.56 (assume a12 (forall ((X Int) (Y Int)) (= (<= (tptp.abs1 X) Y) (and (<= (- Y) X) (<= X Y)))))
% 0.38/0.56 (assume a13 (forall ((X Int)) (<= 0 (tptp.abs1 X))))
% 0.38/0.56 (assume a14 (forall ((X Int) (Y Int) (Z Int)) (=> (< 0 X) (= (ite (>= (to_real X) 0.0) (to_int (/ (to_real (+ (* X Y) Z)) (to_real X))) (- (to_int (- (/ (to_real (+ (* X Y) Z)) (to_real X)))))) (+ Y (ite (>= (to_real X) 0.0) (to_int (/ (to_real Z) (to_real X))) (- (to_int (- (/ (to_real Z) (to_real X)))))))))))
% 0.38/0.56 (assume a15 (forall ((X Int) (Y Int) (Z Int)) (=> (< 0 X) (= (to_int (- (to_real (+ (* X Y) Z)) (* (ite (>= (to_real X) 0.0) (to_int (/ (to_real (+ (* X Y) Z)) (to_real X))) (- (to_int (- (/ (to_real (+ (* X Y) Z)) (to_real X)))))) (to_real X)))) (to_int (- (to_real Z) (* (ite (>= (to_real X) 0.0) (to_int (/ (to_real Z) (to_real X))) (- (to_int (- (/ (to_real Z) (to_real X)))))) (to_real X))))))))
% 0.38/0.56 (assume a16 (forall ((U Int) (U1 Int) (U2 Int) (U3 Int)) (= (tptp.a111 (tptp.mk_t1 U U1 U2 U3)) U)))
% 0.38/0.56 (assume a17 (forall ((U Int) (U1 Int) (U2 Int) (U3 Int)) (= (tptp.a121 (tptp.mk_t1 U U1 U2 U3)) U1)))
% 0.38/0.56 (assume a18 (forall ((U Int) (U1 Int) (U2 Int) (U3 Int)) (= (tptp.a211 (tptp.mk_t1 U U1 U2 U3)) U2)))
% 0.38/0.56 (assume a19 (forall ((U Int) (U1 Int) (U2 Int) (U3 Int)) (= (tptp.a221 (tptp.mk_t1 U U1 U2 U3)) U3)))
% 0.38/0.56 (assume a20 (forall ((U tptp.t1)) (= U (tptp.mk_t1 (tptp.a111 U) (tptp.a121 U) (tptp.a211 U) (tptp.a221 U)))))
% 0.38/0.56 (assume a21 (forall ((X tptp.t1) (Y tptp.t1)) (= (tptp.mult1 X Y) (tptp.mk_t1 (+ (* (tptp.a111 X) (tptp.a111 Y)) (* (tptp.a121 X) (tptp.a211 Y))) (+ (* (tptp.a111 X) (tptp.a121 Y)) (* (tptp.a121 X) (tptp.a221 Y))) (+ (* (tptp.a211 X) (tptp.a111 Y)) (* (tptp.a221 X) (tptp.a211 Y))) (+ (* (tptp.a211 X) (tptp.a121 Y)) (* (tptp.a221 X) (tptp.a221 Y)))))))
% 0.38/0.56 (assume a22 (forall ((X tptp.t1) (Y tptp.t1) (Z tptp.t1)) (= (tptp.mult1 (tptp.mult1 X Y) Z) (tptp.mult1 X (tptp.mult1 Y Z)))))
% 0.38/0.56 (assume a23 (forall ((X tptp.t1)) (= (tptp.mult1 (tptp.mk_t1 1 0 0 1) X) X)))
% 0.38/0.56 (assume a24 (forall ((X tptp.t1)) (= (tptp.mult1 X (tptp.mk_t1 1 0 0 1)) X)))
% 0.38/0.56 (assume a25 (forall ((X tptp.t1) (Y tptp.t1)) (= (tptp.mult1 X Y) (tptp.mult1 Y X))))
% 0.38/0.56 (assume a26 (forall ((X tptp.t1)) (= (tptp.power1 X 0) (tptp.mk_t1 1 0 0 1))))
% 0.38/0.56 (assume a27 (forall ((X tptp.t1) (N Int)) (=> (<= 0 N) (= (tptp.power1 X (+ N 1)) (tptp.mult1 X (tptp.power1 X N))))))
% 0.38/0.56 (assume a28 (forall ((X tptp.t1) (N Int)) (=> (< 0 N) (= (tptp.power1 X N) (tptp.mult1 X (tptp.power1 X (- N 1)))))))
% 0.38/0.56 (assume a29 (forall ((X tptp.t1)) (= (tptp.power1 X 1) X)))
% 0.38/0.56 (assume a30 (forall ((X tptp.t1) (N Int) (M Int)) (=> (<= 0 N) (=> (<= 0 M) (= (tptp.power1 X (+ N M)) (tptp.mult1 (tptp.power1 X N) (tptp.power1 X M)))))))
% 0.38/0.56 (assume a31 (forall ((X tptp.t1) (N Int) (M Int)) (=> (<= 0 N) (=> (<= 0 M) (= (tptp.power1 X (* N M)) (tptp.power1 (tptp.power1 X N) M))))))
% 0.38/0.56 (assume a32 (forall ((X tptp.t1) (Y tptp.t1) (N Int)) (=> (<= 0 N) (= (tptp.power1 (tptp.mult1 X Y) N) (tptp.mult1 (tptp.power1 X N) (tptp.power1 Y N))))))
% 0.38/0.56 (assume a33 (not (forall ((N Int)) (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1)))))))
% 0.38/0.56 (assume a34 true)
% 0.38/0.56 (step t1 (cl (=> (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) :rule implies_neg1)
% 0.38/0.56 (anchor :step t2)
% 0.38/0.56 (assume t2.a0 (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))))
% 0.38/0.56 (step t2.t1 (cl (or (not (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule forall_inst :args ((:= X (tptp.mk_t1 1 1 1 0))))
% 0.38/0.56 (step t2.t2 (cl (not (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) :rule or :premises (t2.t1))
% 0.38/0.56 (step t2.t3 (cl (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) :rule resolution :premises (t2.t2 t2.a0))
% 0.38/0.56 (step t2 (cl (not (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) :rule subproof :discharge (t2.a0))
% 0.38/0.56 (step t3 (cl (=> (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) :rule resolution :premises (t1 t2))
% 0.38/0.56 (step t4 (cl (=> (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (not (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule implies_neg2)
% 0.38/0.56 (step t5 (cl (=> (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (=> (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule resolution :premises (t3 t4))
% 0.38/0.56 (step t6 (cl (=> (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule contraction :premises (t5))
% 0.38/0.56 (step t7 (cl (not (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) :rule implies :premises (t6))
% 0.38/0.56 (step t8 (cl (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)) (not (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))))) :rule reordering :premises (t7))
% 0.38/0.56 (step t9 (cl (not (= (not (forall ((N Int)) (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1)))))) (not (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))))) (not (not (forall ((N Int)) (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1))))))) (not (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule equiv_pos2)
% 0.38/0.56 (anchor :step t10 :args ((N Int) (:= N N)))
% 0.38/0.56 (step t10.t1 (cl (= N N)) :rule refl)
% 0.38/0.56 (step t10.t2 (cl (= (<= 0 N) (>= N 0))) :rule all_simplify)
% 0.38/0.56 (step t10.t3 (cl (= (= N 0) (= N 0))) :rule refl)
% 0.38/0.56 (step t10.t4 (cl (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.power1 (tptp.mk_t1 1 1 1 0) N))) :rule refl)
% 0.38/0.56 (step t10.t5 (cl (= (+ 1 0) 1)) :rule all_simplify)
% 0.38/0.56 (step t10.t6 (cl (= 0 0)) :rule refl)
% 0.38/0.56 (step t10.t7 (cl (= 1 1)) :rule refl)
% 0.38/0.56 (step t10.t8 (cl (= (tptp.mk_t1 (+ 1 0) 0 0 1) (tptp.mk_t1 1 0 0 1))) :rule cong :premises (t10.t5 t10.t6 t10.t6 t10.t7))
% 0.38/0.56 (step t10.t9 (cl (= (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1)) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 1 0 0 1)))) :rule cong :premises (t10.t4 t10.t8))
% 0.38/0.56 (step t10.t10 (cl (= (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 1 0 0 1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N)))) :rule all_simplify)
% 0.38/0.56 (step t10.t11 (cl (= (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N)))) :rule trans :premises (t10.t9 t10.t10))
% 0.38/0.56 (step t10.t12 (cl (= (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1))) (=> (= N 0) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N))))) :rule cong :premises (t10.t3 t10.t11))
% 0.38/0.56 (step t10.t13 (cl (= (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1)))) (=> (>= N 0) (=> (= N 0) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N)))))) :rule cong :premises (t10.t2 t10.t12))
% 0.38/0.56 (step t10 (cl (= (forall ((N Int)) (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1))))) (forall ((N Int)) (=> (>= N 0) (=> (= N 0) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N))))))) :rule bind)
% 0.38/0.56 (step t11 (cl (= (forall ((N Int)) (=> (>= N 0) (=> (= N 0) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N))))) (forall ((N Int)) (or (not (>= N 0)) (not (= N 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N)))))) :rule all_simplify)
% 0.38/0.56 (step t12 (cl (= (forall ((N Int)) (or (not (>= N 0)) (not (= N 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N)))) (or (not (>= 0 0)) (not (= 0 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))))) :rule all_simplify)
% 0.38/0.56 (step t13 (cl (= (>= 0 0) true)) :rule all_simplify)
% 0.38/0.56 (step t14 (cl (= (not (>= 0 0)) (not true))) :rule cong :premises (t13))
% 0.38/0.56 (step t15 (cl (= (not true) false)) :rule all_simplify)
% 0.38/0.56 (step t16 (cl (= (not (>= 0 0)) false)) :rule trans :premises (t14 t15))
% 0.38/0.56 (step t17 (cl (= (= 0 0) true)) :rule all_simplify)
% 0.38/0.56 (step t18 (cl (= (not (= 0 0)) (not true))) :rule cong :premises (t17))
% 0.38/0.56 (step t19 (cl (= (not (= 0 0)) false)) :rule trans :premises (t18 t15))
% 0.38/0.56 (step t20 (cl (= (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule refl)
% 0.38/0.56 (step t21 (cl (= (or (not (>= 0 0)) (not (= 0 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (or false false (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))))) :rule cong :premises (t16 t19 t20))
% 0.38/0.56 (step t22 (cl (= (or false false (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule all_simplify)
% 0.38/0.56 (step t23 (cl (= (or (not (>= 0 0)) (not (= 0 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule trans :premises (t21 t22))
% 0.38/0.56 (step t24 (cl (= (forall ((N Int)) (or (not (>= N 0)) (not (= N 0)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N)))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule trans :premises (t12 t23))
% 0.38/0.56 (step t25 (cl (= (forall ((N Int)) (=> (>= N 0) (=> (= N 0) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) N))))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule trans :premises (t11 t24))
% 0.38/0.56 (step t26 (cl (= (forall ((N Int)) (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1))))) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule trans :premises (t10 t25))
% 0.38/0.56 (step t27 (cl (= (not (forall ((N Int)) (=> (<= 0 N) (=> (= N 0) (= (tptp.power1 (tptp.mk_t1 1 1 1 0) N) (tptp.mk_t1 (+ 1 0) 0 0 1)))))) (not (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0))))) :rule cong :premises (t26))
% 0.38/0.56 (step t28 (cl (not (= (tptp.mk_t1 1 0 0 1) (tptp.power1 (tptp.mk_t1 1 1 1 0) 0)))) :rule resolution :premises (t9 t27 a33))
% 0.38/0.56 (step t29 (cl (not (= (forall ((X tptp.t1)) (= (tptp.power1 X 0) (tptp.mk_t1 1 0 0 1))) (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))))) (not (forall ((X tptp.t1)) (= (tptp.power1 X 0) (tptp.mk_t1 1 0 0 1)))) (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) :rule equiv_pos2)
% 0.38/0.56 (anchor :step t30 :args ((X tptp.t1) (:= X X)))
% 0.38/0.56 (step t30.t1 (cl (= X X)) :rule refl)
% 0.38/0.56 (step t30.t2 (cl (= (= (tptp.power1 X 0) (tptp.mk_t1 1 0 0 1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) :rule all_simplify)
% 0.38/0.56 (step t30 (cl (= (forall ((X tptp.t1)) (= (tptp.power1 X 0) (tptp.mk_t1 1 0 0 1))) (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0))))) :rule bind)
% 0.38/0.56 (step t31 (cl (forall ((X tptp.t1)) (= (tptp.mk_t1 1 0 0 1) (tptp.power1 X 0)))) :rule resolution :premises (t29 t30 a26))
% 0.38/0.56 (step t32 (cl) :rule resolution :premises (t8 t28 t31))
% 0.38/0.56
% 0.38/0.56 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.HTkE5ughMF/cvc5---1.0.5_26273.smt2
% 0.38/0.56 % cvc5---1.0.5 exiting
% 0.38/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------