%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP175-4 : 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 : n029.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:06 AM UTC 2026 % Result : Unsatisfiable 0.45s 0.63s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP175-4 : TPTP v9.2.1. Bugfixed v1.2.1. % 0.11/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n029.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 00:54:47 EDT 2026 % 0.17/0.35 % 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.63 % SZS status Unsatisfiable % 0.45/0.63 % SZS output start Proof % 0.45/0.63 ( % 0.45/0.63 (declare-sort $$unsorted 0) % 0.45/0.63 (declare-const tptp.a $$unsorted) % 0.45/0.63 (declare-const tptp.b $$unsorted) % 0.45/0.63 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.identity $$unsorted) % 0.45/0.63 (define @t1 () (@var "X" $$unsorted)) % 0.45/0.63 (define @t2 () (tptp.multiply tptp.identity @t1)) % 0.45/0.63 (define @t3 () (@list @t1)) % 0.45/0.63 (define @t4 () (forall @t3 (= @t2 @t1))) % 0.45/0.63 (define @t5 () (tptp.multiply (tptp.inverse @t1) @t1)) % 0.45/0.63 (define @t6 () (forall @t3 (= @t5 tptp.identity))) % 0.45/0.63 (define @t7 () (@var "Z" $$unsorted)) % 0.45/0.63 (define @t8 () (@var "Y" $$unsorted)) % 0.45/0.63 (define @t9 () (tptp.multiply @t1 @t8)) % 0.45/0.63 (define @t10 () (@list @t1 @t8 @t7)) % 0.45/0.63 (define @t11 () (tptp.greatest_lower_bound @t1 @t8)) % 0.45/0.63 (define @t12 () (@list @t1 @t8)) % 0.45/0.63 (define @t13 () (tptp.least_upper_bound @t1 @t8)) % 0.45/0.63 (define @t14 () (tptp.greatest_lower_bound @t8 @t7)) % 0.45/0.63 (define @t15 () (tptp.least_upper_bound @t8 @t7)) % 0.45/0.63 (define @t16 () (tptp.least_upper_bound @t1 @t1)) % 0.45/0.63 (define @t17 () (forall @t3 (= @t16 @t1))) % 0.45/0.63 (define @t18 () (tptp.greatest_lower_bound @t1 @t1)) % 0.45/0.63 (define @t19 () (forall @t3 (= @t18 @t1))) % 0.45/0.63 (define @t20 () (tptp.least_upper_bound @t1 @t11)) % 0.45/0.63 (define @t21 () (forall @t12 (= @t20 @t1))) % 0.45/0.63 (define @t22 () (tptp.greatest_lower_bound @t1 @t13)) % 0.45/0.63 (define @t23 () (forall @t12 (= @t22 @t1))) % 0.45/0.63 (define @t24 () (tptp.multiply @t1 @t7)) % 0.45/0.63 (define @t25 () (tptp.multiply @t7 @t1)) % 0.45/0.63 (define @t26 () (tptp.multiply @t8 @t1)) % 0.45/0.63 (define @t27 () (@list @t8 @t7 @t1)) % 0.45/0.63 (define @t28 () (tptp.greatest_lower_bound tptp.identity tptp.b)) % 0.45/0.63 (define @t29 () (tptp.multiply tptp.b tptp.a)) % 0.45/0.63 (define @t30 () (tptp.inverse tptp.a)) % 0.45/0.63 (define @t31 () (tptp.multiply @t30 @t29)) % 0.45/0.63 (define @t32 () (tptp.least_upper_bound tptp.identity @t31)) % 0.45/0.63 (define @t33 () (@list tptp.a)) % 0.45/0.63 (define @t34 () (tptp.greatest_lower_bound tptp.b tptp.identity)) % 0.45/0.63 (define @t35 () (tptp.multiply @t30 tptp.b)) % 0.45/0.63 (define @t36 () (@list @t30 @t35)) % 0.45/0.63 (define @t37 () (tptp.least_upper_bound @t30 @t35)) % 0.45/0.63 (define @t38 () (= tptp.identity @t28)) % 0.45/0.63 (define @t39 () (tptp.multiply @t30 tptp.a)) % 0.45/0.63 (define @t40 () (= tptp.identity @t39)) % 0.45/0.63 (define @t41 () (= @t28 @t34)) % 0.45/0.63 (define @t42 () (tptp.greatest_lower_bound tptp.b tptp.b)) % 0.45/0.63 (define @t43 () (= tptp.b @t42)) % 0.45/0.63 (define @t44 () (tptp.least_upper_bound tptp.b @t34)) % 0.45/0.63 (define @t45 () (= tptp.b @t44)) % 0.45/0.63 (define @t46 () (tptp.least_upper_bound @t39 @t31)) % 0.45/0.63 (define @t47 () (= (tptp.multiply @t30 (tptp.least_upper_bound tptp.a @t29)) @t46)) % 0.45/0.63 (define @t48 () (tptp.least_upper_bound @t34 tptp.b)) % 0.45/0.63 (define @t49 () (= @t44 @t48)) % 0.45/0.63 (define @t50 () (tptp.least_upper_bound @t35 @t30)) % 0.45/0.63 (define @t51 () (= @t37 @t50)) % 0.45/0.63 (define @t52 () (tptp.least_upper_bound tptp.a tptp.a)) % 0.45/0.63 (define @t53 () (= tptp.a @t52)) % 0.45/0.63 (define @t54 () (tptp.least_upper_bound @t30 @t30)) % 0.45/0.63 (define @t55 () (= @t30 @t54)) % 0.45/0.63 (define @t56 () (tptp.greatest_lower_bound @t30 @t37)) % 0.45/0.63 (define @t57 () (= @t30 @t56)) % 0.45/0.63 (define @t58 () (= @t56 (tptp.greatest_lower_bound @t37 @t30))) % 0.45/0.63 (define @t59 () (tptp.multiply @t34 tptp.a)) % 0.45/0.63 (define @t60 () (tptp.least_upper_bound @t59 @t29)) % 0.45/0.63 (define @t61 () (tptp.multiply @t48 tptp.a)) % 0.45/0.63 (define @t62 () (= @t61 @t60)) % 0.45/0.63 (define @t63 () (= tptp.a (tptp.multiply tptp.identity tptp.a))) % 0.45/0.63 (define @t64 () (tptp.greatest_lower_bound @t50 @t54)) % 0.45/0.63 (define @t65 () (= @t31 @t32)) % 0.45/0.63 (define @t66 () (and @t38 @t40 @t41 @t43 @t45 @t47 @t49 @t51 @t53 @t55 @t57 @t58 @t62 @t63)) % 0.45/0.63 (assume @p1 @t4) % 0.45/0.63 (assume @p2 @t6) % 0.45/0.63 (assume @p3 (forall @t10 (= (tptp.multiply @t9 @t7) (tptp.multiply @t1 (tptp.multiply @t8 @t7))))) % 0.45/0.63 (assume @p4 (forall @t12 (= @t11 (tptp.greatest_lower_bound @t8 @t1)))) % 0.45/0.63 (assume @p5 (forall @t12 (= @t13 (tptp.least_upper_bound @t8 @t1)))) % 0.45/0.63 (assume @p6 (forall @t10 (= (tptp.greatest_lower_bound @t1 @t14) (tptp.greatest_lower_bound @t11 @t7)))) % 0.45/0.63 (assume @p7 (forall @t10 (= (tptp.least_upper_bound @t1 @t15) (tptp.least_upper_bound @t13 @t7)))) % 0.45/0.63 (assume @p8 @t17) % 0.45/0.63 (assume @p9 @t19) % 0.45/0.63 (assume @p10 @t21) % 0.45/0.63 (assume @p11 @t23) % 0.45/0.63 (assume @p12 (forall @t10 (= (tptp.multiply @t1 @t15) (tptp.least_upper_bound @t9 @t24)))) % 0.45/0.63 (assume @p13 (forall @t10 (= (tptp.multiply @t1 @t14) (tptp.greatest_lower_bound @t9 @t24)))) % 0.45/0.63 (assume @p14 (forall @t27 (= (tptp.multiply @t15 @t1) (tptp.least_upper_bound @t26 @t25)))) % 0.45/0.63 (assume @p15 (forall @t27 (= (tptp.multiply @t14 @t1) (tptp.greatest_lower_bound @t26 @t25)))) % 0.45/0.63 (assume @p16 (= @t28 tptp.identity)) % 0.45/0.63 (assume @p17 (not (= @t32 @t31))) % 0.45/0.63 (step @p18 :rule symm :premises (@p16)) % 0.45/0.63 (step @p19 :rule symm :premises (@p17)) % 0.45/0.63 (step @p20 :rule eq-symm :args (@t5 tptp.identity)) % 0.45/0.63 (step @p21 :rule cong :premises (@p20) :args (@t6)) % 0.45/0.63 (step @p22 :rule eq_resolve :premises (@p2 @p21)) % 0.45/0.63 (step @p23 :rule instantiate :premises (@p22) :args (@t33)) % 0.45/0.63 (step @p24 :rule instantiate :premises (@p4) :args ((@list tptp.identity tptp.b))) % 0.45/0.63 (step @p25 :rule eq-symm :args (@t18 @t1)) % 0.45/0.63 (step @p26 :rule cong :premises (@p25) :args (@t19)) % 0.45/0.63 (step @p27 :rule eq_resolve :premises (@p9 @p26)) % 0.45/0.63 (step @p28 :rule instantiate :premises (@p27) :args ((@list tptp.b))) % 0.45/0.63 (step @p29 :rule eq-symm :args (@t20 @t1)) % 0.45/0.63 (step @p30 :rule cong :premises (@p29) :args (@t21)) % 0.45/0.63 (step @p31 :rule eq_resolve :premises (@p10 @p30)) % 0.45/0.63 (step @p32 :rule instantiate :premises (@p31) :args ((@list tptp.b tptp.identity))) % 0.45/0.63 (step @p33 :rule instantiate :premises (@p12) :args ((@list @t30 tptp.a @t29))) % 0.45/0.63 (step @p34 :rule instantiate :premises (@p5) :args ((@list tptp.b @t34))) % 0.45/0.63 (step @p35 :rule instantiate :premises (@p5) :args (@t36)) % 0.45/0.63 (step @p36 :rule eq-symm :args (@t16 @t1)) % 0.45/0.63 (step @p37 :rule cong :premises (@p36) :args (@t17)) % 0.45/0.63 (step @p38 :rule eq_resolve :premises (@p8 @p37)) % 0.45/0.63 (step @p39 :rule instantiate :premises (@p38) :args (@t33)) % 0.45/0.63 (step @p40 :rule instantiate :premises (@p38) :args ((@list @t30))) % 0.45/0.63 (step @p41 :rule eq-symm :args (@t22 @t1)) % 0.45/0.63 (step @p42 :rule cong :premises (@p41) :args (@t23)) % 0.45/0.63 (step @p43 :rule eq_resolve :premises (@p11 @p42)) % 0.45/0.63 (step @p44 :rule instantiate :premises (@p43) :args (@t36)) % 0.45/0.63 (step @p45 :rule instantiate :premises (@p4) :args ((@list @t30 @t37))) % 0.45/0.63 (step @p46 :rule instantiate :premises (@p14) :args ((@list @t34 tptp.b tptp.a))) % 0.45/0.63 (step @p47 :rule eq-symm :args (@t2 @t1)) % 0.45/0.63 (step @p48 :rule cong :premises (@p47) :args (@t4)) % 0.45/0.63 (step @p49 :rule eq_resolve :premises (@p1 @p48)) % 0.45/0.63 (step @p50 :rule instantiate :premises (@p49) :args (@t33)) % 0.45/0.63 (assume-push @p124 @t38) % 0.45/0.63 (assume-push @p125 @t40) % 0.45/0.63 (assume-push @p126 @t41) % 0.45/0.63 (assume-push @p127 @t43) % 0.45/0.63 (assume-push @p128 @t45) % 0.45/0.63 (assume-push @p129 @t47) % 0.45/0.63 (assume-push @p130 @t49) % 0.45/0.63 (assume-push @p131 @t51) % 0.45/0.63 (assume-push @p132 @t53) % 0.45/0.63 (assume-push @p133 @t55) % 0.45/0.63 (assume-push @p134 @t57) % 0.45/0.63 (assume-push @p135 @t58) % 0.45/0.63 (assume-push @p136 @t62) % 0.45/0.63 (assume-push @p137 @t63) % 0.45/0.63 (step @p65 :rule refl :args (@t31)) % 0.45/0.63 (step @p66 :rule symm :premises (@p23)) % 0.45/0.63 (step @p67 :rule cong :premises (@p66 @p65) :args (@t46)) % 0.45/0.63 (step @p68 :rule refl :args (@t29)) % 0.45/0.63 (step @p69 :rule symm :premises (@p39)) % 0.45/0.63 (step @p70 :rule cong :premises (@p69 @p68) :args ((tptp.least_upper_bound @t52 @t29))) % 0.45/0.63 (step @p71 :rule refl :args (tptp.a)) % 0.45/0.63 (step @p72 :rule symm :premises (@p28)) % 0.45/0.63 (step @p73 :rule cong :premises (@p72 @p71) :args ((tptp.multiply @t42 tptp.a))) % 0.45/0.63 (step @p74 :rule symm :premises (@p32)) % 0.45/0.64 (step @p75 :rule symm :premises (@p34)) % 0.45/0.64 (step @p76 :rule trans :premises (@p75 @p74)) % 0.45/0.64 (step @p77 :rule trans :premises (@p76 @p28)) % 0.45/0.64 (step @p78 :rule cong :premises (@p77 @p71) :args (@t61)) % 0.45/0.64 (step @p79 :rule symm :premises (@p46)) % 0.45/0.64 (step @p80 :rule trans :premises (@p79 @p78 @p73)) % 0.45/0.64 (step @p81 :rule symm :premises (@p50)) % 0.45/0.64 (step @p82 :rule symm :premises (@p24)) % 0.45/0.64 (step @p83 :rule trans :premises (@p82 @p16)) % 0.45/0.64 (step @p84 :rule cong :premises (@p83 @p71) :args (@t59)) % 0.45/0.64 (step @p85 :rule trans :premises (@p84 @p81)) % 0.45/0.64 (step @p86 :rule trans :premises (@p85 @p39)) % 0.45/0.64 (step @p87 :rule cong :premises (@p86 @p80) :args ((tptp.least_upper_bound @t59 @t60))) % 0.45/0.64 (step @p88 :rule symm :premises (@p80)) % 0.45/0.64 (step @p89 :rule refl :args (@t59)) % 0.45/0.64 (step @p90 :rule cong :premises (@p89 @p88) :args (@t60)) % 0.45/0.64 (step @p91 :rule symm :premises (@p78)) % 0.45/0.64 (step @p92 :rule symm :premises (@p73)) % 0.45/0.64 (step @p93 :rule trans :premises (@p92 @p91 @p46 @p90 @p87 @p70)) % 0.45/0.64 (step @p94 :rule symm :premises (@p44)) % 0.45/0.64 (step @p95 :rule symm :premises (@p45)) % 0.45/0.64 (step @p96 :rule symm :premises (@p40)) % 0.45/0.64 (step @p97 :rule symm :premises (@p35)) % 0.45/0.64 (step @p98 :rule cong :premises (@p97 @p96) :args (@t64)) % 0.45/0.64 (step @p99 :rule trans :premises (@p98 @p95 @p94)) % 0.45/0.64 (step @p100 :rule cong :premises (@p99 @p93) :args ((tptp.multiply @t64 @t29))) % 0.45/0.64 (step @p101 :rule symm :premises (@p99)) % 0.45/0.64 (step @p102 :rule cong :premises (@p101 @p68) :args (@t31)) % 0.45/0.64 (step @p103 :rule trans :premises (@p102 @p100 @p33 @p67)) % 0.45/0.64 (step-pop @p138 :rule scope :premises (@p103)) % 0.45/0.64 (step-pop @p139 :rule scope :premises (@p138)) % 0.45/0.64 (step-pop @p140 :rule scope :premises (@p139)) % 0.45/0.64 (step-pop @p141 :rule scope :premises (@p140)) % 0.45/0.64 (step-pop @p142 :rule scope :premises (@p141)) % 0.45/0.64 (step-pop @p143 :rule scope :premises (@p142)) % 0.45/0.64 (step-pop @p144 :rule scope :premises (@p143)) % 0.45/0.64 (step-pop @p145 :rule scope :premises (@p144)) % 0.45/0.64 (step-pop @p146 :rule scope :premises (@p145)) % 0.45/0.64 (step-pop @p147 :rule scope :premises (@p146)) % 0.45/0.64 (step-pop @p148 :rule scope :premises (@p147)) % 0.45/0.64 (step-pop @p149 :rule scope :premises (@p148)) % 0.45/0.64 (step-pop @p150 :rule scope :premises (@p149)) % 0.45/0.64 (step-pop @p151 :rule scope :premises (@p150)) % 0.45/0.64 (step @p104 :rule process_scope :premises (@p151) :args (@t65)) % 0.45/0.64 (step @p119 :rule implies_elim :premises (@p104)) % 0.45/0.64 (step @p120 :rule cnf_and_neg :args (@t66)) % 0.45/0.64 (step @p121 :rule resolution :premises (@p120 @p119) :args (true @t66)) % 0.45/0.64 (step @p122 :rule reordering :premises (@p121) :args ((or @t65 (not @t38) (not @t40) (not @t41) (not @t43) (not @t45) (not @t47) (not @t49) (not @t51) (not @t53) (not @t55) (not @t57) (not @t58) (not @t62) (not @t63)))) % 0.45/0.64 (step @p123 false :rule chain_m_resolution :premises (@p122 @p50 @p46 @p45 @p44 @p40 @p39 @p35 @p34 @p33 @p32 @p28 @p24 @p23 @p19 @p18) :args (false (@list false false false false false false false false false false false false false true false) (@list @t63 @t62 @t58 @t57 @t55 @t53 @t51 @t49 @t47 @t45 @t43 @t41 @t40 @t65 @t38))) % 0.45/0.64 ) % 0.45/0.64 % SZS output end Proof % 0.45/0.64 % cvc5 exiting %------------------------------------------------------------------------------