TSTP Solution File: SEV388^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEV388^5 : TPTP v8.2.0. Released v4.0.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 17:58:17 EDT 2024
% Result : Theorem 0.25s 0.58s
% Output : Proof 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SEV388^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.16 % Command : do_cvc5 %s %d
% 0.17/0.38 % Computer : n024.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Mon May 27 12:58:54 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.25/0.55 %----Proving TH0
% 0.25/0.58 --- Run --ho-elim --full-saturate-quant at 10...
% 0.25/0.58 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.omsgI8pj5s/cvc5---1.0.5_12244.smt2
% 0.25/0.58 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.omsgI8pj5s/cvc5---1.0.5_12244.smt2
% 0.25/0.58 (assume a0 (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))))))
% 0.25/0.58 (assume a1 true)
% 0.25/0.58 (step t1 (cl (not (= (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))) false)) (not (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))) false) :rule equiv_pos2)
% 0.25/0.58 (anchor :step t2 :args ((Xx $$unsorted) (:= Xx Xx)))
% 0.25/0.58 (step t2.t1 (cl (= Xx Xx)) :rule refl)
% 0.25/0.58 (step t2.t2 (cl (= (not (@ tptp.cR Xx)) (not (@ tptp.cR Xx)))) :rule refl)
% 0.25/0.58 (step t2.t3 (cl (not (= (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))))) (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))))) (not (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx)))))) (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))))) :rule equiv_pos2)
% 0.25/0.58 (step t2.t4 (cl (= (= tptp.cR tptp.cS) (= tptp.cS tptp.cR))) :rule all_simplify)
% 0.25/0.58 (step t2.t5 (cl (= (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))) :rule all_simplify)
% 0.25/0.58 (step t2.t6 (cl (= (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx)))) (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))))) :rule cong :premises (t2.t4 t2.t5))
% 0.25/0.58 (step t2.t7 (cl (= (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))))) (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))))) :rule cong :premises (t2.t6))
% 0.25/0.58 (step t2.t8 (cl (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))))) :rule resolution :premises (t2.t3 t2.t7 a0))
% 0.25/0.58 (step t2.t9 (cl (= tptp.cS tptp.cR)) :rule not_implies1 :premises (t2.t8))
% 0.25/0.58 (step t2.t10 (cl (= Xx Xx)) :rule refl)
% 0.25/0.58 (step t2.t11 (cl (= (@ tptp.cS Xx) (@ tptp.cR Xx))) :rule cong :premises (t2.t9 t2.t10))
% 0.25/0.58 (step t2.t12 (cl (= (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx)))) :rule cong :premises (t2.t2 t2.t11))
% 0.25/0.58 (step t2 (cl (= (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx))))) :rule bind)
% 0.25/0.58 (step t3 (cl (= (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))) (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx)))))) :rule cong :premises (t2))
% 0.25/0.58 (step t4 (cl (= (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx))) (forall ((Xx $$unsorted)) true))) :rule all_simplify)
% 0.25/0.58 (step t5 (cl (= (forall ((Xx $$unsorted)) true) true)) :rule all_simplify)
% 0.25/0.58 (step t6 (cl (= (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx))) true)) :rule trans :premises (t4 t5))
% 0.25/0.58 (step t7 (cl (= (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx)))) (not true))) :rule cong :premises (t6))
% 0.25/0.58 (step t8 (cl (= (not true) false)) :rule all_simplify)
% 0.25/0.58 (step t9 (cl (= (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cR Xx)))) false)) :rule trans :premises (t7 t8))
% 0.25/0.58 (step t10 (cl (= (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))) false)) :rule trans :premises (t3 t9))
% 0.25/0.58 (step t11 (cl (not (= (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))))) (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))))) (not (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx)))))) (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))))) :rule equiv_pos2)
% 0.25/0.58 (step t12 (cl (= (= tptp.cR tptp.cS) (= tptp.cS tptp.cR))) :rule all_simplify)
% 0.25/0.58 (step t13 (cl (= (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))) :rule all_simplify)
% 0.25/0.58 (step t14 (cl (= (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx)))) (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))))) :rule cong :premises (t12 t13))
% 0.25/0.58 (step t15 (cl (= (not (=> (= tptp.cR tptp.cS) (forall ((Xx $$unsorted)) (=> (@ tptp.cR Xx) (@ tptp.cS Xx))))) (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))))) :rule cong :premises (t14))
% 0.25/0.58 (step t16 (cl (not (=> (= tptp.cS tptp.cR) (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx)))))) :rule resolution :premises (t11 t15 a0))
% 0.25/0.58 (step t17 (cl (not (forall ((Xx $$unsorted)) (or (not (@ tptp.cR Xx)) (@ tptp.cS Xx))))) :rule not_implies2 :premises (t16))
% 0.25/0.58 (step t18 (cl false) :rule resolution :premises (t1 t10 t17))
% 0.25/0.58 (step t19 (cl (not false)) :rule false)
% 0.25/0.58 (step t20 (cl) :rule resolution :premises (t18 t19))
% 0.25/0.58
% 0.25/0.58 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.omsgI8pj5s/cvc5---1.0.5_12244.smt2
% 0.25/0.58 % cvc5---1.0.5 exiting
% 0.25/0.59 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------