TSTP Solution File: SYO214^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYO214^5 : TPTP v8.2.0. Released v4.0.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 18:31:03 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO214^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n021.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 28 07:48:39 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 %----Proving TH0
% 0.20/0.51 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.51 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.uxRv9OAu2k/cvc5---1.0.5_30975.smt2
% 0.20/0.51 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.uxRv9OAu2k/cvc5---1.0.5_30975.smt2
% 0.20/0.51 (assume a0 (not (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X)))))))
% 0.20/0.51 (assume a1 true)
% 0.20/0.51 (step t1 (cl (not (= (not (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X)))))) false)) (not (not (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X))))))) false) :rule equiv_pos2)
% 0.20/0.51 (anchor :step t2 :args ((R (-> $$unsorted Bool)) (:= R R) (S (-> $$unsorted Bool)) (:= S S)))
% 0.20/0.51 (step t2.t1 (cl (= R R)) :rule refl)
% 0.20/0.51 (step t2.t2 (cl (= S S)) :rule refl)
% 0.20/0.51 (step t2.t3 (cl (= (= R S) (= R S))) :rule refl)
% 0.20/0.51 (step t2.t4 (cl (= (forall ((X $$unsorted)) (=> (@ S X) (@ R X))) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))) :rule all_simplify)
% 0.20/0.51 (step t2.t5 (cl (= (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X)))) (=> (= R S) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X)))))) :rule cong :premises (t2.t3 t2.t4))
% 0.20/0.51 (step t2 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X))))) (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))))) :rule bind)
% 0.20/0.51 (step t3 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))) (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (or (not (= R S)) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))))) :rule all_simplify)
% 0.20/0.51 (step t4 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (or (not (= R S)) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))) (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= R S)) (or (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595)))))) :rule all_simplify)
% 0.20/0.51 (anchor :step t5 :args ((R (-> $$unsorted Bool)) (:= R R) (S (-> $$unsorted Bool)) (:= S S) (BOUND_VARIABLE_595 $$unsorted) (:= BOUND_VARIABLE_595 BOUND_VARIABLE_595)))
% 0.20/0.51 (step t5.t1 (cl (= R R)) :rule refl)
% 0.20/0.51 (step t5.t2 (cl (= S S)) :rule refl)
% 0.20/0.51 (step t5.t3 (cl (= BOUND_VARIABLE_595 BOUND_VARIABLE_595)) :rule refl)
% 0.20/0.51 (step t5.t4 (cl (= (or (not (= R S)) (or (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595))) (or (not (= R S)) (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595)))) :rule all_simplify)
% 0.20/0.51 (step t5 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= R S)) (or (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595)))) (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= R S)) (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595))))) :rule bind)
% 0.20/0.51 (step t6 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= R S)) (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595))) (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= S S)) (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595))))) :rule all_simplify)
% 0.20/0.51 (anchor :step t7 :args ((S (-> $$unsorted Bool)) (:= S S) (BOUND_VARIABLE_595 $$unsorted) (:= BOUND_VARIABLE_595 BOUND_VARIABLE_595)))
% 0.20/0.51 (step t7.t1 (cl (= S S)) :rule refl)
% 0.20/0.51 (step t7.t2 (cl (= BOUND_VARIABLE_595 BOUND_VARIABLE_595)) :rule refl)
% 0.20/0.51 (step t7.t3 (cl (= (= S S) true)) :rule all_simplify)
% 0.20/0.51 (step t7.t4 (cl (= (not (= S S)) (not true))) :rule cong :premises (t7.t3))
% 0.20/0.51 (step t7.t5 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.51 (step t7.t6 (cl (= (not (= S S)) false)) :rule trans :premises (t7.t4 t7.t5))
% 0.20/0.51 (step t7.t7 (cl (= (not (@ S BOUND_VARIABLE_595)) (not (@ S BOUND_VARIABLE_595)))) :rule refl)
% 0.20/0.51 (step t7.t8 (cl (= (@ S BOUND_VARIABLE_595) (@ S BOUND_VARIABLE_595))) :rule refl)
% 0.20/0.51 (step t7.t9 (cl (= (or (not (= S S)) (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595)) (or false (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595)))) :rule cong :premises (t7.t6 t7.t7 t7.t8))
% 0.20/0.51 (step t7.t10 (cl (= (or false (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595)) (or (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595)))) :rule all_simplify)
% 0.20/0.51 (step t7.t11 (cl (= (or (not (= S S)) (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595)) (or (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595)))) :rule trans :premises (t7.t9 t7.t10))
% 0.20/0.51 (step t7 (cl (= (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= S S)) (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595))) (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595))))) :rule bind)
% 0.20/0.51 (step t8 (cl (= (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595))) (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) true))) :rule all_simplify)
% 0.20/0.51 (step t9 (cl (= (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) true) true)) :rule all_simplify)
% 0.20/0.51 (step t10 (cl (= (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595))) true)) :rule trans :premises (t8 t9))
% 0.20/0.51 (step t11 (cl (= (forall ((S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= S S)) (not (@ S BOUND_VARIABLE_595)) (@ S BOUND_VARIABLE_595))) true)) :rule trans :premises (t7 t10))
% 0.20/0.51 (step t12 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= R S)) (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595))) true)) :rule trans :premises (t6 t11))
% 0.20/0.51 (step t13 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (BOUND_VARIABLE_595 $$unsorted)) (or (not (= R S)) (or (not (@ S BOUND_VARIABLE_595)) (@ R BOUND_VARIABLE_595)))) true)) :rule trans :premises (t5 t12))
% 0.20/0.51 (step t14 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (or (not (= R S)) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))) true)) :rule trans :premises (t4 t13))
% 0.20/0.51 (step t15 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (or (not (@ S X)) (@ R X))))) true)) :rule trans :premises (t3 t14))
% 0.20/0.51 (step t16 (cl (= (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X))))) true)) :rule trans :premises (t2 t15))
% 0.20/0.51 (step t17 (cl (= (not (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X)))))) (not true))) :rule cong :premises (t16))
% 0.20/0.51 (step t18 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.51 (step t19 (cl (= (not (forall ((R (-> $$unsorted Bool)) (S (-> $$unsorted Bool))) (=> (= R S) (forall ((X $$unsorted)) (=> (@ S X) (@ R X)))))) false)) :rule trans :premises (t17 t18))
% 0.20/0.51 (step t20 (cl false) :rule resolution :premises (t1 t19 a0))
% 0.20/0.51 (step t21 (cl (not false)) :rule false)
% 0.20/0.51 (step t22 (cl) :rule resolution :premises (t20 t21))
% 0.20/0.51
% 0.20/0.51 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.uxRv9OAu2k/cvc5---1.0.5_30975.smt2
% 0.20/0.51 % cvc5---1.0.5 exiting
% 0.20/0.51 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------