TSTP Solution File: SYN946+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN946+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n024.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:26:55 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN946+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 28 13:23:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.dlyw7FYS3j/cvc5---1.0.5_9275.smt2
% 0.20/0.53 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.dlyw7FYS3j/cvc5---1.0.5_9275.smt2
% 0.20/0.53 (assume a0 (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.q Y))) (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z)))))))
% 0.20/0.53 (assume a1 true)
% 0.20/0.53 (step t1 (cl (not (not (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))) :rule not_not)
% 0.20/0.53 (step t2 (cl (not (= (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.q Y))) (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z)))))) (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y))))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))))) (not (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.q Y))) (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z))))))) (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y))))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y)))))))) :rule equiv_pos2)
% 0.20/0.53 (step t3 (cl (= (forall ((X $$unsorted)) (tptp.p X)) (forall ((X $$unsorted)) (tptp.p X)))) :rule refl)
% 0.20/0.53 (step t4 (cl (= (exists ((Y $$unsorted)) (tptp.q Y)) (not (forall ((Y $$unsorted)) (not (tptp.q Y)))))) :rule all_simplify)
% 0.20/0.53 (step t5 (cl (= (and (forall ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.q Y))) (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y))))))) :rule cong :premises (t3 t4))
% 0.20/0.53 (anchor :step t6 :args ((Z $$unsorted) (:= Z Z)))
% 0.20/0.53 (step t6.t1 (cl (= Z Z)) :rule refl)
% 0.20/0.53 (step t6.t2 (cl (= (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z))) (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y))))) :rule all_simplify)
% 0.20/0.53 (step t6 (cl (= (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z)))) (exists ((Z $$unsorted)) (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule bind)
% 0.20/0.53 (step t7 (cl (= (exists ((Z $$unsorted)) (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y)))) (not (forall ((Z $$unsorted)) (not (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y)))))))) :rule all_simplify)
% 0.20/0.53 (step t8 (cl (= (forall ((Z $$unsorted)) (not (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y))))) (forall ((Z $$unsorted)) (and (not (tptp.r Z)) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule all_simplify)
% 0.20/0.53 (step t9 (cl (= (forall ((Z $$unsorted)) (and (not (tptp.r Z)) (not (forall ((Y $$unsorted)) (tptp.p Y))))) (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule all_simplify)
% 0.20/0.53 (step t10 (cl (= (forall ((Z $$unsorted)) (not (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y))))) (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule trans :premises (t8 t9))
% 0.20/0.53 (step t11 (cl (= (not (forall ((Z $$unsorted)) (not (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y)))))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule cong :premises (t10))
% 0.20/0.53 (step t12 (cl (= (exists ((Z $$unsorted)) (or (tptp.r Z) (forall ((Y $$unsorted)) (tptp.p Y)))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule trans :premises (t7 t11))
% 0.20/0.53 (step t13 (cl (= (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z)))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule trans :premises (t6 t12))
% 0.20/0.53 (step t14 (cl (= (=> (and (forall ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.q Y))) (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z))))) (=> (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y))))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y)))))))) :rule cong :premises (t5 t13))
% 0.20/0.53 (step t15 (cl (= (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.q Y))) (exists ((Z $$unsorted)) (forall ((Y $$unsorted)) (or (tptp.p Y) (tptp.r Z)))))) (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y))))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))))) :rule cong :premises (t14))
% 0.20/0.53 (step t16 (cl (not (=> (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y))))) (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y)))))))) :rule resolution :premises (t2 t15 a0))
% 0.20/0.53 (step t17 (cl (not (not (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule not_implies2 :premises (t16))
% 0.20/0.53 (step t18 (cl (and (forall ((BOUND_VARIABLE_611 $$unsorted)) (not (tptp.r BOUND_VARIABLE_611))) (not (forall ((Y $$unsorted)) (tptp.p Y))))) :rule resolution :premises (t1 t17))
% 0.20/0.53 (step t19 (cl (not (forall ((Y $$unsorted)) (tptp.p Y)))) :rule and :premises (t18))
% 0.20/0.53 (step t20 (cl (= (forall ((X $$unsorted)) (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y)))) :rule hole :args ((forall ((X $$unsorted)) (tptp.p X)) (= X Y)))
% 0.20/0.53 (step t21 (cl (not (forall ((X $$unsorted)) (tptp.p X))) (forall ((Y $$unsorted)) (tptp.p Y))) :rule equiv1 :premises (t20))
% 0.20/0.53 (step t22 (cl (forall ((Y $$unsorted)) (tptp.p Y)) (not (forall ((X $$unsorted)) (tptp.p X)))) :rule reordering :premises (t21))
% 0.20/0.53 (step t23 (cl (and (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((Y $$unsorted)) (not (tptp.q Y)))))) :rule not_implies1 :premises (t16))
% 0.20/0.53 (step t24 (cl (forall ((X $$unsorted)) (tptp.p X))) :rule and :premises (t23))
% 0.20/0.53 (step t25 (cl (forall ((Y $$unsorted)) (tptp.p Y))) :rule resolution :premises (t22 t24))
% 0.20/0.53 (step t26 (cl) :rule resolution :premises (t19 t25))
% 0.20/0.53
% 0.20/0.53 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.dlyw7FYS3j/cvc5---1.0.5_9275.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------