TSTP Solution File: SEU888^5 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SEU888^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n003.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:55:22 EDT 2024

% Result   : Theorem 0.21s 0.54s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SEU888^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n003.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon May 27 11:01:09 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.51  %----Proving TH0
% 0.21/0.54  --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.54  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.oeg8I1ndOi/cvc5---1.0.5_7313.smt2
% 0.21/0.54  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.oeg8I1ndOi/cvc5---1.0.5_7313.smt2
% 0.21/0.54  (assume a0 (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt)))))))
% 0.21/0.54  (assume a1 true)
% 0.21/0.54  (step t1 (cl (not (= (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt)))))) (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))))) (not (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt))))))) (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))))) :rule equiv_pos2)
% 0.21/0.54  (step t2 (cl (= (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))))) :rule refl)
% 0.21/0.54  (anchor :step t3 :args ((Xt tptp.b) (:= Xt Xt)))
% 0.21/0.54  (step t3.t1 (cl (= Xt Xt)) :rule refl)
% 0.21/0.54  (step t3.t2 (cl (= (= Xt tptp.x) (= tptp.x Xt))) :rule all_simplify)
% 0.21/0.54  (step t3.t3 (cl (= (= Xt tptp.y) (= tptp.y Xt))) :rule all_simplify)
% 0.21/0.54  (step t3.t4 (cl (= (or (= Xt tptp.x) (= Xt tptp.y)) (or (= tptp.x Xt) (= tptp.y Xt)))) :rule cong :premises (t3.t2 t3.t3))
% 0.21/0.54  (step t3.t5 (cl (= (= tptp.z (@ tptp.g Xt)) (= tptp.z (@ tptp.g Xt)))) :rule refl)
% 0.21/0.54  (step t3.t6 (cl (= (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt))) (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt))))) :rule cong :premises (t3.t4 t3.t5))
% 0.21/0.54  (step t3 (cl (= (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt)))) (exists ((Xt tptp.b)) (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt)))))) :rule bind)
% 0.21/0.54  (step t4 (cl (= (exists ((Xt tptp.b)) (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt)))) (not (forall ((Xt tptp.b)) (not (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt)))))))) :rule all_simplify)
% 0.21/0.54  (step t5 (cl (= (forall ((Xt tptp.b)) (not (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt))))) (forall ((Xt tptp.b)) (or (and (not (= tptp.x Xt)) (not (= tptp.y Xt))) (not (= tptp.z (@ tptp.g Xt))))))) :rule all_simplify)
% 0.21/0.54  (step t6 (cl (= (forall ((Xt tptp.b)) (or (and (not (= tptp.x Xt)) (not (= tptp.y Xt))) (not (= tptp.z (@ tptp.g Xt))))) (forall ((Xt tptp.b)) (and (or (not (= tptp.x Xt)) (not (= tptp.z (@ tptp.g Xt)))) (or (not (= tptp.y Xt)) (not (= tptp.z (@ tptp.g Xt)))))))) :rule all_simplify)
% 0.21/0.54  (step t7 (cl (= (forall ((Xt tptp.b)) (and (or (not (= tptp.x Xt)) (not (= tptp.z (@ tptp.g Xt)))) (or (not (= tptp.y Xt)) (not (= tptp.z (@ tptp.g Xt)))))) (and (forall ((BOUND_VARIABLE_615 tptp.b)) (or (not (= tptp.x BOUND_VARIABLE_615)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_615))))) (forall ((BOUND_VARIABLE_625 tptp.b)) (or (not (= tptp.y BOUND_VARIABLE_625)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_625)))))))) :rule all_simplify)
% 0.21/0.54  (step t8 (cl (= (forall ((BOUND_VARIABLE_615 tptp.b)) (or (not (= tptp.x BOUND_VARIABLE_615)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_615))))) (or (not (= tptp.x tptp.x)) (not (= tptp.z (@ tptp.g tptp.x)))))) :rule all_simplify)
% 0.21/0.54  (step t9 (cl (= (= tptp.x tptp.x) true)) :rule all_simplify)
% 0.21/0.54  (step t10 (cl (= (not (= tptp.x tptp.x)) (not true))) :rule cong :premises (t9))
% 0.21/0.54  (step t11 (cl (= (not true) false)) :rule all_simplify)
% 0.21/0.54  (step t12 (cl (= (not (= tptp.x tptp.x)) false)) :rule trans :premises (t10 t11))
% 0.21/0.54  (step t13 (cl (= (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.x))))) :rule refl)
% 0.21/0.54  (step t14 (cl (= (or (not (= tptp.x tptp.x)) (not (= tptp.z (@ tptp.g tptp.x)))) (or false (not (= tptp.z (@ tptp.g tptp.x)))))) :rule cong :premises (t12 t13))
% 0.21/0.54  (step t15 (cl (= (or false (not (= tptp.z (@ tptp.g tptp.x)))) (not (= tptp.z (@ tptp.g tptp.x))))) :rule all_simplify)
% 0.21/0.54  (step t16 (cl (= (or (not (= tptp.x tptp.x)) (not (= tptp.z (@ tptp.g tptp.x)))) (not (= tptp.z (@ tptp.g tptp.x))))) :rule trans :premises (t14 t15))
% 0.21/0.54  (step t17 (cl (= (forall ((BOUND_VARIABLE_615 tptp.b)) (or (not (= tptp.x BOUND_VARIABLE_615)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_615))))) (not (= tptp.z (@ tptp.g tptp.x))))) :rule trans :premises (t8 t16))
% 0.21/0.54  (step t18 (cl (= (forall ((BOUND_VARIABLE_625 tptp.b)) (or (not (= tptp.y BOUND_VARIABLE_625)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_625))))) (or (not (= tptp.y tptp.y)) (not (= tptp.z (@ tptp.g tptp.y)))))) :rule all_simplify)
% 0.21/0.54  (step t19 (cl (= (= tptp.y tptp.y) true)) :rule all_simplify)
% 0.21/0.54  (step t20 (cl (= (not (= tptp.y tptp.y)) (not true))) :rule cong :premises (t19))
% 0.21/0.54  (step t21 (cl (= (not (= tptp.y tptp.y)) false)) :rule trans :premises (t20 t11))
% 0.21/0.54  (step t22 (cl (= (not (= tptp.z (@ tptp.g tptp.y))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule refl)
% 0.21/0.54  (step t23 (cl (= (or (not (= tptp.y tptp.y)) (not (= tptp.z (@ tptp.g tptp.y)))) (or false (not (= tptp.z (@ tptp.g tptp.y)))))) :rule cong :premises (t21 t22))
% 0.21/0.54  (step t24 (cl (= (or false (not (= tptp.z (@ tptp.g tptp.y)))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule all_simplify)
% 0.21/0.54  (step t25 (cl (= (or (not (= tptp.y tptp.y)) (not (= tptp.z (@ tptp.g tptp.y)))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule trans :premises (t23 t24))
% 0.21/0.54  (step t26 (cl (= (forall ((BOUND_VARIABLE_625 tptp.b)) (or (not (= tptp.y BOUND_VARIABLE_625)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_625))))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule trans :premises (t18 t25))
% 0.21/0.54  (step t27 (cl (= (and (forall ((BOUND_VARIABLE_615 tptp.b)) (or (not (= tptp.x BOUND_VARIABLE_615)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_615))))) (forall ((BOUND_VARIABLE_625 tptp.b)) (or (not (= tptp.y BOUND_VARIABLE_625)) (not (= tptp.z (@ tptp.g BOUND_VARIABLE_625)))))) (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))) :rule cong :premises (t17 t26))
% 0.21/0.54  (step t28 (cl (= (forall ((Xt tptp.b)) (and (or (not (= tptp.x Xt)) (not (= tptp.z (@ tptp.g Xt)))) (or (not (= tptp.y Xt)) (not (= tptp.z (@ tptp.g Xt)))))) (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))) :rule trans :premises (t7 t27))
% 0.21/0.54  (step t29 (cl (= (forall ((Xt tptp.b)) (or (and (not (= tptp.x Xt)) (not (= tptp.y Xt))) (not (= tptp.z (@ tptp.g Xt))))) (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))) :rule trans :premises (t6 t28))
% 0.21/0.54  (step t30 (cl (= (forall ((Xt tptp.b)) (not (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt))))) (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))) :rule trans :premises (t5 t29))
% 0.21/0.54  (step t31 (cl (= (not (forall ((Xt tptp.b)) (not (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt)))))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))) :rule cong :premises (t30))
% 0.21/0.54  (step t32 (cl (= (exists ((Xt tptp.b)) (and (or (= tptp.x Xt) (= tptp.y Xt)) (= tptp.z (@ tptp.g Xt)))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))) :rule trans :premises (t4 t31))
% 0.21/0.54  (step t33 (cl (= (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt)))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))) :rule trans :premises (t3 t32))
% 0.21/0.54  (step t34 (cl (= (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt))))) (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))))) :rule cong :premises (t2 t33))
% 0.21/0.54  (step t35 (cl (= (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt)))))) (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))))) :rule cong :premises (t34))
% 0.21/0.54  (step t36 (cl (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))))) :rule resolution :premises (t1 t35 a0))
% 0.21/0.54  (step t37 (cl (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y)))) :rule not_implies1 :premises (t36))
% 0.21/0.54  (step t38 (cl (not (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y)))) (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) :rule or_pos)
% 0.21/0.54  (step t39 (cl (not (not (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))) (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule not_not)
% 0.21/0.54  (step t40 (cl (not (= (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt)))))) (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))))) (not (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (exists ((Xt tptp.b)) (and (or (= Xt tptp.x) (= Xt tptp.y)) (= tptp.z (@ tptp.g Xt))))))) (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))))) :rule equiv_pos2)
% 0.21/0.54  (step t41 (cl (not (=> (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))) (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y)))))))) :rule resolution :premises (t40 t35 a0))
% 0.21/0.54  (step t42 (cl (not (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))) :rule not_implies2 :premises (t41))
% 0.21/0.54  (step t43 (cl (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule resolution :premises (t39 t42))
% 0.21/0.54  (step t44 (cl (not (= tptp.z (@ tptp.g tptp.x)))) :rule and :premises (t43))
% 0.21/0.54  (step t45 (cl (not (not (not (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))))) (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule not_not)
% 0.21/0.54  (step t46 (cl (and (not (= tptp.z (@ tptp.g tptp.x))) (not (= tptp.z (@ tptp.g tptp.y))))) :rule resolution :premises (t45 t42))
% 0.21/0.54  (step t47 (cl (not (= tptp.z (@ tptp.g tptp.y)))) :rule and :premises (t46))
% 0.21/0.54  (step t48 (cl (not (or (= tptp.z (@ tptp.g tptp.x)) (= tptp.z (@ tptp.g tptp.y))))) :rule resolution :premises (t38 t44 t47))
% 0.21/0.54  (step t49 (cl) :rule resolution :premises (t37 t48))
% 0.21/0.54  
% 0.21/0.54  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.oeg8I1ndOi/cvc5---1.0.5_7313.smt2
% 0.21/0.54  % cvc5---1.0.5 exiting
% 0.21/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------