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

View Problem - Process Solution

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

% Computer : n002.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:30:17 EDT 2024

% Result   : Theorem 0.14s 0.42s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SYO087^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.10  % Command    : do_cvc5 %s %d
% 0.09/0.30  % Computer : n002.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Tue May 28 07:26:54 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.14/0.40  %----Proving TH0
% 0.14/0.42  --- Run --ho-elim --full-saturate-quant at 10...
% 0.14/0.42  % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.mpznTKVHEE/cvc5---1.0.5_27009.smt2
% 0.14/0.42  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.mpznTKVHEE/cvc5---1.0.5_27009.smt2
% 0.14/0.42  (assume a0 (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))))
% 0.14/0.42  (assume a1 true)
% 0.14/0.42  (step t1 (cl (not (= (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) (not (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule equiv_pos2)
% 0.14/0.42  (step t2 (cl (= (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))) (not (forall ((Xx $$unsorted)) (not (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))))))) :rule all_simplify)
% 0.14/0.42  (step t3 (cl (= (forall ((Xx $$unsorted)) (not (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (forall ((Xx $$unsorted)) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))))) :rule all_simplify)
% 0.14/0.42  (step t4 (cl (= (forall ((Xx $$unsorted)) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) :rule all_simplify)
% 0.14/0.42  (step t5 (cl (= (forall ((Xx $$unsorted)) (not (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) :rule trans :premises (t3 t4))
% 0.14/0.42  (step t6 (cl (= (not (forall ((Xx $$unsorted)) (not (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))))) (not (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))))) :rule cong :premises (t5))
% 0.14/0.42  (step t7 (cl (= (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))) (not (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))))) :rule trans :premises (t2 t6))
% 0.14/0.42  (step t8 (cl (= (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (not (not (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))))) :rule cong :premises (t7))
% 0.14/0.42  (step t9 (cl (= (not (not (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) :rule all_simplify)
% 0.14/0.42  (step t10 (cl (= (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) :rule trans :premises (t8 t9))
% 0.14/0.42  (step t11 (cl (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule resolution :premises (t1 t10 a0))
% 0.14/0.42  (step t12 (cl (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) :rule and :premises (t11))
% 0.14/0.42  (step t13 (cl (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) :rule or :premises (t12))
% 0.14/0.42  (step t14 (cl (not (and (not tptp.cQ) tptp.cR)) tptp.cR) :rule and_pos)
% 0.14/0.42  (step t15 (cl (not (= (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) (not (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule equiv_pos2)
% 0.14/0.42  (step t16 (cl (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule resolution :premises (t15 t10 a0))
% 0.14/0.42  (step t17 (cl (not tptp.cR)) :rule and :premises (t16))
% 0.14/0.42  (step t18 (cl (not (and (not tptp.cQ) tptp.cR))) :rule resolution :premises (t14 t17))
% 0.14/0.42  (step t19 (cl (and tptp.cQ (not tptp.cR))) :rule resolution :premises (t13 t18))
% 0.14/0.42  (step t20 (cl tptp.cQ) :rule and :premises (t19))
% 0.14/0.42  (step t21 (cl (not (= (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) (not (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule equiv_pos2)
% 0.14/0.42  (step t22 (cl (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule resolution :premises (t21 t10 a0))
% 0.14/0.42  (step t23 (cl (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ)))) :rule and :premises (t22))
% 0.14/0.42  (step t24 (cl (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) :rule or :premises (t23))
% 0.14/0.42  (step t25 (cl (not (and tptp.cP tptp.cQ)) tptp.cP) :rule and_pos)
% 0.14/0.42  (step t26 (cl (not (= (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR)))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR)))) (not (not (exists ((Xx $$unsorted)) (=> (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR))) (=> (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) tptp.cR))))) (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule equiv_pos2)
% 0.14/0.42  (step t27 (cl (and (not tptp.cP) (or (and tptp.cQ (not tptp.cR)) (and (not tptp.cQ) tptp.cR)) (or (and tptp.cP tptp.cQ) (and (not tptp.cP) (not tptp.cQ))) (not tptp.cR))) :rule resolution :premises (t26 t10 a0))
% 0.14/0.42  (step t28 (cl (not tptp.cP)) :rule and :premises (t27))
% 0.14/0.42  (step t29 (cl (not (and tptp.cP tptp.cQ))) :rule resolution :premises (t25 t28))
% 0.14/0.42  (step t30 (cl (and (not tptp.cP) (not tptp.cQ))) :rule resolution :premises (t24 t29))
% 0.14/0.42  (step t31 (cl (not tptp.cQ)) :rule and :premises (t30))
% 0.14/0.42  (step t32 (cl) :rule resolution :premises (t20 t31))
% 0.14/0.42  
% 0.14/0.42  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.mpznTKVHEE/cvc5---1.0.5_27009.smt2
% 0.14/0.42  % cvc5---1.0.5 exiting
% 0.14/0.43  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------