TSTP Solution File: SYN968+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN968+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n010.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:58 EDT 2024
% Result : Theorem 0.45s 0.61s
% Output : Proof 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.16 % Problem : SYN968+1 : TPTP v8.2.0. Released v3.1.0.
% 0.18/0.18 % Command : do_cvc5 %s %d
% 0.18/0.40 % Computer : n010.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Tue May 28 13:51:39 EDT 2024
% 0.26/0.40 % CPUTime :
% 0.26/0.58 %----Proving TF0_NAR, FOF, or CNF
% 0.45/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.45/0.61 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.kotz0yalW8/cvc5---1.0.5_20970.smt2
% 0.45/0.61 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.kotz0yalW8/cvc5---1.0.5_20970.smt2
% 0.45/0.61 (assume a0 (not (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y))))))
% 0.45/0.61 (assume a1 true)
% 0.45/0.61 (step t1 (cl (not (= (not (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y))))) (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) (not (not (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y)))))) (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y))))) :rule equiv_pos2)
% 0.45/0.61 (anchor :step t2 :args ((X $$unsorted) (:= X X)))
% 0.45/0.61 (step t2.t1 (cl (= X X)) :rule refl)
% 0.45/0.61 (step t2.t2 (cl (= (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y))) (forall ((Y $$unsorted)) (or (not (tptp.p X)) (tptp.p Y))))) :rule all_simplify)
% 0.45/0.61 (step t2.t3 (cl (= (forall ((Y $$unsorted)) (or (not (tptp.p X)) (tptp.p Y))) (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y))))) :rule all_simplify)
% 0.45/0.61 (step t2.t4 (cl (= (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y))) (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y))))) :rule trans :premises (t2.t2 t2.t3))
% 0.45/0.61 (step t2 (cl (= (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y)))) (exists ((X $$unsorted)) (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule bind)
% 0.45/0.61 (step t3 (cl (= (exists ((X $$unsorted)) (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y)))) (not (forall ((X $$unsorted)) (not (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y)))))))) :rule all_simplify)
% 0.45/0.61 (step t4 (cl (= (forall ((X $$unsorted)) (not (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y))))) (forall ((X $$unsorted)) (and (tptp.p X) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule all_simplify)
% 0.45/0.61 (step t5 (cl (= (forall ((X $$unsorted)) (and (tptp.p X) (not (forall ((Y $$unsorted)) (tptp.p Y))))) (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule all_simplify)
% 0.45/0.61 (step t6 (cl (= (forall ((X $$unsorted)) (not (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y))))) (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule trans :premises (t4 t5))
% 0.45/0.61 (step t7 (cl (= (not (forall ((X $$unsorted)) (not (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y)))))) (not (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule cong :premises (t6))
% 0.45/0.61 (step t8 (cl (= (exists ((X $$unsorted)) (or (not (tptp.p X)) (forall ((Y $$unsorted)) (tptp.p Y)))) (not (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule trans :premises (t3 t7))
% 0.45/0.61 (step t9 (cl (= (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y)))) (not (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y))))))) :rule trans :premises (t2 t8))
% 0.45/0.61 (step t10 (cl (= (not (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y))))) (not (not (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))))) :rule cong :premises (t9))
% 0.45/0.61 (step t11 (cl (= (not (not (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule all_simplify)
% 0.45/0.61 (step t12 (cl (= (not (exists ((X $$unsorted)) (forall ((Y $$unsorted)) (=> (tptp.p X) (tptp.p Y))))) (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y)))))) :rule trans :premises (t10 t11))
% 0.45/0.61 (step t13 (cl (and (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (not (forall ((Y $$unsorted)) (tptp.p Y))))) :rule resolution :premises (t1 t12 a0))
% 0.45/0.61 (step t14 (cl (not (forall ((Y $$unsorted)) (tptp.p Y)))) :rule and :premises (t13))
% 0.45/0.61 (step t15 (cl (= (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (forall ((Y $$unsorted)) (tptp.p Y)))) :rule hole :args ((forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)) (= BOUND_VARIABLE_597 Y)))
% 0.45/0.61 (step t16 (cl (= (forall ((Y $$unsorted)) (tptp.p Y)) (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)))) :rule symm :premises (t15))
% 0.45/0.61 (step t17 (cl (forall ((Y $$unsorted)) (tptp.p Y)) (not (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597)))) :rule equiv2 :premises (t16))
% 0.45/0.61 (step t18 (cl (forall ((BOUND_VARIABLE_597 $$unsorted)) (tptp.p BOUND_VARIABLE_597))) :rule and :premises (t13))
% 0.45/0.61 (step t19 (cl (forall ((Y $$unsorted)) (tptp.p Y))) :rule resolution :premises (t17 t18))
% 0.45/0.61 (step t20 (cl) :rule resolution :premises (t14 t19))
% 0.45/0.61
% 0.45/0.61 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.kotz0yalW8/cvc5---1.0.5_20970.smt2
% 0.45/0.61 % cvc5---1.0.5 exiting
% 0.45/0.62 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------