↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n023.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:20:05 AM UTC 2026

% Result   : Unsatisfiable 0.35s 0.56s
% Output   : Proof 0.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP170-2 : TPTP v9.2.1. Bugfixed v1.2.1.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.33  % Computer : n023.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue Jun  2 00:55:13 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.26/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.26/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.35/0.56  % SZS status Unsatisfiable
% 0.35/0.56  % SZS output start Proof
% 0.35/0.56  (
% 0.35/0.56  (declare-sort $$unsorted 0)
% 0.35/0.56  (declare-const tptp.c $$unsorted)
% 0.35/0.56  (declare-const tptp.b $$unsorted)
% 0.35/0.56  (declare-const tptp.a $$unsorted)
% 0.35/0.56  (declare-const tptp.d $$unsorted)
% 0.35/0.56  (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted))
% 0.35/0.56  (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted))
% 0.35/0.56  (declare-const tptp.inverse (-> $$unsorted $$unsorted))
% 0.35/0.56  (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted))
% 0.35/0.56  (declare-const tptp.identity $$unsorted)
% 0.35/0.56  (define @t1 () (@var "X" $$unsorted))
% 0.35/0.56  (define @t2 () (@list @t1))
% 0.35/0.56  (define @t3 () (@var "Z" $$unsorted))
% 0.35/0.56  (define @t4 () (@var "Y" $$unsorted))
% 0.35/0.56  (define @t5 () (tptp.multiply @t1 @t4))
% 0.35/0.56  (define @t6 () (@list @t1 @t4 @t3))
% 0.35/0.56  (define @t7 () (tptp.greatest_lower_bound @t1 @t4))
% 0.35/0.56  (define @t8 () (@list @t1 @t4))
% 0.35/0.56  (define @t9 () (tptp.least_upper_bound @t1 @t4))
% 0.35/0.56  (define @t10 () (tptp.greatest_lower_bound @t4 @t3))
% 0.35/0.56  (define @t11 () (tptp.least_upper_bound @t4 @t3))
% 0.35/0.56  (define @t12 () (tptp.greatest_lower_bound @t1 @t1))
% 0.35/0.56  (define @t13 () (forall @t2 (= @t12 @t1)))
% 0.35/0.56  (define @t14 () (tptp.multiply @t1 @t3))
% 0.35/0.56  (define @t15 () (tptp.multiply @t3 @t1))
% 0.35/0.56  (define @t16 () (tptp.multiply @t4 @t1))
% 0.35/0.56  (define @t17 () (@list @t4 @t3 @t1))
% 0.35/0.56  (define @t18 () (tptp.greatest_lower_bound tptp.a tptp.b))
% 0.35/0.56  (define @t19 () (tptp.greatest_lower_bound tptp.c tptp.d))
% 0.35/0.56  (define @t20 () (tptp.multiply tptp.a tptp.c))
% 0.35/0.56  (define @t21 () (tptp.multiply tptp.b tptp.d))
% 0.35/0.56  (define @t22 () (tptp.greatest_lower_bound @t20 @t21))
% 0.35/0.56  (define @t23 () (tptp.multiply tptp.b tptp.c))
% 0.35/0.56  (define @t24 () (tptp.greatest_lower_bound tptp.d tptp.d))
% 0.35/0.56  (define @t25 () (= tptp.a @t18))
% 0.35/0.56  (define @t26 () (= tptp.c @t19))
% 0.35/0.56  (define @t27 () (tptp.greatest_lower_bound tptp.c @t24))
% 0.35/0.56  (define @t28 () (= @t27 (tptp.greatest_lower_bound @t19 tptp.d)))
% 0.35/0.56  (define @t29 () (tptp.greatest_lower_bound @t20 @t23))
% 0.35/0.56  (define @t30 () (tptp.multiply @t18 tptp.c))
% 0.35/0.56  (define @t31 () (= @t30 @t29))
% 0.35/0.56  (define @t32 () (tptp.greatest_lower_bound @t29 @t21))
% 0.35/0.56  (define @t33 () (= (tptp.greatest_lower_bound @t20 (tptp.greatest_lower_bound @t23 @t21)) @t32))
% 0.35/0.56  (define @t34 () (= tptp.d @t24))
% 0.35/0.56  (define @t35 () (tptp.multiply tptp.b @t24))
% 0.35/0.56  (define @t36 () (tptp.greatest_lower_bound @t23 @t35))
% 0.35/0.56  (define @t37 () (= (tptp.multiply tptp.b @t27) @t36))
% 0.35/0.56  (define @t38 () (= @t20 @t22))
% 0.35/0.56  (define @t39 () (and @t25 @t26 @t28 @t31 @t33 @t34 @t37))
% 0.35/0.56  (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1)))
% 0.35/0.56  (assume @p2 (forall @t2 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity)))
% 0.35/0.56  (assume @p3 (forall @t6 (= (tptp.multiply @t5 @t3) (tptp.multiply @t1 (tptp.multiply @t4 @t3)))))
% 0.35/0.56  (assume @p4 (forall @t8 (= @t7 (tptp.greatest_lower_bound @t4 @t1))))
% 0.35/0.56  (assume @p5 (forall @t8 (= @t9 (tptp.least_upper_bound @t4 @t1))))
% 0.35/0.56  (assume @p6 (forall @t6 (= (tptp.greatest_lower_bound @t1 @t10) (tptp.greatest_lower_bound @t7 @t3))))
% 0.35/0.56  (assume @p7 (forall @t6 (= (tptp.least_upper_bound @t1 @t11) (tptp.least_upper_bound @t9 @t3))))
% 0.35/0.56  (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1)))
% 0.35/0.56  (assume @p9 @t13)
% 0.35/0.56  (assume @p10 (forall @t8 (= (tptp.least_upper_bound @t1 @t7) @t1)))
% 0.35/0.56  (assume @p11 (forall @t8 (= (tptp.greatest_lower_bound @t1 @t9) @t1)))
% 0.35/0.56  (assume @p12 (forall @t6 (= (tptp.multiply @t1 @t11) (tptp.least_upper_bound @t5 @t14))))
% 0.35/0.56  (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t14))))
% 0.35/0.56  (assume @p14 (forall @t17 (= (tptp.multiply @t11 @t1) (tptp.least_upper_bound @t16 @t15))))
% 0.35/0.56  (assume @p15 (forall @t17 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t16 @t15))))
% 0.35/0.56  (assume @p16 (= @t18 tptp.a))
% 0.35/0.56  (assume @p17 (= @t19 tptp.c))
% 0.35/0.56  (assume @p18 (not (= @t22 @t20)))
% 0.35/0.56  (step @p19 :rule symm :premises (@p16))
% 0.35/0.56  (step @p20 :rule symm :premises (@p17))
% 0.35/0.56  (step @p21 :rule symm :premises (@p18))
% 0.35/0.56  (step @p22 :rule instantiate :premises (@p6) :args ((@list tptp.c tptp.d tptp.d)))
% 0.35/0.56  (step @p23 :rule instantiate :premises (@p15) :args ((@list tptp.a tptp.b tptp.c)))
% 0.35/0.56  (step @p24 :rule instantiate :premises (@p6) :args ((@list @t20 @t23 @t21)))
% 0.35/0.56  (step @p25 :rule eq-symm :args (@t12 @t1))
% 0.35/0.56  (step @p26 :rule cong :premises (@p25) :args (@t13))
% 0.35/0.56  (step @p27 :rule eq_resolve :premises (@p9 @p26))
% 0.35/0.56  (step @p28 :rule instantiate :premises (@p27) :args ((@list tptp.d)))
% 0.35/0.56  (step @p29 :rule instantiate :premises (@p13) :args ((@list tptp.b tptp.c @t24)))
% 0.35/0.56  (assume-push @p72 @t25)
% 0.35/0.56  (assume-push @p73 @t26)
% 0.35/0.56  (assume-push @p74 @t28)
% 0.35/0.56  (assume-push @p75 @t31)
% 0.35/0.56  (assume-push @p76 @t33)
% 0.35/0.56  (assume-push @p77 @t34)
% 0.35/0.56  (assume-push @p78 @t37)
% 0.35/0.56  (step @p37 :rule refl :args (@t21))
% 0.35/0.56  (step @p38 :rule refl :args (tptp.c))
% 0.35/0.56  (step @p39 :rule cong :premises (@p16 @p38) :args (@t30))
% 0.35/0.56  (step @p40 :rule symm :premises (@p23))
% 0.35/0.56  (step @p41 :rule trans :premises (@p40 @p39))
% 0.35/0.56  (step @p42 :rule cong :premises (@p41 @p37) :args (@t32))
% 0.35/0.56  (step @p43 :rule symm :premises (@p28))
% 0.35/0.56  (step @p44 :rule refl :args (tptp.b))
% 0.35/0.56  (step @p45 :rule cong :premises (@p44 @p43) :args (@t35))
% 0.35/0.56  (step @p46 :rule refl :args (@t23))
% 0.35/0.56  (step @p47 :rule cong :premises (@p46 @p45) :args (@t36))
% 0.35/0.56  (step @p48 :rule symm :premises (@p22))
% 0.35/0.56  (step @p49 :rule refl :args (tptp.d))
% 0.35/0.56  (step @p50 :rule cong :premises (@p20 @p49) :args (@t19))
% 0.35/0.56  (step @p51 :rule trans :premises (@p20 @p50 @p48))
% 0.35/0.56  (step @p52 :rule cong :premises (@p44 @p51) :args (@t23))
% 0.35/0.56  (step @p53 :rule trans :premises (@p52 @p29 @p47))
% 0.35/0.56  (step @p54 :rule cong :premises (@p41 @p53) :args ((tptp.greatest_lower_bound @t29 @t23)))
% 0.35/0.56  (step @p55 :rule symm :premises (@p41))
% 0.35/0.56  (step @p56 :rule cong :premises (@p55 @p46) :args (@t29))
% 0.35/0.56  (step @p57 :rule symm :premises (@p39))
% 0.35/0.56  (step @p58 :rule trans :premises (@p57 @p23 @p56 @p54 @p24 @p42))
% 0.35/0.56  (step-pop @p79 :rule scope :premises (@p58))
% 0.35/0.56  (step-pop @p80 :rule scope :premises (@p79))
% 0.35/0.56  (step-pop @p81 :rule scope :premises (@p80))
% 0.35/0.56  (step-pop @p82 :rule scope :premises (@p81))
% 0.35/0.56  (step-pop @p83 :rule scope :premises (@p82))
% 0.35/0.56  (step-pop @p84 :rule scope :premises (@p83))
% 0.35/0.56  (step-pop @p85 :rule scope :premises (@p84))
% 0.35/0.56  (step @p59 :rule process_scope :premises (@p85) :args (@t38))
% 0.35/0.56  (step @p67 :rule implies_elim :premises (@p59))
% 0.35/0.56  (step @p68 :rule cnf_and_neg :args (@t39))
% 0.35/0.56  (step @p69 :rule resolution :premises (@p68 @p67) :args (true @t39))
% 0.35/0.56  (step @p70 :rule reordering :premises (@p69) :args ((or @t38 (not @t25) (not @t26) (not @t28) (not @t31) (not @t33) (not @t34) (not @t37))))
% 0.35/0.56  (step @p71 false :rule chain_m_resolution :premises (@p70 @p29 @p28 @p24 @p23 @p22 @p21 @p20 @p19) :args (false (@list false false false false false true false false) (@list @t37 @t34 @t33 @t31 @t28 @t38 @t26 @t25)))
% 0.35/0.56  )
% 0.35/0.57  % SZS output end Proof
% 0.35/0.57  % cvc5 exiting
%------------------------------------------------------------------------------