%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP147-1 : 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 : 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:20:01 AM UTC 2026 % Result : Unsatisfiable 0.36s 0.60s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP147-1 : TPTP v9.2.1. Bugfixed v1.2.1. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n017.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 00:52:46 EDT 2026 % 0.18/0.35 % CPUTime : % 0.27/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.27/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.60 % SZS status Unsatisfiable % 0.36/0.60 % SZS output start Proof % 0.36/0.61 ( % 0.36/0.61 (declare-sort $$unsorted 0) % 0.36/0.61 (declare-const tptp.b $$unsorted) % 0.36/0.61 (declare-const tptp.c $$unsorted) % 0.36/0.61 (declare-const tptp.a $$unsorted) % 0.36/0.61 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.identity $$unsorted) % 0.36/0.61 (define @t1 () (@var "X" $$unsorted)) % 0.36/0.61 (define @t2 () (@list @t1)) % 0.36/0.61 (define @t3 () (@var "Z" $$unsorted)) % 0.36/0.61 (define @t4 () (@var "Y" $$unsorted)) % 0.36/0.61 (define @t5 () (tptp.multiply @t1 @t4)) % 0.36/0.61 (define @t6 () (@list @t1 @t4 @t3)) % 0.36/0.61 (define @t7 () (tptp.greatest_lower_bound @t1 @t4)) % 0.36/0.61 (define @t8 () (@list @t1 @t4)) % 0.36/0.61 (define @t9 () (tptp.least_upper_bound @t1 @t4)) % 0.36/0.61 (define @t10 () (tptp.greatest_lower_bound @t4 @t3)) % 0.36/0.61 (define @t11 () (tptp.least_upper_bound @t4 @t3)) % 0.36/0.61 (define @t12 () (tptp.greatest_lower_bound @t1 @t1)) % 0.36/0.61 (define @t13 () (forall @t2 (= @t12 @t1))) % 0.36/0.61 (define @t14 () (tptp.least_upper_bound @t1 @t7)) % 0.36/0.61 (define @t15 () (forall @t8 (= @t14 @t1))) % 0.36/0.61 (define @t16 () (tptp.greatest_lower_bound @t1 @t9)) % 0.36/0.61 (define @t17 () (forall @t8 (= @t16 @t1))) % 0.36/0.61 (define @t18 () (tptp.multiply @t1 @t3)) % 0.36/0.61 (define @t19 () (tptp.multiply @t3 @t1)) % 0.36/0.61 (define @t20 () (tptp.multiply @t4 @t1)) % 0.36/0.61 (define @t21 () (@list @t4 @t3 @t1)) % 0.36/0.61 (define @t22 () (tptp.greatest_lower_bound tptp.a tptp.c)) % 0.36/0.61 (define @t23 () (tptp.greatest_lower_bound tptp.b tptp.c)) % 0.36/0.61 (define @t24 () (tptp.least_upper_bound tptp.a tptp.b)) % 0.36/0.61 (define @t25 () (tptp.greatest_lower_bound @t24 tptp.c)) % 0.36/0.61 (define @t26 () (tptp.least_upper_bound tptp.b tptp.a)) % 0.36/0.61 (define @t27 () (tptp.greatest_lower_bound @t26 tptp.c)) % 0.36/0.61 (define @t28 () (tptp.least_upper_bound @t27 (tptp.greatest_lower_bound @t27 tptp.b))) % 0.36/0.61 (define @t29 () (= @t27 @t28)) % 0.36/0.61 (define @t30 () (= @t28 @t27)) % 0.36/0.61 (define @t31 () (@list tptp.a tptp.b)) % 0.36/0.61 (define @t32 () (tptp.greatest_lower_bound tptp.c tptp.c)) % 0.36/0.61 (define @t33 () (forall @t8 (= @t1 @t14))) % 0.36/0.61 (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1))) % 0.36/0.61 (assume @p2 (forall @t2 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 0.36/0.61 (assume @p3 (forall @t6 (= (tptp.multiply @t5 @t3) (tptp.multiply @t1 (tptp.multiply @t4 @t3))))) % 0.36/0.61 (assume @p4 (forall @t8 (= @t7 (tptp.greatest_lower_bound @t4 @t1)))) % 0.36/0.61 (assume @p5 (forall @t8 (= @t9 (tptp.least_upper_bound @t4 @t1)))) % 0.36/0.61 (assume @p6 (forall @t6 (= (tptp.greatest_lower_bound @t1 @t10) (tptp.greatest_lower_bound @t7 @t3)))) % 0.36/0.61 (assume @p7 (forall @t6 (= (tptp.least_upper_bound @t1 @t11) (tptp.least_upper_bound @t9 @t3)))) % 0.36/0.61 (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 0.36/0.61 (assume @p9 @t13) % 0.36/0.61 (assume @p10 @t15) % 0.36/0.61 (assume @p11 @t17) % 0.36/0.61 (assume @p12 (forall @t6 (= (tptp.multiply @t1 @t11) (tptp.least_upper_bound @t5 @t18)))) % 0.36/0.61 (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t18)))) % 0.36/0.61 (assume @p14 (forall @t21 (= (tptp.multiply @t11 @t1) (tptp.least_upper_bound @t20 @t19)))) % 0.36/0.61 (assume @p15 (forall @t21 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t20 @t19)))) % 0.36/0.61 (assume @p16 (= @t22 tptp.a)) % 0.36/0.61 (assume @p17 (= @t23 tptp.b)) % 0.36/0.61 (assume @p18 (not (= @t25 @t24))) % 0.36/0.61 (step @p19 :rule eq-symm :args (@t14 @t1)) % 0.36/0.61 (step @p20 :rule cong :premises (@p19) :args (@t15)) % 0.36/0.61 (step @p21 :rule eq_resolve :premises (@p10 @p20)) % 0.36/0.61 (step @p22 :rule bool-eq-false :args (@t29)) % 0.36/0.61 (step @p23 :rule symm :premises (@p22)) % 0.36/0.61 (step @p24 :rule eq-symm :args (@t28 @t27)) % 0.36/0.61 (step @p25 :rule cong :premises (@p24) :args ((not @t30))) % 0.36/0.61 (step @p26 :rule bool-eq-false :args (@t30)) % 0.36/0.61 (step @p27 :rule trans :premises (@p26 @p25)) % 0.36/0.61 (step @p28 :rule trans :premises (@p27 @p23)) % 0.36/0.61 (step @p29 :rule symm :premises (@p18)) % 0.36/0.61 (step @p30 :rule false_intro :premises (@p29)) % 0.36/0.61 (step @p31 :rule refl :args (tptp.c)) % 0.36/0.61 (step @p32 :rule instantiate :premises (@p5) :args (@t31)) % 0.36/0.61 (step @p33 :rule symm :premises (@p32)) % 0.36/0.61 (step @p34 :rule cong :premises (@p33 @p31) :args (@t27)) % 0.36/0.61 (step @p35 :rule instantiate :premises (@p21) :args ((@list @t24 tptp.c))) % 0.36/0.61 (step @p36 :rule symm :premises (@p35)) % 0.36/0.61 (step @p37 :rule instantiate :premises (@p5) :args ((@list @t24 @t25))) % 0.36/0.61 (step @p38 :rule symm :premises (@p37)) % 0.36/0.61 (step @p39 :rule instantiate :premises (@p7) :args ((@list @t25 tptp.a tptp.b))) % 0.36/0.61 (step @p40 :rule symm :premises (@p39)) % 0.36/0.61 (step @p41 :rule instantiate :premises (@p5) :args ((@list (tptp.least_upper_bound @t25 tptp.a) tptp.b))) % 0.36/0.61 (step @p42 :rule symm :premises (@p41)) % 0.36/0.61 (step @p43 :rule cong :premises (@p16 @p31) :args ((tptp.greatest_lower_bound @t22 tptp.c))) % 0.36/0.61 (step @p44 :rule symm :premises (@p16)) % 0.36/0.61 (step @p45 :rule eq-symm :args (@t16 @t1)) % 0.36/0.61 (step @p46 :rule cong :premises (@p45) :args (@t17)) % 0.36/0.61 (step @p47 :rule eq_resolve :premises (@p11 @p46)) % 0.36/0.61 (step @p48 :rule instantiate :premises (@p47) :args (@t31)) % 0.36/0.61 (step @p49 :rule symm :premises (@p48)) % 0.36/0.61 (step @p50 :rule trans :premises (@p49 @p44)) % 0.36/0.61 (step @p51 :rule cong :premises (@p50 @p31) :args ((tptp.greatest_lower_bound (tptp.greatest_lower_bound tptp.a @t24) tptp.c))) % 0.36/0.61 (step @p52 :rule instantiate :premises (@p6) :args ((@list tptp.a @t24 tptp.c))) % 0.36/0.61 (step @p53 :rule instantiate :premises (@p4) :args ((@list tptp.a @t25))) % 0.36/0.61 (step @p54 :rule symm :premises (@p53)) % 0.36/0.61 (step @p55 :rule trans :premises (@p54 @p52 @p51 @p43 @p16)) % 0.36/0.61 (step @p56 :rule refl :args (@t25)) % 0.36/0.61 (step @p57 :rule cong :premises (@p56 @p55) :args ((tptp.least_upper_bound @t25 (tptp.greatest_lower_bound @t25 tptp.a)))) % 0.36/0.61 (step @p58 :rule instantiate :premises (@p21) :args ((@list @t25 tptp.a))) % 0.36/0.61 (step @p59 :rule trans :premises (@p58 @p57)) % 0.36/0.61 (step @p60 :rule refl :args (tptp.b)) % 0.36/0.61 (step @p61 :rule cong :premises (@p60 @p59) :args ((tptp.least_upper_bound tptp.b @t25))) % 0.36/0.61 (step @p62 :rule instantiate :premises (@p5) :args ((@list tptp.b @t25))) % 0.36/0.61 (step @p63 :rule symm :premises (@p62)) % 0.36/0.61 (step @p64 :rule cong :premises (@p17 @p31) :args ((tptp.greatest_lower_bound @t23 tptp.c))) % 0.36/0.61 (step @p65 :rule instantiate :premises (@p6) :args ((@list tptp.b tptp.c tptp.c))) % 0.36/0.61 (step @p66 :rule refl :args (@t32)) % 0.36/0.61 (step @p67 :rule trans :premises (@p65 @p64 @p17)) % 0.36/0.61 (step @p68 :rule cong :premises (@p67 @p66) :args ((tptp.greatest_lower_bound (tptp.greatest_lower_bound tptp.b @t32) @t32))) % 0.36/0.61 (step @p69 :rule instantiate :premises (@p6) :args ((@list tptp.b @t32 @t32))) % 0.36/0.61 (step @p70 :rule eq-symm :args (@t12 @t1)) % 0.36/0.61 (step @p71 :rule cong :premises (@p70) :args (@t13)) % 0.36/0.61 (step @p72 :rule eq_resolve :premises (@p9 @p71)) % 0.36/0.61 (step @p73 :rule instantiate :premises (@p72) :args ((@list tptp.c))) % 0.36/0.61 (step @p74 :rule cong :premises (@p73 @p73) :args (@t32)) % 0.36/0.61 (step @p75 :rule trans :premises (@p73 @p74)) % 0.36/0.61 (step @p76 :rule instantiate :premises (@p47) :args ((@list tptp.b tptp.a))) % 0.36/0.61 (step @p77 :rule symm :premises (@p76)) % 0.36/0.61 (step @p78 :rule cong :premises (@p77 @p75) :args ((tptp.greatest_lower_bound (tptp.greatest_lower_bound tptp.b @t26) tptp.c))) % 0.36/0.61 (step @p79 :rule instantiate :premises (@p6) :args ((@list tptp.b @t26 tptp.c))) % 0.36/0.61 (step @p80 :rule instantiate :premises (@p4) :args ((@list tptp.b @t27))) % 0.36/0.61 (step @p81 :rule symm :premises (@p80)) % 0.36/0.61 (step @p82 :rule trans :premises (@p81 @p79 @p78 @p69 @p68 @p65 @p64 @p17)) % 0.36/0.61 (step @p83 :rule cong :premises (@p34 @p82) :args (@t28)) % 0.36/0.61 (step @p84 :rule trans :premises (@p83 @p63 @p61 @p42 @p40 @p38 @p36)) % 0.36/0.61 (step @p85 :rule cong :premises (@p84 @p34) :args (@t30)) % 0.36/0.61 (step @p86 :rule trans :premises (@p85 @p30)) % 0.36/0.61 (step @p87 :rule eq_resolve :premises (@p86 @p28)) % 0.36/0.61 (step @p88 :rule false_elim :premises (@p87)) % 0.36/0.61 (assume-push @p95 @t33) % 0.36/0.61 (step @p90 :rule instantiate :premises (@p21) :args ((@list @t27 tptp.b))) % 0.36/0.61 (step-pop @p96 :rule scope :premises (@p90)) % 0.36/0.61 (step @p91 :rule process_scope :premises (@p96) :args (@t29)) % 0.36/0.61 (step @p93 :rule implies_elim :premises (@p91)) % 0.36/0.61 (step @p94 false :rule chain_m_resolution :premises (@p93 @p88 @p21) :args (false (@list true false) (@list @t29 @t33))) % 0.36/0.61 ) % 0.36/0.61 % SZS output end Proof % 0.36/0.61 % cvc5 exiting %------------------------------------------------------------------------------