↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SYO092^5 : TPTP v9.2.1. Released v4.0.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:12:01 AM UTC 2026

% Result   : Theorem 0.40s 0.57s
% Output   : Proof 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYO092^5 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.14  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.35  % Computer : n010.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Tue Jun  2 23:58:25 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.29/0.50  %----Proving TH0
% 0.40/0.57  --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s...
% 0.40/0.57  % SZS status Theorem
% 0.40/0.57  % SZS output start Proof
% 0.40/0.57  (
% 0.40/0.57  (declare-sort $$unsorted 0)
% 0.40/0.57  (declare-const tptp.cP (-> $$unsorted Bool))
% 0.40/0.57  (declare-const tptp.cQ (-> $$unsorted Bool))
% 0.40/0.57  (define @t1 () (@var "Xz" $$unsorted))
% 0.40/0.57  (define @t2 () (_ tptp.cQ @t1))
% 0.40/0.57  (define @t3 () (_ tptp.cP @t1))
% 0.40/0.57  (define @t4 () (and @t3 @t2))
% 0.40/0.57  (define @t5 () (@list @t1))
% 0.40/0.57  (define @t6 () (exists @t5 @t4))
% 0.40/0.57  (define @t7 () (@var "Xx" $$unsorted))
% 0.40/0.57  (define @t8 () (_ tptp.cQ @t7))
% 0.40/0.57  (define @t9 () (@var "Xy" $$unsorted))
% 0.40/0.57  (define @t10 () (_ tptp.cQ @t9))
% 0.40/0.57  (define @t11 () (or @t10 @t8))
% 0.40/0.57  (define @t12 () (_ tptp.cP @t7))
% 0.40/0.57  (define @t13 () (and @t12 @t11))
% 0.40/0.57  (define @t14 () (@list @t9))
% 0.40/0.57  (define @t15 () (exists @t14 @t13))
% 0.40/0.57  (define @t16 () (@list @t7))
% 0.40/0.57  (define @t17 () (forall @t16 @t15))
% 0.40/0.57  (define @t18 () (=> @t17 @t6))
% 0.40/0.57  (define @t19 () (not @t18))
% 0.40/0.57  (define @t20 () (tptp.cQ @t1))
% 0.40/0.57  (define @t21 () (not @t2))
% 0.40/0.57  (define @t22 () (tptp.cP @t1))
% 0.40/0.57  (define @t23 () (not @t3))
% 0.40/0.57  (define @t24 () (or @t23 @t21))
% 0.40/0.57  (define @t25 () (forall @t5 (not @t4)))
% 0.40/0.57  (define @t26 () (not @t25))
% 0.40/0.57  (define @t27 () (@var "BOUND_VARIABLE_7466" $$unsorted))
% 0.40/0.57  (define @t28 () (tptp.cQ @t27))
% 0.40/0.57  (define @t29 () (_ tptp.cQ @t27))
% 0.40/0.57  (define @t30 () (@list @t27))
% 0.40/0.57  (define @t31 () (forall @t30 @t29))
% 0.40/0.57  (define @t32 () (@var "BOUND_VARIABLE_7440" $$unsorted))
% 0.40/0.57  (define @t33 () (tptp.cQ @t32))
% 0.40/0.57  (define @t34 () (@list @t32))
% 0.40/0.57  (define @t35 () (forall @t34 (not @t33)))
% 0.40/0.57  (define @t36 () (not @t35))
% 0.40/0.57  (define @t37 () (or @t36 @t31))
% 0.40/0.57  (define @t38 () (forall @t30 (or @t36 @t29)))
% 0.40/0.57  (define @t39 () (@var "BOUND_VARIABLE_7461" $$unsorted))
% 0.40/0.57  (define @t40 () (tptp.cP @t39))
% 0.40/0.57  (define @t41 () (_ tptp.cP @t39))
% 0.40/0.57  (define @t42 () (forall (@list @t39) @t41))
% 0.40/0.57  (define @t43 () (or @t36 @t8))
% 0.40/0.57  (define @t44 () (forall @t16 @t43))
% 0.40/0.57  (define @t45 () (@list @t7))
% 0.40/0.57  (define @t46 () (forall @t16 @t12))
% 0.40/0.57  (define @t47 () (and @t46 @t44))
% 0.40/0.57  (define @t48 () (not @t8))
% 0.40/0.57  (define @t49 () (and @t35 @t48))
% 0.40/0.57  (define @t50 () (not @t49))
% 0.40/0.57  (define @t51 () (not @t12))
% 0.40/0.57  (define @t52 () (_ tptp.cQ @t32))
% 0.40/0.57  (define @t53 () (not @t52))
% 0.40/0.57  (define @t54 () (forall @t34 @t53))
% 0.40/0.57  (define @t55 () (forall @t14 @t48))
% 0.40/0.57  (define @t56 () (not @t10))
% 0.40/0.57  (define @t57 () (forall @t14 @t56))
% 0.40/0.57  (define @t58 () (and @t57 @t55))
% 0.40/0.57  (define @t59 () (and @t56 @t48))
% 0.40/0.57  (define @t60 () (forall @t14 @t59))
% 0.40/0.57  (define @t61 () (or @t51 @t60))
% 0.40/0.57  (define @t62 () (forall @t14 (not @t13)))
% 0.40/0.57  (define @t63 () (not @t62))
% 0.40/0.57  (define @t64 () (@quantifiers_skolemize @t35 0))
% 0.40/0.57  (define @t65 () (@list @t64))
% 0.40/0.57  (define @t66 () (tptp.cQ @t64))
% 0.40/0.57  (define @t67 () (not @t66))
% 0.40/0.57  (define @t68 () (tptp.cP @t64))
% 0.40/0.57  (define @t69 () (not @t68))
% 0.40/0.57  (define @t70 () (or @t69 @t67))
% 0.40/0.57  (define @t71 () (not @t67))
% 0.40/0.57  (define @t72 () (forall @t30 @t28))
% 0.40/0.57  (assume @p1 @t19)
% 0.40/0.57  (assume @p2 true)
% 0.40/0.57  (step @p3 :rule refl :args (@t20))
% 0.40/0.57  (step @p4 :rule refl :args (@t2))
% 0.40/0.57  (step @p5 :rule cong :premises (@p4 @p3) :args ((= @t2 @t20)))
% 0.40/0.57  (step @p6 :rule symm :premises (@p5))
% 0.40/0.57  (step @p7 :rule eq_resolve :premises (@p4 @p6))
% 0.40/0.57  (step @p8 :rule cong :premises (@p7) :args (@t21))
% 0.40/0.57  (step @p9 :rule refl :args (@t22))
% 0.40/0.57  (step @p10 :rule refl :args (@t3))
% 0.40/0.57  (step @p11 :rule cong :premises (@p10 @p9) :args ((= @t3 @t22)))
% 0.40/0.57  (step @p12 :rule symm :premises (@p11))
% 0.40/0.57  (step @p13 :rule eq_resolve :premises (@p10 @p12))
% 0.40/0.57  (step @p14 :rule cong :premises (@p13) :args (@t23))
% 0.40/0.57  (step @p15 :rule nary_cong :premises (@p14 @p8) :args (@t24))
% 0.40/0.57  (step @p16 :rule cong :premises (@p15) :args ((forall @t5 @t24)))
% 0.40/0.57  (step @p17 :rule bool-and-de-morgan :args (@t3 @t2 true))
% 0.40/0.57  (step @p18 :rule cong :premises (@p17) :args (@t25))
% 0.40/0.57  (step @p19 :rule trans :premises (@p18 @p16))
% 0.40/0.57  (step @p20 :rule cong :premises (@p19) :args (@t26))
% 0.40/0.57  (step @p21 :rule exists-elim :args ((= @t6 @t26)))
% 0.40/0.57  (step @p22 :rule trans :premises (@p21 @p20))
% 0.40/0.57  (step @p23 :rule refl :args (@t28))
% 0.40/0.57  (step @p24 :rule refl :args (@t29))
% 0.40/0.57  (step @p25 :rule cong :premises (@p24 @p23) :args ((= @t29 @t28)))
% 0.40/0.57  (step @p26 :rule symm :premises (@p25))
% 0.40/0.57  (step @p27 :rule eq_resolve :premises (@p24 @p26))
% 0.40/0.57  (step @p28 :rule cong :premises (@p27) :args (@t31))
% 0.40/0.57  (step @p29 :rule refl :args (@t36))
% 0.40/0.57  (step @p30 :rule nary_cong :premises (@p29 @p28) :args (@t37))
% 0.40/0.57  (step @p31 :rule quant-miniscope-or :args ((= @t38 @t37)))
% 0.40/0.57  (step @p32 :rule trans :premises (@p31 @p30))
% 0.40/0.57  (step @p33 :rule refl :args (@t40))
% 0.40/0.57  (step @p34 :rule refl :args (@t41))
% 0.40/0.57  (step @p35 :rule cong :premises (@p34 @p33) :args ((= @t41 @t40)))
% 0.40/0.57  (step @p36 :rule symm :premises (@p35))
% 0.40/0.57  (step @p37 :rule eq_resolve :premises (@p34 @p36))
% 0.40/0.57  (step @p38 :rule cong :premises (@p37) :args (@t42))
% 0.40/0.57  (step @p39 :rule nary_cong :premises (@p38 @p32) :args ((and @t42 @t38)))
% 0.40/0.57  (step @p40 :rule alpha_equiv :args (@t44 @t45 (@list @t27)))
% 0.40/0.57  (step @p41 :rule alpha_equiv :args (@t46 @t45 (@list @t39)))
% 0.40/0.57  (step @p42 :rule nary_cong :premises (@p41 @p40) :args (@t47))
% 0.40/0.57  (step @p43 :rule quant-miniscope-and :args ((= (forall @t16 (and @t12 @t43)) @t47)))
% 0.40/0.57  (step @p44 :rule trans :premises (@p43 @p42))
% 0.40/0.57  (step @p45 :rule trans :premises (@p44 @p39))
% 0.40/0.57  (step @p46 :rule bool-double-not-elim :args (@t8))
% 0.40/0.57  (step @p47 :rule refl :args (@t36))
% 0.40/0.57  (step @p48 :rule nary_cong :premises (@p47 @p46) :args ((or @t36 (not @t48))))
% 0.40/0.57  (step @p49 :rule bool-and-de-morgan :args (@t35 @t48 true))
% 0.40/0.57  (step @p50 :rule trans :premises (@p49 @p48))
% 0.40/0.57  (step @p51 :rule refl :args (@t12))
% 0.40/0.57  (step @p52 :rule nary_cong :premises (@p51 @p50) :args ((and @t12 @t50)))
% 0.40/0.57  (step @p53 :rule refl :args (@t50))
% 0.40/0.57  (step @p54 :rule bool-double-not-elim :args (@t12))
% 0.40/0.57  (step @p55 :rule nary_cong :premises (@p54 @p53) :args ((and (not @t51) @t50)))
% 0.40/0.57  (step @p56 :rule bool-or-de-morgan :args (@t51 @t49 false))
% 0.40/0.57  (step @p57 :rule trans :premises (@p56 @p55))
% 0.40/0.57  (step @p58 :rule trans :premises (@p57 @p52))
% 0.40/0.57  (step @p59 :rule cong :premises (@p58) :args ((forall @t16 (not (or @t51 @t49)))))
% 0.40/0.57  (step @p60 :rule trans :premises (@p59 @p45))
% 0.40/0.57  (step @p61 :rule refl :args (@t48))
% 0.40/0.57  (step @p62 :rule refl :args (@t33))
% 0.40/0.57  (step @p63 :rule refl :args (@t52))
% 0.40/0.57  (step @p64 :rule cong :premises (@p63 @p62) :args ((= @t52 @t33)))
% 0.40/0.57  (step @p65 :rule symm :premises (@p64))
% 0.40/0.57  (step @p66 :rule eq_resolve :premises (@p63 @p65))
% 0.40/0.57  (step @p67 :rule cong :premises (@p66) :args (@t53))
% 0.40/0.57  (step @p68 :rule cong :premises (@p67) :args (@t54))
% 0.40/0.57  (step @p69 :rule nary_cong :premises (@p68 @p61) :args ((and @t54 @t48)))
% 0.40/0.57  (step @p70 :rule quant-unused-vars :args ((= @t55 @t48)))
% 0.40/0.57  (step @p71 :rule alpha_equiv :args (@t57 (@list @t9) (@list @t32)))
% 0.40/0.57  (step @p72 :rule nary_cong :premises (@p71 @p70) :args (@t58))
% 0.40/0.57  (step @p73 :rule quant-miniscope-and :args ((= @t60 @t58)))
% 0.40/0.57  (step @p74 :rule trans :premises (@p73 @p72))
% 0.40/0.57  (step @p75 :rule trans :premises (@p74 @p69))
% 0.40/0.57  (step @p76 :rule refl :args (@t51))
% 0.40/0.57  (step @p77 :rule nary_cong :premises (@p76 @p75) :args (@t61))
% 0.40/0.57  (step @p78 :rule quant-miniscope-or :args ((= (forall @t14 (or @t51 @t59)) @t61)))
% 0.40/0.57  (step @p79 :rule trans :premises (@p78 @p77))
% 0.40/0.57  (step @p80 :rule bool-or-de-morgan :args (@t10 @t8 false))
% 0.40/0.57  (step @p81 :rule refl :args (@t51))
% 0.40/0.57  (step @p82 :rule nary_cong :premises (@p81 @p80) :args ((or @t51 (not @t11))))
% 0.40/0.57  (step @p83 :rule bool-and-de-morgan :args (@t12 @t11 true))
% 0.40/0.57  (step @p84 :rule trans :premises (@p83 @p82))
% 0.40/0.57  (step @p85 :rule cong :premises (@p84) :args (@t62))
% 0.40/0.57  (step @p86 :rule trans :premises (@p85 @p79))
% 0.40/0.57  (step @p87 :rule cong :premises (@p86) :args (@t63))
% 0.40/0.57  (step @p88 :rule exists-elim :args ((= @t15 @t63)))
% 0.40/0.57  (step @p89 :rule trans :premises (@p88 @p87))
% 0.40/0.57  (step @p90 :rule cong :premises (@p89) :args (@t17))
% 0.40/0.57  (step @p91 :rule trans :premises (@p90 @p60))
% 0.40/0.57  (step @p92 :rule cong :premises (@p91 @p22) :args (@t18))
% 0.40/0.57  (step @p93 :rule cong :premises (@p92) :args (@t19))
% 0.40/0.57  (step @p94 :rule eq_resolve :premises (@p1 @p93))
% 0.40/0.57  (step @p95 :rule not_implies_elim2 :premises (@p94))
% 0.40/0.57  (step @p96 :rule not_not_elim :premises (@p95))
% 0.40/0.57  (step @p97 :rule instantiate :premises (@p96) :args (@t65))
% 0.40/0.57  (step @p98 :rule not_implies_elim1 :premises (@p94))
% 0.40/0.57  (step @p99 :rule and_elim :premises (@p98) :args (0))
% 0.40/0.57  (step @p100 :rule instantiate :premises (@p99) :args (@t65))
% 0.40/0.57  (step @p101 :rule cnf_or_pos :args (@t70))
% 0.40/0.57  (step @p102 :rule reordering :premises (@p101) :args ((or @t67 @t69 (not @t70))))
% 0.40/0.57  (step @p103 :rule chain_m_resolution :premises (@p102 @p100 @p97) :args (@t67 (@list false false) (@list @t68 @t70)))
% 0.40/0.57  (step @p104 :rule refl :args (@t66))
% 0.40/0.57  (step @p105 :rule bool-double-not-elim :args (@t35))
% 0.40/0.57  (step @p106 :rule nary_cong :premises (@p105 @p104) :args ((or (not @t36) @t66)))
% 0.40/0.57  (step @p107 :rule bool-double-not-elim :args (@t66))
% 0.40/0.57  (step @p108 :rule cong :premises (@p29 @p107) :args ((=> @t36 @t71)))
% 0.40/0.57  (assume-push @p125 @t36)
% 0.40/0.57  (step @p110 :rule skolemize :premises (@p125))
% 0.40/0.57  (step-pop @p126 :rule scope :premises (@p110))
% 0.40/0.57  (step @p111 :rule process_scope :premises (@p126) :args (@t71))
% 0.40/0.57  (step @p113 :rule eq_resolve :premises (@p111 @p108))
% 0.40/0.57  (step @p114 :rule implies_elim :premises (@p113))
% 0.40/0.57  (step @p115 :rule eq_resolve :premises (@p114 @p106))
% 0.40/0.57  (step @p116 :rule chain_m_resolution :premises (@p115 @p103) :args (@t35 (@list true) (@list @t66)))
% 0.40/0.57  (step @p117 :rule and_elim :premises (@p98) :args (1))
% 0.40/0.57  (step @p118 :rule chain_m_resolution :premises (@p117 @p116) :args (@t72 (@list false) (@list @t35)))
% 0.40/0.57  (assume-push @p127 @t72)
% 0.40/0.57  (step @p120 :rule instantiate :premises (@p127) :args (@t65))
% 0.40/0.57  (step-pop @p128 :rule scope :premises (@p120))
% 0.40/0.57  (step @p121 :rule process_scope :premises (@p128) :args (@t66))
% 0.40/0.57  (step @p123 :rule implies_elim :premises (@p121))
% 0.40/0.57  (step @p124 false :rule chain_m_resolution :premises (@p123 @p118 @p103) :args (false (@list false true) (@list @t72 @t66)))
% 0.40/0.57  )
% 0.40/0.57  % SZS output end Proof
% 0.40/0.57  % cvc5 exiting
%------------------------------------------------------------------------------