↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : HEN010-4 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n026.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 08:22:55 AM UTC 2026

% Result   : Unsatisfiable 0.45s 0.66s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : HEN010-4 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n026.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue Jun  2 02:16:40 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.32/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.32/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.45/0.66  % SZS status Unsatisfiable
% 0.45/0.66  % SZS output start Proof
% 0.45/0.66  (
% 0.45/0.66  (declare-sort $$unsorted 0)
% 0.45/0.66  (declare-const tptp.a $$unsorted)
% 0.45/0.66  (declare-const tptp.less_equal (-> $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.identity $$unsorted)
% 0.45/0.66  (declare-const tptp.divide (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.zero $$unsorted)
% 0.45/0.66  (define @t1 () (@var "Y" $$unsorted))
% 0.45/0.66  (define @t2 () (@var "X" $$unsorted))
% 0.45/0.66  (define @t3 () (tptp.divide @t2 @t1))
% 0.45/0.66  (define @t4 () (= @t3 tptp.zero))
% 0.45/0.66  (define @t5 () (tptp.less_equal @t2 @t1))
% 0.45/0.66  (define @t6 () (not @t5))
% 0.45/0.66  (define @t7 () (or @t6 @t4))
% 0.45/0.66  (define @t8 () (@list @t2 @t1))
% 0.45/0.66  (define @t9 () (forall @t8 @t7))
% 0.45/0.66  (define @t10 () (not @t4))
% 0.45/0.66  (define @t11 () (or @t10 @t5))
% 0.45/0.66  (define @t12 () (forall @t8 @t11))
% 0.45/0.66  (define @t13 () (@var "Z" $$unsorted))
% 0.45/0.66  (define @t14 () (tptp.divide @t1 @t13))
% 0.45/0.66  (define @t15 () (tptp.divide @t2 @t13))
% 0.45/0.66  (define @t16 () (@list @t2))
% 0.45/0.66  (define @t17 () (forall @t8 (or @t6 (not (tptp.less_equal @t1 @t2)) (= @t2 @t1))))
% 0.45/0.66  (define @t18 () (tptp.divide tptp.zero @t2))
% 0.45/0.66  (define @t19 () (forall @t16 (= @t18 tptp.zero)))
% 0.45/0.66  (define @t20 () (tptp.divide @t2 @t2))
% 0.45/0.66  (define @t21 () (forall @t16 (= @t20 tptp.zero)))
% 0.45/0.66  (define @t22 () (tptp.divide tptp.a tptp.zero))
% 0.45/0.66  (define @t23 () (@list @t2 @t1 @t13))
% 0.45/0.66  (define @t24 () (tptp.divide tptp.identity @t2))
% 0.45/0.66  (define @t25 () (tptp.divide tptp.identity (tptp.divide tptp.identity @t24)))
% 0.45/0.66  (define @t26 () (forall @t16 (= @t25 @t24)))
% 0.45/0.66  (define @t27 () (tptp.divide tptp.identity tptp.a))
% 0.45/0.66  (define @t28 () (tptp.divide tptp.identity @t27))
% 0.45/0.66  (define @t29 () (tptp.divide @t27 @t28))
% 0.45/0.66  (define @t30 () (= @t27 @t29))
% 0.45/0.66  (define @t31 () (tptp.less_equal @t27 @t29))
% 0.45/0.66  (define @t32 () (not @t31))
% 0.45/0.66  (define @t33 () (tptp.less_equal @t29 @t27))
% 0.45/0.66  (define @t34 () (not @t33))
% 0.45/0.66  (define @t35 () (or @t34 @t32 (= @t29 @t27)))
% 0.45/0.66  (define @t36 () (or @t34 @t32 @t30))
% 0.45/0.66  (define @t37 () (= tptp.zero (tptp.divide @t27 @t29)))
% 0.45/0.66  (define @t38 () (not @t37))
% 0.45/0.66  (define @t39 () (or @t38 @t31))
% 0.45/0.66  (define @t40 () (tptp.divide @t28 @t28))
% 0.45/0.66  (define @t41 () (tptp.divide tptp.identity @t28))
% 0.45/0.66  (define @t42 () (tptp.divide @t41 @t29))
% 0.45/0.66  (define @t43 () (tptp.divide tptp.a @t28))
% 0.45/0.66  (define @t44 () (@list @t42 @t43))
% 0.45/0.66  (define @t45 () (tptp.less_equal @t42 @t43))
% 0.45/0.66  (define @t46 () (tptp.less_equal (tptp.divide @t41 @t43) @t29))
% 0.45/0.66  (define @t47 () (not @t46))
% 0.45/0.66  (define @t48 () (or @t47 @t45))
% 0.45/0.66  (define @t49 () (@list false false))
% 0.45/0.66  (define @t50 () (= tptp.zero (tptp.divide @t42 @t43)))
% 0.45/0.66  (define @t51 () (not @t45))
% 0.45/0.66  (define @t52 () (or @t51 @t50))
% 0.45/0.66  (define @t53 () (= tptp.zero (tptp.divide @t22 tptp.a)))
% 0.45/0.66  (define @t54 () (tptp.less_equal @t22 tptp.a))
% 0.45/0.66  (define @t55 () (not @t54))
% 0.45/0.66  (define @t56 () (or @t55 @t53))
% 0.45/0.66  (define @t57 () (tptp.divide @t22 tptp.zero))
% 0.45/0.66  (define @t58 () (tptp.less_equal @t40 @t42))
% 0.45/0.66  (define @t59 () (= @t42 @t40))
% 0.45/0.66  (define @t60 () (not @t58))
% 0.45/0.66  (define @t61 () (tptp.less_equal @t42 @t40))
% 0.45/0.66  (define @t62 () (not @t61))
% 0.45/0.66  (define @t63 () (or @t62 @t60 @t59))
% 0.45/0.66  (define @t64 () (not @t59))
% 0.45/0.66  (define @t65 () (= tptp.zero @t40))
% 0.45/0.66  (define @t66 () (not @t65))
% 0.45/0.66  (define @t67 () (= @t27 @t41))
% 0.45/0.66  (define @t68 () (not @t67))
% 0.45/0.66  (define @t69 () (= tptp.zero (tptp.divide tptp.zero tptp.zero)))
% 0.45/0.66  (define @t70 () (not @t69))
% 0.45/0.66  (define @t71 () (= tptp.zero @t42))
% 0.45/0.66  (define @t72 () (not @t71))
% 0.45/0.66  (define @t73 () (and @t69 @t65 @t59 @t72))
% 0.45/0.66  (assume @p1 @t9)
% 0.45/0.66  (assume @p2 @t12)
% 0.45/0.66  (assume @p3 (forall @t8 (tptp.less_equal @t3 @t2)))
% 0.45/0.66  (assume @p4 (forall (@list @t2 @t13 @t1) (tptp.less_equal (tptp.divide @t15 @t14) (tptp.divide @t3 @t13))))
% 0.45/0.66  (assume @p5 (forall @t16 (tptp.less_equal tptp.zero @t2)))
% 0.45/0.66  (assume @p6 @t17)
% 0.45/0.66  (assume @p7 (forall @t16 (tptp.less_equal @t2 tptp.identity)))
% 0.45/0.66  (assume @p8 (forall @t16 (= (tptp.divide @t2 tptp.identity) tptp.zero)))
% 0.45/0.66  (assume @p9 @t19)
% 0.45/0.66  (assume @p10 @t21)
% 0.45/0.66  (assume @p11 (= @t22 tptp.a))
% 0.45/0.66  (assume @p12 (forall @t23 (or @t6 (not (tptp.less_equal @t1 @t13)) (tptp.less_equal @t2 @t13))))
% 0.45/0.66  (assume @p13 (forall @t23 (or (not (tptp.less_equal @t3 @t13)) (tptp.less_equal @t15 @t1))))
% 0.45/0.66  (assume @p14 (forall @t23 (or @t6 (tptp.less_equal (tptp.divide @t13 @t1) (tptp.divide @t13 @t2)))))
% 0.45/0.66  (assume @p15 (forall @t23 (or @t6 (tptp.less_equal @t15 @t14))))
% 0.45/0.66  (assume @p16 @t26)
% 0.45/0.66  (assume @p17 (not @t30))
% 0.45/0.66  (step @p18 :rule eq-symm :args (@t18 tptp.zero))
% 0.45/0.66  (step @p19 :rule cong :premises (@p18) :args (@t19))
% 0.45/0.66  (step @p20 :rule eq_resolve :premises (@p9 @p19))
% 0.45/0.66  (step @p21 :rule instantiate :premises (@p20) :args ((@list tptp.zero)))
% 0.45/0.66  (step @p22 :rule eq-symm :args (@t25 @t24))
% 0.45/0.66  (step @p23 :rule cong :premises (@p22) :args (@t26))
% 0.45/0.66  (step @p24 :rule eq_resolve :premises (@p16 @p23))
% 0.45/0.66  (step @p25 :rule instantiate :premises (@p24) :args ((@list tptp.a)))
% 0.45/0.66  (step @p26 :rule refl :args (@t5))
% 0.45/0.66  (step @p27 :rule eq-symm :args (@t3 tptp.zero))
% 0.45/0.66  (step @p28 :rule cong :premises (@p27) :args (@t10))
% 0.45/0.66  (step @p29 :rule nary_cong :premises (@p28 @p26) :args (@t11))
% 0.45/0.66  (step @p30 :rule cong :premises (@p29) :args (@t12))
% 0.45/0.66  (step @p31 :rule eq_resolve :premises (@p2 @p30))
% 0.45/0.66  (step @p32 :rule instantiate :premises (@p31) :args ((@list @t27 @t29)))
% 0.45/0.66  (step @p33 :rule eq-symm :args (@t29 @t27))
% 0.45/0.66  (step @p34 :rule refl :args (@t32))
% 0.45/0.66  (step @p35 :rule refl :args (@t34))
% 0.45/0.66  (step @p36 :rule nary_cong :premises (@p35 @p34 @p33) :args (@t35))
% 0.45/0.66  (step @p37 :rule refl :args (@t17))
% 0.45/0.66  (step @p38 :rule cong :premises (@p37 @p36) :args ((=> @t17 @t35)))
% 0.45/0.66  (assume-push @p145 @t17)
% 0.45/0.66  (step @p40 :rule instantiate :premises (@p6) :args ((@list @t29 @t27)))
% 0.45/0.66  (step-pop @p146 :rule scope :premises (@p40))
% 0.45/0.66  (step @p41 :rule process_scope :premises (@p146) :args (@t35))
% 0.45/0.66  (step @p43 :rule eq_resolve :premises (@p41 @p38))
% 0.45/0.66  (step @p44 :rule implies_elim :premises (@p43))
% 0.45/0.66  (step @p45 :rule chain_m_resolution :premises (@p44 @p6) :args (@t36 (@list false) (@list @t17)))
% 0.45/0.66  (step @p46 :rule instantiate :premises (@p3) :args ((@list @t27 @t28)))
% 0.45/0.66  (step @p47 :rule cnf_or_pos :args (@t36))
% 0.45/0.66  (step @p48 :rule reordering :premises (@p47) :args ((or @t30 @t34 @t32 (not @t36))))
% 0.45/0.66  (step @p49 :rule chain_m_resolution :premises (@p48 @p17 @p46 @p45) :args (@t32 (@list true false false) (@list @t30 @t33 @t36)))
% 0.45/0.66  (step @p50 :rule cnf_or_pos :args (@t39))
% 0.45/0.66  (step @p51 :rule reordering :premises (@p50) :args ((or @t31 @t38 (not @t39))))
% 0.45/0.66  (step @p52 :rule chain_m_resolution :premises (@p51 @p49 @p32) :args (@t38 (@list true false) (@list @t31 @t39)))
% 0.45/0.66  (step @p53 :rule eq-symm :args (@t20 tptp.zero))
% 0.45/0.66  (step @p54 :rule cong :premises (@p53) :args (@t21))
% 0.45/0.66  (step @p55 :rule eq_resolve :premises (@p10 @p54))
% 0.45/0.66  (step @p56 :rule instantiate :premises (@p55) :args ((@list @t28)))
% 0.45/0.66  (step @p57 :rule instantiate :premises (@p6) :args ((@list @t42 @t40)))
% 0.45/0.66  (step @p58 :rule instantiate :premises (@p3) :args (@t44))
% 0.45/0.66  (step @p59 :rule true_intro :premises (@p58))
% 0.45/0.66  (step @p60 :rule refl :args (@t42))
% 0.45/0.66  (step @p61 :rule refl :args (@t6))
% 0.45/0.66  (step @p62 :rule nary_cong :premises (@p61 @p27) :args (@t7))
% 0.45/0.66  (step @p63 :rule cong :premises (@p62) :args (@t9))
% 0.45/0.66  (step @p64 :rule eq_resolve :premises (@p1 @p63))
% 0.45/0.66  (step @p65 :rule instantiate :premises (@p64) :args (@t44))
% 0.45/0.66  (step @p66 :rule instantiate :premises (@p13) :args ((@list @t41 @t43 @t29)))
% 0.45/0.66  (step @p67 :rule instantiate :premises (@p4) :args ((@list tptp.identity @t28 tptp.a)))
% 0.45/0.66  (step @p68 :rule cnf_or_pos :args (@t48))
% 0.45/0.66  (step @p69 :rule reordering :premises (@p68) :args ((or @t47 @t45 (not @t48))))
% 0.45/0.66  (step @p70 :rule chain_m_resolution :premises (@p69 @p67 @p66) :args (@t45 @t49 (@list @t46 @t48)))
% 0.45/0.66  (step @p71 :rule cnf_or_pos :args (@t52))
% 0.45/0.66  (step @p72 :rule reordering :premises (@p71) :args ((or @t51 @t50 (not @t52))))
% 0.45/0.66  (step @p73 :rule chain_m_resolution :premises (@p72 @p70 @p65) :args (@t50 @t49 (@list @t45 @t52)))
% 0.45/0.66  (step @p74 :rule instantiate :premises (@p64) :args ((@list @t22 tptp.a)))
% 0.45/0.66  (step @p75 :rule instantiate :premises (@p3) :args ((@list tptp.a tptp.zero)))
% 0.45/0.66  (step @p76 :rule cnf_or_pos :args (@t56))
% 0.45/0.66  (step @p77 :rule reordering :premises (@p76) :args ((or @t55 @t53 (not @t56))))
% 0.45/0.66  (step @p78 :rule chain_m_resolution :premises (@p77 @p75 @p74) :args (@t53 @t49 (@list @t54 @t56)))
% 0.45/0.66  (step @p79 :rule symm :premises (@p78))
% 0.45/0.66  (step @p80 :rule refl :args (tptp.zero))
% 0.45/0.66  (step @p81 :rule cong :premises (@p11 @p80) :args (@t57))
% 0.45/0.66  (step @p82 :rule trans :premises (@p81 @p11))
% 0.45/0.66  (step @p83 :rule refl :args (@t22))
% 0.45/0.66  (step @p84 :rule cong :premises (@p83 @p82) :args ((tptp.divide @t22 @t57)))
% 0.45/0.66  (step @p85 :rule trans :premises (@p84 @p79 @p73))
% 0.45/0.66  (step @p86 :rule symm :premises (@p84))
% 0.45/0.66  (step @p87 :rule symm :premises (@p56))
% 0.45/0.66  (step @p88 :rule trans :premises (@p87 @p78 @p86))
% 0.45/0.66  (step @p89 :rule trans :premises (@p88 @p85))
% 0.45/0.66  (step @p90 :rule cong :premises (@p89 @p60) :args (@t58))
% 0.45/0.66  (step @p91 :rule trans :premises (@p90 @p59))
% 0.45/0.66  (step @p92 :rule true_elim :premises (@p91))
% 0.45/0.66  (step @p93 :rule instantiate :premises (@p4) :args ((@list tptp.identity @t28 @t27)))
% 0.45/0.66  (step @p94 :rule cnf_or_pos :args (@t63))
% 0.45/0.66  (step @p95 :rule reordering :premises (@p94) :args ((or @t62 @t60 @t59 (not @t63))))
% 0.45/0.66  (step @p96 :rule chain_m_resolution :premises (@p95 @p93 @p92 @p57) :args (@t59 (@list false false false) (@list @t61 @t58 @t63)))
% 0.45/0.66  (step @p97 :rule refl :args (@t64))
% 0.45/0.66  (step @p98 :rule refl :args (@t66))
% 0.45/0.66  (step @p99 :rule bool-double-not-elim :args (@t37))
% 0.45/0.66  (step @p100 :rule refl :args (@t68))
% 0.45/0.66  (step @p101 :rule refl :args (@t70))
% 0.45/0.66  (step @p102 :rule nary_cong :premises (@p101 @p100 @p99 @p98 @p97) :args ((or @t70 @t68 (not @t38) @t66 @t64)))
% 0.45/0.66  (assume-push @p147 @t69)
% 0.45/0.66  (assume-push @p148 @t65)
% 0.45/0.66  (assume-push @p149 @t59)
% 0.45/0.66  (assume-push @p150 @t72)
% 0.45/0.66  (step @p107 :rule evaluate :args ((= false true)))
% 0.45/0.66  (step @p108 :rule trans :premises (@p96 @p87 @p21))
% 0.45/0.66  (step @p109 :rule symm :premises (@p108))
% 0.45/0.66  (step @p110 :rule trans :premises (@p21 @p109))
% 0.45/0.66  (step @p111 :rule true_intro :premises (@p110))
% 0.45/0.66  (step @p112 :rule false_intro :premises (@p52))
% 0.45/0.66  (step @p113 :rule refl :args (@t29))
% 0.45/0.66  (step @p114 :rule symm :premises (@p25))
% 0.45/0.66  (step @p115 :rule cong :premises (@p114 @p113) :args (@t42))
% 0.45/0.66  (step @p116 :rule cong :premises (@p80 @p115) :args (@t71))
% 0.45/0.66  (step @p117 :rule trans :premises (@p116 @p112))
% 0.45/0.66  (step @p118 :rule symm :premises (@p117))
% 0.45/0.66  (step @p119 :rule trans :premises (@p118 @p111))
% 0.45/0.66  (step @p120 false :rule eq_resolve :premises (@p119 @p107))
% 0.45/0.66  (step-pop @p151 :rule scope :premises (@p120))
% 0.45/0.66  (step-pop @p152 :rule scope :premises (@p151))
% 0.45/0.66  (step-pop @p153 :rule scope :premises (@p152))
% 0.45/0.66  (step-pop @p154 :rule scope :premises (@p153))
% 0.45/0.66  (step @p121 :rule process_scope :premises (@p154) :args (false))
% 0.45/0.66  (assume-push @p155 @t69)
% 0.45/0.66  (assume-push @p156 @t67)
% 0.45/0.66  (assume-push @p157 @t38)
% 0.45/0.66  (assume-push @p158 @t65)
% 0.45/0.66  (assume-push @p159 @t59)
% 0.45/0.66  (step @p112 :rule false_intro :premises (@p52))
% 0.45/0.66  (step @p113 :rule refl :args (@t29))
% 0.45/0.66  (step @p114 :rule symm :premises (@p25))
% 0.45/0.66  (step @p115 :rule cong :premises (@p114 @p113) :args (@t42))
% 0.45/0.66  (step @p116 :rule cong :premises (@p80 @p115) :args (@t71))
% 0.45/0.66  (step @p131 :rule trans :premises (@p116 @p112))
% 0.45/0.66  (step @p132 :rule false_elim :premises (@p131))
% 0.45/0.66  (step @p133 :rule and_intro :premises (@p21 @p56 @p96 @p132))
% 0.45/0.66  (step-pop @p160 :rule scope :premises (@p133))
% 0.45/0.66  (step-pop @p161 :rule scope :premises (@p160))
% 0.45/0.66  (step-pop @p162 :rule scope :premises (@p161))
% 0.45/0.66  (step-pop @p163 :rule scope :premises (@p162))
% 0.45/0.66  (step-pop @p164 :rule scope :premises (@p163))
% 0.45/0.66  (step @p134 :rule process_scope :premises (@p164) :args (@t73))
% 0.45/0.66  (step @p140 :rule implies_elim :premises (@p134))
% 0.45/0.66  (step @p141 :rule resolution :premises (@p140 @p121) :args (true @t73))
% 0.45/0.66  (step @p142 :rule not_and :premises (@p141))
% 0.45/0.66  (step @p143 :rule eq_resolve :premises (@p142 @p102))
% 0.45/0.66  (step @p144 false :rule chain_m_resolution :premises (@p143 @p96 @p56 @p52 @p25 @p21) :args (false (@list false false true false false) (@list @t59 @t65 @t37 @t67 @t69)))
% 0.45/0.66  )
% 0.45/0.67  % SZS output end Proof
% 0.45/0.67  % cvc5 exiting
%------------------------------------------------------------------------------