TSTP Solution File: SEU568^2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU568^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n012.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:10 EDT 2024
% Result : Theorem 0.23s 0.54s
% Output : Proof 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEU568^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 27 10:07:39 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.52 %----Proving TH0
% 0.23/0.54 --- Run --ho-elim --full-saturate-quant at 10...
% 0.23/0.54 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.vgLfCXkgF9/cvc5---1.0.5_10165.smt2
% 0.23/0.54 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.vgLfCXkgF9/cvc5---1.0.5_10165.smt2
% 0.23/0.54 (assume a0 (= tptp.notsubsetI (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (@ (@ tptp.subset A) B)))))))
% 0.23/0.54 (assume a1 (= tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted)) (=> (not (@ (@ tptp.subset A) B)) (not (= A B))))))
% 0.23/0.54 (assume a2 (not (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B)))))))))
% 0.23/0.54 (assume a3 true)
% 0.23/0.54 (step t1 (cl (not (= (not (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B)))))))) false)) (not (not (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B))))))))) false) :rule equiv_pos2)
% 0.23/0.54 (step t2 (cl (= tptp.notsubsetI tptp.notsubsetI)) :rule refl)
% 0.23/0.54 (step t3 (cl (= tptp.notequalI1 tptp.notequalI1)) :rule refl)
% 0.23/0.54 (step t4 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B))))) (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in Xx) B) (not (= A B)))))) :rule all_simplify)
% 0.23/0.54 (step t5 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in Xx) B) (not (= A B)))) (forall ((B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) (not (= B B)))))) :rule all_simplify)
% 0.23/0.54 (anchor :step t6 :args ((B $$unsorted) (:= B B) (Xx $$unsorted) (:= Xx Xx)))
% 0.23/0.54 (step t6.t1 (cl (= B B)) :rule refl)
% 0.23/0.54 (step t6.t2 (cl (= Xx Xx)) :rule refl)
% 0.23/0.54 (step t6.t3 (cl (= (not (@ (@ tptp.in Xx) B)) (not (@ (@ tptp.in Xx) B)))) :rule refl)
% 0.23/0.54 (step t6.t4 (cl (= (@ (@ tptp.in Xx) B) (@ (@ tptp.in Xx) B))) :rule refl)
% 0.23/0.54 (step t6.t5 (cl (= (= B B) true)) :rule all_simplify)
% 0.23/0.54 (step t6.t6 (cl (= (not (= B B)) (not true))) :rule cong :premises (t6.t5))
% 0.23/0.54 (step t6.t7 (cl (= (not true) false)) :rule all_simplify)
% 0.23/0.54 (step t6.t8 (cl (= (not (= B B)) false)) :rule trans :premises (t6.t6 t6.t7))
% 0.23/0.54 (step t6.t9 (cl (= (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) (not (= B B))) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) false))) :rule cong :premises (t6.t3 t6.t4 t6.t8))
% 0.23/0.54 (step t6.t10 (cl (= (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) false) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B)))) :rule all_simplify)
% 0.23/0.54 (step t6.t11 (cl (= (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) (not (= B B))) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B)))) :rule trans :premises (t6.t9 t6.t10))
% 0.23/0.54 (step t6 (cl (= (forall ((B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) (not (= B B)))) (forall ((B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B))))) :rule bind)
% 0.23/0.54 (step t7 (cl (= (forall ((B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B))) (forall ((B $$unsorted) (Xx $$unsorted)) true))) :rule all_simplify)
% 0.23/0.54 (step t8 (cl (= (forall ((B $$unsorted) (Xx $$unsorted)) true) true)) :rule all_simplify)
% 0.23/0.54 (step t9 (cl (= (forall ((B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B))) true)) :rule trans :premises (t7 t8))
% 0.23/0.54 (step t10 (cl (= (forall ((B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) B)) (@ (@ tptp.in Xx) B) (not (= B B)))) true)) :rule trans :premises (t6 t9))
% 0.23/0.54 (step t11 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in Xx) B) (not (= A B)))) true)) :rule trans :premises (t5 t10))
% 0.23/0.54 (step t12 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B))))) true)) :rule trans :premises (t4 t11))
% 0.23/0.55 (step t13 (cl (= (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B)))))) (=> tptp.notequalI1 true))) :rule cong :premises (t3 t12))
% 0.23/0.55 (step t14 (cl (= (=> tptp.notequalI1 true) true)) :rule all_simplify)
% 0.23/0.55 (step t15 (cl (= (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B)))))) true)) :rule trans :premises (t13 t14))
% 0.23/0.55 (step t16 (cl (= (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B))))))) (=> tptp.notsubsetI true))) :rule cong :premises (t2 t15))
% 0.23/0.55 (step t17 (cl (= (=> tptp.notsubsetI true) true)) :rule all_simplify)
% 0.23/0.55 (step t18 (cl (= (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B))))))) true)) :rule trans :premises (t16 t17))
% 0.23/0.55 (step t19 (cl (= (not (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B)))))))) (not true))) :rule cong :premises (t18))
% 0.23/0.55 (step t20 (cl (= (not true) false)) :rule all_simplify)
% 0.23/0.55 (step t21 (cl (= (not (=> tptp.notsubsetI (=> tptp.notequalI1 (forall ((A $$unsorted) (B $$unsorted) (Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (=> (not (@ (@ tptp.in Xx) B)) (not (= A B)))))))) false)) :rule trans :premises (t19 t20))
% 0.23/0.55 (step t22 (cl false) :rule resolution :premises (t1 t21 a2))
% 0.23/0.55 (step t23 (cl (not false)) :rule false)
% 0.23/0.55 (step t24 (cl) :rule resolution :premises (t22 t23))
% 0.23/0.55
% 0.23/0.55 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.vgLfCXkgF9/cvc5---1.0.5_10165.smt2
% 0.23/0.55 % cvc5---1.0.5 exiting
% 0.23/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------