TSTP Solution File: SEU661^2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU661^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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:54:34 EDT 2024
% Result : Theorem 0.13s 0.42s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SEU661^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.09 % Command : do_cvc5 %s %d
% 0.09/0.28 % Computer : n005.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 27 12:15:38 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.41 %----Proving TH0
% 0.13/0.42 --- Run --ho-elim --full-saturate-quant at 10...
% 0.13/0.42 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.ZP76fBUWFA/cvc5---1.0.5_2745.smt2
% 0.13/0.42 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.ZP76fBUWFA/cvc5---1.0.5_2745.smt2
% 0.13/0.42 (assume a0 (not (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))))))))
% 0.13/0.42 (assume a1 true)
% 0.13/0.42 (step t1 (cl (not (= (not (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))))))) false)) (not (not (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy)))))))) false) :rule equiv_pos2)
% 0.13/0.42 (anchor :step t2 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (Xx $$unsorted) (:= Xx Xx)))
% 0.13/0.42 (step t2.t1 (cl (= A A)) :rule refl)
% 0.13/0.42 (step t2.t2 (cl (= B B)) :rule refl)
% 0.13/0.42 (step t2.t3 (cl (= Xx Xx)) :rule refl)
% 0.13/0.42 (step t2.t4 (cl (= (@ (@ tptp.in Xx) A) (@ (@ tptp.in Xx) A))) :rule refl)
% 0.13/0.42 (anchor :step t2.t5 :args ((Xy $$unsorted) (:= Xy Xy)))
% 0.13/0.42 (step t2.t5.t1 (cl (= Xy Xy)) :rule refl)
% 0.13/0.42 (step t2.t5.t2 (cl (= (@ (@ tptp.in Xy) B) (@ (@ tptp.in Xy) B))) :rule refl)
% 0.13/0.42 (step t2.t5.t3 (cl (= (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy)) true)) :rule all_simplify)
% 0.13/0.42 (step t2.t5.t4 (cl (= (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))) (=> (@ (@ tptp.in Xy) B) true))) :rule cong :premises (t2.t5.t2 t2.t5.t3))
% 0.13/0.42 (step t2.t5.t5 (cl (= (=> (@ (@ tptp.in Xy) B) true) true)) :rule all_simplify)
% 0.13/0.42 (step t2.t5.t6 (cl (= (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))) true)) :rule trans :premises (t2.t5.t4 t2.t5.t5))
% 0.13/0.42 (step t2.t5 (cl (= (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy)))) (forall ((Xy $$unsorted)) true))) :rule bind)
% 0.13/0.42 (step t2.t6 (cl (= (forall ((Xy $$unsorted)) true) true)) :rule all_simplify)
% 0.13/0.42 (step t2.t7 (cl (= (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy)))) true)) :rule trans :premises (t2.t5 t2.t6))
% 0.13/0.42 (step t2.t8 (cl (= (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))))) (=> (@ (@ tptp.in Xx) A) true))) :rule cong :premises (t2.t4 t2.t7))
% 0.13/0.42 (step t2.t9 (cl (= (=> (@ (@ tptp.in Xx) A) true) true)) :rule all_simplify)
% 0.13/0.42 (step t2.t10 (cl (= (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))))) true)) :rule trans :premises (t2.t8 t2.t9))
% 0.13/0.42 (step t2 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy)))))) (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) true))) :rule bind)
% 0.13/0.42 (step t3 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) true) true)) :rule all_simplify)
% 0.13/0.42 (step t4 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy)))))) true)) :rule trans :premises (t2 t3))
% 0.13/0.42 (step t5 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))))))) (not true))) :rule cong :premises (t4))
% 0.13/0.42 (step t6 (cl (= (not true) false)) :rule all_simplify)
% 0.13/0.42 (step t7 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (forall ((Xy $$unsorted)) (=> (@ (@ tptp.in Xy) B) (= (@ (@ tptp.kpair Xx) Xy) (@ (@ tptp.kpair Xx) Xy))))))) false)) :rule trans :premises (t5 t6))
% 0.13/0.42 (step t8 (cl false) :rule resolution :premises (t1 t7 a0))
% 0.13/0.42 (step t9 (cl (not false)) :rule false)
% 0.13/0.42 (step t10 (cl) :rule resolution :premises (t8 t9))
% 0.13/0.43
% 0.13/0.43 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.ZP76fBUWFA/cvc5---1.0.5_2745.smt2
% 0.13/0.43 % cvc5---1.0.5 exiting
% 0.13/0.43 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------