↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : HEN008-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 : n017.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:53 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : HEN008-4 : TPTP v9.2.1. Released v1.0.0.
% 0.13/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.34  % Computer : n017.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Tue Jun  2 02:14:31 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.31/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.31/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.45/0.65  % SZS status Unsatisfiable
% 0.45/0.65  % SZS output start Proof
% 0.45/0.66  (
% 0.45/0.66  (declare-sort $$unsorted 0)
% 0.45/0.66  (declare-const tptp.c $$unsorted)
% 0.45/0.66  (declare-const tptp.b $$unsorted)
% 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 @t2 @t13))
% 0.45/0.66  (define @t15 () (@list @t2))
% 0.45/0.66  (define @t16 () (tptp.divide tptp.zero @t2))
% 0.45/0.66  (define @t17 () (forall @t15 (= @t16 tptp.zero)))
% 0.45/0.66  (define @t18 () (@list @t2 @t1 @t13))
% 0.45/0.66  (define @t19 () (tptp.less_equal tptp.a tptp.b))
% 0.45/0.66  (define @t20 () (tptp.divide tptp.b tptp.c))
% 0.45/0.66  (define @t21 () (tptp.divide tptp.a tptp.c))
% 0.45/0.66  (define @t22 () (tptp.less_equal @t21 @t20))
% 0.45/0.66  (define @t23 () (tptp.divide tptp.a tptp.b))
% 0.45/0.66  (define @t24 () (tptp.divide @t23 tptp.c))
% 0.45/0.66  (define @t25 () (tptp.divide @t21 @t20))
% 0.45/0.66  (define @t26 () (@list @t25 @t24))
% 0.45/0.66  (define @t27 () (= tptp.zero (tptp.divide @t25 @t24)))
% 0.45/0.66  (define @t28 () (tptp.less_equal @t25 @t24))
% 0.45/0.66  (define @t29 () (not @t28))
% 0.45/0.66  (define @t30 () (or @t29 @t27))
% 0.45/0.66  (define @t31 () (@list false false))
% 0.45/0.66  (define @t32 () (= tptp.zero @t23))
% 0.45/0.66  (define @t33 () (not @t19))
% 0.45/0.66  (define @t34 () (or @t33 @t32))
% 0.45/0.66  (define @t35 () (tptp.less_equal @t24 @t25))
% 0.45/0.66  (define @t36 () (= @t25 @t24))
% 0.45/0.66  (define @t37 () (= @t24 @t25))
% 0.45/0.66  (define @t38 () (not (= tptp.zero @t25)))
% 0.45/0.66  (define @t39 () (or @t38 @t22))
% 0.45/0.66  (define @t40 () (not @t35))
% 0.45/0.66  (define @t41 () (or @t29 @t40 @t36))
% 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 @t14 (tptp.divide @t1 @t13)) (tptp.divide @t3 @t13))))
% 0.45/0.66  (assume @p5 (forall @t15 (tptp.less_equal tptp.zero @t2)))
% 0.45/0.66  (assume @p6 (forall @t8 (or @t6 (not (tptp.less_equal @t1 @t2)) (= @t2 @t1))))
% 0.45/0.66  (assume @p7 (forall @t15 (tptp.less_equal @t2 tptp.identity)))
% 0.45/0.66  (assume @p8 (forall @t15 (= (tptp.divide @t2 tptp.identity) tptp.zero)))
% 0.45/0.66  (assume @p9 @t17)
% 0.45/0.66  (assume @p10 (forall @t15 (= (tptp.divide @t2 @t2) tptp.zero)))
% 0.45/0.66  (assume @p11 (= (tptp.divide tptp.a tptp.zero) tptp.a))
% 0.45/0.66  (assume @p12 (forall @t18 (or @t6 (not (tptp.less_equal @t1 @t13)) (tptp.less_equal @t2 @t13))))
% 0.45/0.66  (assume @p13 (forall @t18 (or (not (tptp.less_equal @t3 @t13)) (tptp.less_equal @t14 @t1))))
% 0.45/0.66  (assume @p14 (forall @t18 (or @t6 (tptp.less_equal (tptp.divide @t13 @t1) (tptp.divide @t13 @t2)))))
% 0.45/0.66  (assume @p15 @t19)
% 0.45/0.66  (assume @p16 (not @t22))
% 0.45/0.66  (step @p17 :rule evaluate :args ((= false true)))
% 0.45/0.66  (step @p18 :rule instantiate :premises (@p3) :args (@t26))
% 0.45/0.66  (step @p19 :rule true_intro :premises (@p18))
% 0.45/0.66  (step @p20 :rule refl :args (@t25))
% 0.45/0.66  (step @p21 :rule eq-symm :args (@t3 tptp.zero))
% 0.45/0.66  (step @p22 :rule refl :args (@t6))
% 0.45/0.66  (step @p23 :rule nary_cong :premises (@p22 @p21) :args (@t7))
% 0.45/0.66  (step @p24 :rule cong :premises (@p23) :args (@t9))
% 0.45/0.66  (step @p25 :rule eq_resolve :premises (@p1 @p24))
% 0.45/0.66  (step @p26 :rule instantiate :premises (@p25) :args (@t26))
% 0.45/0.66  (step @p27 :rule instantiate :premises (@p4) :args ((@list tptp.a tptp.c tptp.b)))
% 0.45/0.66  (step @p28 :rule cnf_or_pos :args (@t30))
% 0.45/0.66  (step @p29 :rule reordering :premises (@p28) :args ((or @t29 @t27 (not @t30))))
% 0.45/0.66  (step @p30 :rule chain_m_resolution :premises (@p29 @p27 @p26) :args (@t27 @t31 (@list @t28 @t30)))
% 0.45/0.66  (step @p31 :rule instantiate :premises (@p25) :args ((@list tptp.a tptp.b)))
% 0.45/0.66  (step @p32 :rule cnf_or_pos :args (@t34))
% 0.45/0.66  (step @p33 :rule reordering :premises (@p32) :args ((or @t33 @t32 (not @t34))))
% 0.45/0.66  (step @p34 :rule chain_m_resolution :premises (@p33 @p15 @p31) :args (@t32 @t31 (@list @t19 @t34)))
% 0.45/0.66  (step @p35 :rule symm :premises (@p34))
% 0.45/0.66  (step @p36 :rule trans :premises (@p35 @p30))
% 0.45/0.66  (step @p37 :rule eq-symm :args (@t16 tptp.zero))
% 0.45/0.66  (step @p38 :rule cong :premises (@p37) :args (@t17))
% 0.45/0.66  (step @p39 :rule eq_resolve :premises (@p9 @p38))
% 0.45/0.66  (step @p40 :rule instantiate :premises (@p39) :args ((@list tptp.c)))
% 0.45/0.66  (step @p41 :rule symm :premises (@p40))
% 0.45/0.66  (step @p42 :rule refl :args (tptp.c))
% 0.45/0.66  (step @p43 :rule cong :premises (@p35 @p42) :args (@t24))
% 0.45/0.66  (step @p44 :rule trans :premises (@p43 @p41 @p34))
% 0.45/0.66  (step @p45 :rule trans :premises (@p44 @p36))
% 0.45/0.66  (step @p46 :rule cong :premises (@p45 @p20) :args (@t35))
% 0.45/0.66  (step @p47 :rule instantiate :premises (@p6) :args (@t26))
% 0.45/0.66  (step @p48 :rule bool-eq-false :args (@t36))
% 0.45/0.66  (step @p49 :rule symm :premises (@p48))
% 0.45/0.66  (step @p50 :rule eq-symm :args (@t24 @t25))
% 0.45/0.66  (step @p51 :rule cong :premises (@p50) :args ((not @t37)))
% 0.45/0.66  (step @p52 :rule bool-eq-false :args (@t37))
% 0.45/0.66  (step @p53 :rule trans :premises (@p52 @p51))
% 0.45/0.66  (step @p54 :rule trans :premises (@p53 @p49))
% 0.45/0.66  (step @p55 :rule refl :args (@t5))
% 0.45/0.66  (step @p56 :rule cong :premises (@p21) :args (@t10))
% 0.45/0.66  (step @p57 :rule nary_cong :premises (@p56 @p55) :args (@t11))
% 0.45/0.66  (step @p58 :rule cong :premises (@p57) :args (@t12))
% 0.45/0.66  (step @p59 :rule eq_resolve :premises (@p2 @p58))
% 0.45/0.66  (step @p60 :rule instantiate :premises (@p59) :args ((@list @t21 @t20)))
% 0.45/0.66  (step @p61 :rule cnf_or_pos :args (@t39))
% 0.45/0.66  (step @p62 :rule reordering :premises (@p61) :args ((or @t22 @t38 (not @t39))))
% 0.45/0.66  (step @p63 :rule chain_m_resolution :premises (@p62 @p16 @p60) :args (@t38 (@list true false) (@list @t22 @t39)))
% 0.45/0.66  (step @p64 :rule false_intro :premises (@p63))
% 0.45/0.66  (step @p65 :rule trans :premises (@p43 @p41))
% 0.45/0.66  (step @p66 :rule cong :premises (@p65 @p20) :args (@t37))
% 0.45/0.66  (step @p67 :rule trans :premises (@p66 @p64))
% 0.45/0.66  (step @p68 :rule eq_resolve :premises (@p67 @p54))
% 0.45/0.66  (step @p69 :rule false_elim :premises (@p68))
% 0.45/0.66  (step @p70 :rule cnf_or_pos :args (@t41))
% 0.45/0.66  (step @p71 :rule reordering :premises (@p70) :args ((or @t29 @t40 @t36 (not @t41))))
% 0.45/0.66  (step @p72 :rule chain_m_resolution :premises (@p71 @p27 @p69 @p47) :args (@t40 (@list false true false) (@list @t28 @t36 @t41)))
% 0.45/0.66  (step @p73 :rule false_intro :premises (@p72))
% 0.45/0.66  (step @p74 :rule symm :premises (@p73))
% 0.45/0.66  (step @p75 :rule trans :premises (@p74 @p46 @p19))
% 0.45/0.66  (step @p76 false :rule eq_resolve :premises (@p75 @p17))
% 0.45/0.66  )
% 0.45/0.66  % SZS output end Proof
% 0.45/0.66  % cvc5 exiting
%------------------------------------------------------------------------------