TSTP Solution File: SEU693^2 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SEU693^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n027.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:41 EDT 2024

% Result   : Theorem 0.35s 0.52s
% Output   : Proof 0.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : SEU693^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 27 11:16:24 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TH0
% 0.35/0.52  --- Run --ho-elim --full-saturate-quant at 10...
% 0.35/0.52  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.xD5BzAN9hK/cvc5---1.0.5_19456.smt2
% 0.35/0.52  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.xD5BzAN9hK/cvc5---1.0.5_19456.smt2
% 0.35/0.52  (assume a0 (not (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))))))))
% 0.35/0.52  (assume a1 true)
% 0.35/0.52  (step t1 (cl (not (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))))))) false)) (not (not (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx)))))))) false) :rule equiv_pos2)
% 0.35/0.52  (anchor :step t2 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (Xf $$unsorted) (:= Xf Xf)))
% 0.35/0.52  (step t2.t1 (cl (= A A)) :rule refl)
% 0.35/0.52  (step t2.t2 (cl (= B B)) :rule refl)
% 0.35/0.52  (step t2.t3 (cl (= Xf Xf)) :rule refl)
% 0.35/0.52  (step t2.t4 (cl (= (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)))) :rule refl)
% 0.35/0.52  (anchor :step t2.t5 :args ((Xx $$unsorted) (:= Xx Xx)))
% 0.35/0.52  (step t2.t5.t1 (cl (= Xx Xx)) :rule refl)
% 0.35/0.52  (step t2.t5.t2 (cl (= (@ (@ tptp.in Xx) A) (@ (@ tptp.in Xx) A))) :rule refl)
% 0.35/0.52  (step t2.t5.t3 (cl (= (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx)) true)) :rule all_simplify)
% 0.35/0.52  (step t2.t5.t4 (cl (= (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))) (=> (@ (@ tptp.in Xx) A) true))) :rule cong :premises (t2.t5.t2 t2.t5.t3))
% 0.35/0.52  (step t2.t5.t5 (cl (= (=> (@ (@ tptp.in Xx) A) true) true)) :rule all_simplify)
% 0.35/0.52  (step t2.t5.t6 (cl (= (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))) true)) :rule trans :premises (t2.t5.t4 t2.t5.t5))
% 0.35/0.52  (step t2.t5 (cl (= (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx)))) (forall ((Xx $$unsorted)) true))) :rule bind)
% 0.35/0.52  (step t2.t6 (cl (= (forall ((Xx $$unsorted)) true) true)) :rule all_simplify)
% 0.35/0.52  (step t2.t7 (cl (= (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx)))) true)) :rule trans :premises (t2.t5 t2.t6))
% 0.35/0.52  (step t2.t8 (cl (= (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))))) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) true))) :rule cong :premises (t2.t4 t2.t7))
% 0.35/0.52  (step t2.t9 (cl (= (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) true) true)) :rule all_simplify)
% 0.35/0.52  (step t2.t10 (cl (= (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))))) true)) :rule trans :premises (t2.t8 t2.t9))
% 0.35/0.52  (step t2 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx)))))) (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) true))) :rule bind)
% 0.35/0.52  (step t3 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) true) true)) :rule all_simplify)
% 0.35/0.52  (step t4 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx)))))) true)) :rule trans :premises (t2 t3))
% 0.35/0.52  (step t5 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))))))) (not true))) :rule cong :premises (t4))
% 0.35/0.52  (step t6 (cl (= (not true) false)) :rule all_simplify)
% 0.35/0.52  (step t7 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf $$unsorted)) (=> (@ (@ tptp.in Xf) (@ (@ tptp.funcSet A) B)) (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (= (@ (@ (@ (@ tptp.ap A) B) Xf) Xx) (@ (@ (@ (@ tptp.ap A) B) Xf) Xx))))))) false)) :rule trans :premises (t5 t6))
% 0.35/0.52  (step t8 (cl false) :rule resolution :premises (t1 t7 a0))
% 0.35/0.52  (step t9 (cl (not false)) :rule false)
% 0.35/0.52  (step t10 (cl) :rule resolution :premises (t8 t9))
% 0.35/0.52  
% 0.35/0.52  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.xD5BzAN9hK/cvc5---1.0.5_19456.smt2
% 0.35/0.52  % cvc5---1.0.5 exiting
% 0.35/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------