%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWX105_1 : TPTP v9.2.1. Released v9.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n019.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 09:07:08 AM UTC 2026 % Result : Theorem 0.41s 0.58s % Output : Proof 0.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SWX105_1 : TPTP v9.2.1. Released v9.1.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.36 % Computer : n019.cluster.edu % 0.17/0.36 % Model : x86_64 x86_64 % 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.36 % Memory : 8042.1875MB % 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.36 % CPULimit : 300 % 0.17/0.36 % WCLimit : 300 % 0.17/0.36 % DateTime : Tue Jun 2 22:56:49 EDT 2026 % 0.17/0.36 % CPUTime : % 0.34/0.52 %----Proving TF0_ARI % 0.41/0.58 --- Run --finite-model-find --decision=internal at 45... % 0.41/0.58 % SZS status Theorem % 0.41/0.58 % SZS output start Proof % 0.41/0.58 ( % 0.41/0.58 (declare-sort tptp.symbol 0) % 0.41/0.58 (declare-sort tptp.general 0) % 0.41/0.58 (declare-const tptp.p__greater__ (-> tptp.general tptp.general Bool)) % 0.41/0.58 (declare-const tptp.p__greater_equal__ (-> tptp.general tptp.general Bool)) % 0.41/0.58 (declare-const tptp.p__less__ (-> tptp.general tptp.general Bool)) % 0.41/0.58 (declare-const tptp.p__less_equal__ (-> tptp.general tptp.general Bool)) % 0.41/0.58 (declare-const tptp.p (-> tptp.general Bool)) % 0.41/0.58 (declare-const tptp.c__infimum__ tptp.general) % 0.41/0.58 (declare-const tptp.n_i Int) % 0.41/0.58 (declare-const tptp.c__supremum__ tptp.general) % 0.41/0.58 (declare-const tptp.p__is_symbolic__ (-> tptp.general Bool)) % 0.41/0.58 (declare-const tptp.f__symbolic__ (-> tptp.symbol tptp.general)) % 0.41/0.58 (declare-const tptp.p__is_integer__ (-> tptp.general Bool)) % 0.41/0.58 (declare-const tptp.f__integer__ (-> Int tptp.general)) % 0.41/0.58 (define @t1 () (@var "N" Int)) % 0.41/0.58 (define @t2 () (tptp.f__integer__ @t1)) % 0.41/0.58 (define @t3 () (@var "X" tptp.general)) % 0.41/0.58 (define @t4 () (@list @t1)) % 0.41/0.58 (define @t5 () (tptp.p__is_integer__ @t3)) % 0.41/0.58 (define @t6 () (@list @t3)) % 0.41/0.58 (define @t7 () (@var "X2" tptp.symbol)) % 0.41/0.58 (define @t8 () (@var "X1" tptp.general)) % 0.41/0.58 (define @t9 () (@var "N2" Int)) % 0.41/0.58 (define @t10 () (@var "N1" Int)) % 0.41/0.58 (define @t11 () (tptp.f__integer__ @t9)) % 0.41/0.58 (define @t12 () (tptp.f__integer__ @t10)) % 0.41/0.58 (define @t13 () (@list @t10 @t9)) % 0.41/0.58 (define @t14 () (@var "S2" tptp.symbol)) % 0.41/0.58 (define @t15 () (@var "S1" tptp.symbol)) % 0.41/0.58 (define @t16 () (@var "X2" tptp.general)) % 0.41/0.58 (define @t17 () (= @t8 @t16)) % 0.41/0.58 (define @t18 () (tptp.p__less_equal__ @t16 @t8)) % 0.41/0.58 (define @t19 () (tptp.p__less_equal__ @t8 @t16)) % 0.41/0.58 (define @t20 () (@list @t8 @t16)) % 0.41/0.58 (define @t21 () (@var "X3" tptp.general)) % 0.41/0.58 (define @t22 () (not @t17)) % 0.41/0.58 (define @t23 () (@var "S" tptp.symbol)) % 0.41/0.58 (define @t24 () (tptp.f__symbolic__ @t23)) % 0.41/0.58 (define @t25 () (@var "Z1_g" tptp.general)) % 0.41/0.58 (define @t26 () (@var "Z_g" tptp.general)) % 0.41/0.58 (define @t27 () (@var "J_i" Int)) % 0.41/0.58 (define @t28 () (@var "K_i" Int)) % 0.41/0.58 (define @t29 () (@var "I_i" Int)) % 0.41/0.58 (define @t30 () (= @t27 tptp.n_i)) % 0.41/0.58 (define @t31 () (@var "I1_i" Int)) % 0.41/0.58 (define @t32 () (@var "X_g" tptp.general)) % 0.41/0.58 (define @t33 () (@var "V1_g" tptp.general)) % 0.41/0.58 (define @t34 () (@var "N_i" Int)) % 0.41/0.58 (define @t35 () (- @t34)) % 0.41/0.58 (define @t36 () (* @t35 @t35)) % 0.41/0.58 (define @t37 () (* @t34 @t34)) % 0.41/0.58 (define @t38 () (= @t37 @t36)) % 0.41/0.58 (define @t39 () (@list @t34)) % 0.41/0.58 (define @t40 () (forall @t39 @t38)) % 0.41/0.58 (define @t41 () (not @t40)) % 0.41/0.58 (define @t42 () (* @t34 @t34)) % 0.41/0.58 (define @t43 () (* -1 @t34)) % 0.41/0.58 (assume @p1 (forall @t6 (= @t5 (exists @t4 (= @t3 @t2))))) % 0.41/0.58 (assume @p2 (forall (@list @t8) (= (tptp.p__is_symbolic__ @t8) (exists (@list @t7) (= @t8 (tptp.f__symbolic__ @t7)))))) % 0.41/0.58 (assume @p3 (forall @t6 (or (= @t3 tptp.c__infimum__) @t5 (tptp.p__is_symbolic__ @t3) (= @t3 tptp.c__supremum__)))) % 0.41/0.58 (assume @p4 (forall @t13 (= (= @t12 @t11) (= @t10 @t9)))) % 0.41/0.58 (assume @p5 (forall (@list @t15 @t14) (= (= (tptp.f__symbolic__ @t15) (tptp.f__symbolic__ @t14)) (= @t15 @t14)))) % 0.41/0.58 (assume @p6 (forall @t13 (= (tptp.p__less_equal__ @t12 @t11) (<= @t10 @t9)))) % 0.41/0.58 (assume @p7 (forall @t20 (=> (and @t19 @t18) @t17))) % 0.41/0.58 (assume @p8 (forall (@list @t8 @t16 @t21) (=> (and @t19 (tptp.p__less_equal__ @t16 @t21)) (tptp.p__less_equal__ @t8 @t21)))) % 0.41/0.59 (assume @p9 (forall @t20 (or @t19 @t18))) % 0.41/0.59 (assume @p10 (forall @t20 (= (tptp.p__less__ @t8 @t16) (and @t19 @t22)))) % 0.41/0.59 (assume @p11 (forall @t20 (= (tptp.p__greater_equal__ @t8 @t16) @t18))) % 0.41/0.59 (assume @p12 (forall @t20 (= (tptp.p__greater__ @t8 @t16) (and @t18 @t22)))) % 0.41/0.59 (assume @p13 (forall @t4 (tptp.p__less__ tptp.c__infimum__ @t2))) % 0.41/0.59 (assume @p14 (forall (@list @t1 @t23) (tptp.p__less__ @t2 @t24))) % 0.41/0.59 (assume @p15 (forall (@list @t23) (tptp.p__less__ @t24 tptp.c__supremum__))) % 0.41/0.59 (assume @p16 (forall (@list @t33) (= (tptp.p @t33) (exists (@list @t32) (and (exists (@list @t29 @t27) (and (= @t33 (tptp.f__integer__ (* @t29 @t27))) (= (tptp.f__integer__ @t29) @t32) (= (tptp.f__integer__ @t27) @t32))) (exists (@list @t26 @t25) (and (= @t26 @t32) (exists (@list @t29 @t27 @t28) (and (exists (@list @t31 @t27) (and (= @t29 (- @t31 @t27)) (= @t31 0) @t30)) @t30 (= @t25 (tptp.f__integer__ @t28)) (<= @t29 @t28) (<= @t28 @t27))) (= @t26 @t25)))))))) % 0.41/0.59 (assume @p17 @t41) % 0.41/0.59 (assume @p18 true) % 0.41/0.59 (step @p19 :rule evaluate :args ((not true))) % 0.41/0.59 (step @p20 :rule quant-unused-vars :args ((= (forall @t39 true) true))) % 0.41/0.59 (step @p21 :rule eq-refl :args (@t42)) % 0.41/0.59 (step @p22 :rule arith_poly_norm :args ((= (* @t43 @t43) @t42))) % 0.41/0.59 (step @p23 :rule arith_poly_norm :args ((= @t35 @t43))) % 0.41/0.59 (step @p24 :rule nary_cong :premises (@p23 @p23) :args (@t36)) % 0.41/0.59 (step @p25 :rule trans :premises (@p24 @p22)) % 0.41/0.59 (step @p26 :rule arith_poly_norm :args ((= @t37 @t42))) % 0.41/0.59 (step @p27 :rule cong :premises (@p26 @p25) :args (@t38)) % 0.41/0.59 (step @p28 :rule trans :premises (@p27 @p21)) % 0.41/0.59 (step @p29 :rule cong :premises (@p28) :args (@t40)) % 0.41/0.59 (step @p30 :rule trans :premises (@p29 @p20)) % 0.41/0.59 (step @p31 :rule cong :premises (@p30) :args (@t41)) % 0.41/0.59 (step @p32 :rule trans :premises (@p31 @p19)) % 0.41/0.59 (step @p33 false :rule eq_resolve :premises (@p17 @p32)) % 0.41/0.59 ) % 0.41/0.59 % SZS output end Proof % 0.41/0.59 % cvc5 exiting %------------------------------------------------------------------------------