TSTP Solution File: SYO231^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYO231^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n004.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:07 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYO231^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue May 28 08:10:54 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 %----Proving TH0
% 0.21/0.52 --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.52 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.G7wOP48vOd/cvc5---1.0.5_17185.smt2
% 0.21/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.G7wOP48vOd/cvc5---1.0.5_17185.smt2
% 0.21/0.52 (assume a0 (not (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))))
% 0.21/0.52 (assume a1 true)
% 0.21/0.52 (step t1 (cl (not (= (not (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))) false)) (not (not (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))))) false) :rule equiv_pos2)
% 0.21/0.52 (step t2 (cl (= (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))) (not (forall ((Xu (-> $$unsorted Bool))) (not (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))))))) :rule all_simplify)
% 0.21/0.52 (step t3 (cl (= (forall ((Xu (-> $$unsorted Bool))) (not (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))) (not (= (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))) (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))))) :rule all_simplify)
% 0.21/0.52 (step t4 (cl (= (= (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))) (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))) true)) :rule all_simplify)
% 0.21/0.52 (step t5 (cl (= (not (= (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))) (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))) (not true))) :rule cong :premises (t4))
% 0.21/0.52 (step t6 (cl (= (not true) false)) :rule all_simplify)
% 0.21/0.52 (step t7 (cl (= (not (= (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))) (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))) false)) :rule trans :premises (t5 t6))
% 0.21/0.52 (step t8 (cl (= (forall ((Xu (-> $$unsorted Bool))) (not (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))) false)) :rule trans :premises (t3 t7))
% 0.21/0.52 (step t9 (cl (= (not (forall ((Xu (-> $$unsorted Bool))) (not (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))))) (not false))) :rule cong :premises (t8))
% 0.21/0.52 (step t10 (cl (= (not false) true)) :rule all_simplify)
% 0.21/0.52 (step t11 (cl (= (not (forall ((Xu (-> $$unsorted Bool))) (not (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))))) true)) :rule trans :premises (t9 t10))
% 0.21/0.52 (step t12 (cl (= (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx))))) true)) :rule trans :premises (t2 t11))
% 0.21/0.52 (step t13 (cl (= (not (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))) (not true))) :rule cong :premises (t12))
% 0.21/0.52 (step t14 (cl (= (not (exists ((Xu (-> $$unsorted Bool))) (= Xu (lambda ((Xx $$unsorted)) (and (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))) false)) :rule trans :premises (t13 t6))
% 0.21/0.52 (step t15 (cl false) :rule resolution :premises (t1 t14 a0))
% 0.21/0.52 (step t16 (cl (not false)) :rule false)
% 0.21/0.52 (step t17 (cl) :rule resolution :premises (t15 t16))
% 0.21/0.52
% 0.21/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.G7wOP48vOd/cvc5---1.0.5_17185.smt2
% 0.21/0.52 % cvc5---1.0.5 exiting
% 0.21/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------