%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN732+1 : TPTP v9.2.1. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n010.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 Jun 3 09:09:45 AM UTC 2026 % Result : Theorem 0.31s 0.55s % Output : Proof 0.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN732+1 : TPTP v9.2.1. Released v2.5.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n010.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 23:34:10 EDT 2026 % 0.17/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.31/0.55 % SZS status Theorem % 0.31/0.55 % SZS output start Proof % 0.31/0.55 ( % 0.31/0.55 (declare-sort $$unsorted 0) % 0.31/0.55 (declare-const tptp.p (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.q (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (define @t1 () (@var "Z" $$unsorted)) % 0.31/0.55 (define @t2 () (@var "W" $$unsorted)) % 0.31/0.55 (define @t3 () (tptp.q @t2 @t1)) % 0.31/0.55 (define @t4 () (tptp.p @t1 @t2)) % 0.31/0.55 (define @t5 () (or @t4 @t3)) % 0.31/0.55 (define @t6 () (@list @t2)) % 0.31/0.55 (define @t7 () (exists @t6 @t5)) % 0.31/0.55 (define @t8 () (@var "V" $$unsorted)) % 0.31/0.55 (define @t9 () (tptp.p @t8 @t1)) % 0.31/0.55 (define @t10 () (@list @t8)) % 0.31/0.55 (define @t11 () (exists @t10 @t9)) % 0.31/0.55 (define @t12 () (=> @t11 @t7)) % 0.31/0.55 (define @t13 () (@list @t1)) % 0.31/0.55 (define @t14 () (exists @t13 @t12)) % 0.31/0.55 (define @t15 () (@var "Y" $$unsorted)) % 0.31/0.55 (define @t16 () (@var "U" $$unsorted)) % 0.31/0.55 (define @t17 () (forall (@list @t16) (tptp.q @t16 @t15))) % 0.31/0.55 (define @t18 () (@var "X" $$unsorted)) % 0.31/0.55 (define @t19 () (forall (@list @t18) (tptp.p @t18 @t15))) % 0.31/0.55 (define @t20 () (@list @t15)) % 0.31/0.55 (define @t21 () (forall @t20 (=> @t19 @t17))) % 0.31/0.55 (define @t22 () (=> @t21 @t14)) % 0.31/0.55 (define @t23 () (not @t22)) % 0.31/0.55 (define @t24 () (@var "BOUND_VARIABLE_7493" $$unsorted)) % 0.31/0.55 (define @t25 () (@var "BOUND_VARIABLE_7463" $$unsorted)) % 0.31/0.55 (define @t26 () (not (tptp.q @t25 @t24))) % 0.31/0.55 (define @t27 () (@list @t25)) % 0.31/0.55 (define @t28 () (forall (@list @t24) (forall @t27 @t26))) % 0.31/0.55 (define @t29 () (@var "BOUND_VARIABLE_7457" $$unsorted)) % 0.31/0.55 (define @t30 () (@var "BOUND_VARIABLE_7486" $$unsorted)) % 0.31/0.55 (define @t31 () (not (tptp.p @t30 @t29))) % 0.31/0.55 (define @t32 () (forall (@list @t30 @t29) @t31)) % 0.31/0.55 (define @t33 () (@list @t29)) % 0.31/0.55 (define @t34 () (forall (@list @t30) (forall @t33 @t31))) % 0.31/0.55 (define @t35 () (@var "BOUND_VARIABLE_7478" $$unsorted)) % 0.31/0.55 (define @t36 () (forall (@list @t35) (not (forall @t10 (not (tptp.p @t8 @t35)))))) % 0.31/0.55 (define @t37 () (forall @t27 (not (tptp.q @t25 @t1)))) % 0.31/0.55 (define @t38 () (forall @t13 @t37)) % 0.31/0.55 (define @t39 () (@list @t1)) % 0.31/0.55 (define @t40 () (forall @t33 (not (tptp.p @t1 @t29)))) % 0.31/0.55 (define @t41 () (forall @t13 @t40)) % 0.31/0.55 (define @t42 () (not (forall @t10 (not @t9)))) % 0.31/0.55 (define @t43 () (forall @t13 @t42)) % 0.31/0.55 (define @t44 () (and @t43 @t41 @t38)) % 0.31/0.55 (define @t45 () (and @t42 @t40 @t37)) % 0.31/0.55 (define @t46 () (and @t40 @t37)) % 0.31/0.55 (define @t47 () (not @t46)) % 0.31/0.55 (define @t48 () (=> @t42 @t47)) % 0.31/0.55 (define @t49 () (forall @t13 (not @t48))) % 0.31/0.55 (define @t50 () (not @t49)) % 0.31/0.55 (define @t51 () (not @t3)) % 0.31/0.55 (define @t52 () (forall @t6 @t51)) % 0.31/0.55 (define @t53 () (@list @t2)) % 0.31/0.55 (define @t54 () (not @t4)) % 0.31/0.55 (define @t55 () (forall @t6 @t54)) % 0.31/0.55 (define @t56 () (and @t55 @t52)) % 0.31/0.55 (define @t57 () (forall @t6 (not @t5))) % 0.31/0.55 (define @t58 () (not @t57)) % 0.31/0.55 (define @t59 () (@var "BOUND_VARIABLE_7441" $$unsorted)) % 0.31/0.55 (define @t60 () (tptp.q @t59 @t15)) % 0.31/0.55 (define @t61 () (not @t19)) % 0.31/0.55 (define @t62 () (or @t61 @t60)) % 0.31/0.55 (define @t63 () (@list @t59)) % 0.31/0.55 (define @t64 () (forall @t63 @t62)) % 0.31/0.55 (define @t65 () (forall @t63 @t60)) % 0.31/0.55 (define @t66 () (or @t61 @t65)) % 0.31/0.55 (define @t67 () (@const 0 $$unsorted)) % 0.31/0.55 (define @t68 () (forall @t10 (not (tptp.p @t8 @t67)))) % 0.31/0.55 (define @t69 () (@quantifiers_skolemize @t68 0)) % 0.31/0.55 (define @t70 () (tptp.p @t69 @t67)) % 0.31/0.55 (define @t71 () (not @t68)) % 0.31/0.55 (define @t72 () (not @t70)) % 0.31/0.55 (define @t73 () (not @t72)) % 0.31/0.55 (assume @p1 @t23) % 0.31/0.55 (assume @p2 true) % 0.31/0.55 (step @p3 :rule quant-merge-prenex :args ((= @t28 (forall (@list @t24 @t25) @t26)))) % 0.31/0.55 (step @p4 :rule quant-merge-prenex :args ((= @t34 @t32))) % 0.31/0.55 (step @p5 :rule refl :args (@t36)) % 0.31/0.55 (step @p6 :rule nary_cong :premises (@p5 @p4 @p3) :args ((and @t36 @t34 @t28))) % 0.31/0.55 (step @p7 :rule alpha_equiv :args (@t38 @t39 (@list @t24))) % 0.31/0.55 (step @p8 :rule alpha_equiv :args (@t41 @t39 (@list @t30))) % 0.31/0.55 (step @p9 :rule alpha_equiv :args (@t43 @t39 (@list @t35))) % 0.31/0.55 (step @p10 :rule nary_cong :premises (@p9 @p8 @p7) :args (@t44)) % 0.31/0.55 (step @p11 :rule quant-miniscope-and :args ((= (forall @t13 @t45) @t44))) % 0.31/0.55 (step @p12 :rule trans :premises (@p11 @p10)) % 0.31/0.55 (step @p13 :rule trans :premises (@p12 @p6)) % 0.31/0.55 (step @p14 :rule aci_norm :args ((= (and @t42 @t46) @t45))) % 0.31/0.55 (step @p15 :rule bool-double-not-elim :args (@t46)) % 0.31/0.55 (step @p16 :rule refl :args (@t42)) % 0.31/0.55 (step @p17 :rule nary_cong :premises (@p16 @p15) :args ((and @t42 (not @t47)))) % 0.31/0.55 (step @p18 :rule bool-implies-de-morgan :args (@t42 @t47)) % 0.31/0.55 (step @p19 :rule trans :premises (@p18 @p17)) % 0.31/0.55 (step @p20 :rule trans :premises (@p19 @p14)) % 0.31/0.55 (step @p21 :rule cong :premises (@p20) :args (@t49)) % 0.31/0.55 (step @p22 :rule trans :premises (@p21 @p13)) % 0.31/0.55 (step @p23 :rule cong :premises (@p22) :args (@t50)) % 0.31/0.55 (step @p24 :rule exists-elim :args ((= (exists @t13 @t48) @t50))) % 0.31/0.55 (step @p25 :rule trans :premises (@p24 @p23)) % 0.31/0.55 (step @p26 :rule alpha_equiv :args (@t52 @t53 (@list @t25))) % 0.31/0.55 (step @p27 :rule alpha_equiv :args (@t55 @t53 (@list @t29))) % 0.31/0.55 (step @p28 :rule nary_cong :premises (@p27 @p26) :args (@t56)) % 0.31/0.55 (step @p29 :rule quant-miniscope-and :args ((= (forall @t6 (and @t54 @t51)) @t56))) % 0.31/0.55 (step @p30 :rule trans :premises (@p29 @p28)) % 0.31/0.55 (step @p31 :rule bool-or-de-morgan :args (@t4 @t3 false)) % 0.31/0.55 (step @p32 :rule cong :premises (@p31) :args (@t57)) % 0.31/0.55 (step @p33 :rule trans :premises (@p32 @p30)) % 0.31/0.55 (step @p34 :rule cong :premises (@p33) :args (@t58)) % 0.31/0.55 (step @p35 :rule exists-elim :args ((= @t7 @t58))) % 0.31/0.55 (step @p36 :rule trans :premises (@p35 @p34)) % 0.31/0.55 (step @p37 :rule exists-elim :args ((= @t11 @t42))) % 0.31/0.55 (step @p38 :rule cong :premises (@p37 @p36) :args (@t12)) % 0.31/0.55 (step @p39 :rule cong :premises (@p38) :args (@t14)) % 0.31/0.55 (step @p40 :rule trans :premises (@p39 @p25)) % 0.31/0.55 (step @p41 :rule quant-merge-prenex :args ((= (forall @t20 @t64) (forall (@list @t15 @t59) @t62)))) % 0.31/0.55 (step @p42 :rule alpha_equiv :args (@t65 (@list @t59) (@list @t16))) % 0.31/0.55 (step @p43 :rule refl :args (@t61)) % 0.31/0.55 (step @p44 :rule nary_cong :premises (@p43 @p42) :args (@t66)) % 0.31/0.55 (step @p45 :rule quant-miniscope-or :args ((= @t64 @t66))) % 0.31/0.55 (step @p46 :rule trans :premises (@p45 @p44)) % 0.31/0.55 (step @p47 :rule symm :premises (@p46)) % 0.31/0.55 (step @p48 :rule cong :premises (@p47) :args ((forall @t20 (or @t61 @t17)))) % 0.31/0.55 (step @p49 :rule trans :premises (@p48 @p41)) % 0.31/0.55 (step @p50 :rule bool-impl-elim :args (@t19 @t17)) % 0.31/0.55 (step @p51 :rule cong :premises (@p50) :args (@t21)) % 0.31/0.55 (step @p52 :rule trans :premises (@p51 @p49)) % 0.31/0.55 (step @p53 :rule cong :premises (@p52 @p40) :args (@t22)) % 0.31/0.55 (step @p54 :rule cong :premises (@p53) :args (@t23)) % 0.31/0.55 (step @p55 :rule eq_resolve :premises (@p1 @p54)) % 0.31/0.55 (step @p56 :rule not_implies_elim2 :premises (@p55)) % 0.31/0.55 (step @p57 :rule not_not_elim :premises (@p56)) % 0.31/0.55 (step @p58 :rule and_elim :premises (@p57) :args (1)) % 0.31/0.55 (step @p59 :rule and_elim :premises (@p57) :args (0)) % 0.31/0.55 (step @p60 :rule instantiate :premises (@p59) :args ((@list @t67))) % 0.31/0.55 (step @p61 :rule refl :args (@t70)) % 0.31/0.55 (step @p62 :rule bool-double-not-elim :args (@t68)) % 0.31/0.55 (step @p63 :rule nary_cong :premises (@p62 @p61) :args ((or (not @t71) @t70))) % 0.31/0.55 (step @p64 :rule bool-double-not-elim :args (@t70)) % 0.31/0.55 (step @p65 :rule refl :args (@t71)) % 0.31/0.55 (step @p66 :rule cong :premises (@p65 @p64) :args ((=> @t71 @t73))) % 0.31/0.55 (assume-push @p81 @t71) % 0.31/0.55 (step @p68 :rule skolemize :premises (@p60)) % 0.31/0.55 (step-pop @p82 :rule scope :premises (@p68)) % 0.31/0.55 (step @p69 :rule process_scope :premises (@p82) :args (@t73)) % 0.31/0.55 (step @p71 :rule eq_resolve :premises (@p69 @p66)) % 0.31/0.55 (step @p72 :rule implies_elim :premises (@p71)) % 0.31/0.55 (step @p73 :rule eq_resolve :premises (@p72 @p63)) % 0.31/0.55 (step @p74 :rule chain_m_resolution :premises (@p73 @p60) :args (@t70 (@list true) (@list @t68))) % 0.31/0.55 (assume-push @p83 @t32) % 0.31/0.55 (step @p76 :rule instantiate :premises (@p58) :args ((@list @t69 @t67))) % 0.31/0.55 (step-pop @p84 :rule scope :premises (@p76)) % 0.31/0.55 (step @p77 :rule process_scope :premises (@p84) :args (@t72)) % 0.31/0.55 (step @p79 :rule implies_elim :premises (@p77)) % 0.31/0.55 (step @p80 false :rule chain_m_resolution :premises (@p79 @p74 @p58) :args (false (@list false false) (@list @t70 @t32))) % 0.31/0.55 ) % 0.31/0.55 % SZS output end Proof % 0.31/0.55 % cvc5 exiting %------------------------------------------------------------------------------