0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : nanocop_casc.sh %s %d 0.12/0.33 % Computer : n022.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 180 0.12/0.33 % DateTime : Thu Aug 29 10:01:58 EDT 2019 0.12/0.33 % CPUTime : 159.89/153.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 159.89/153.96 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p 159.89/153.96 159.89/153.96 - the following list represents a non-clausal connection proof 159.89/153.96 (a tree in which each node is labelled with a nested clause) 159.89/153.96 - I^V is a skolem term f_I(V) for variable list V 159.89/153.96 - (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which 159.89/153.96 I is the unique index of C, K distinguishes different copies 159.89/153.96 of C, and V is the list of (instantiated) variables in C 159.89/153.96 159.89/153.96 [(5988 ^ 0) ^ [int] : [linordered_idom(int), 5991 ^ 0 : [(5998 ^ 0) ^ [plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))] : [hBOOL(hAPP(int, bool, hAPP(int, fun(int, bool), ord_less(int), zero_zero(int)), hAPP(nat, int, power_power(int, plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))), number_number_of(nat, bit0(bit1(pls)))))), ti(int, plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))) = zero_zero(int)]]], [(4955 ^ 1) ^ [] : [-(linordered_idom(int))]], [(6212 ^ 3) ^ [int] : [-(hBOOL(hAPP(int, bool, hAPP(int, fun(int, bool), ord_less(int), zero_zero(int)), hAPP(nat, int, power_power(int, plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))), number_number_of(nat, bit0(bit1(pls))))))), 6215 ^ 3 : [(6216 ^ 3) ^ [plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n)), number_number_of(nat, bit0(bit1(pls)))] : [hBOOL(hAPP(int, bool, hAPP(int, fun(int, bool), ord_less(int), zero_zero(int)), plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))))]], linordered_semidom(int)], [(10183 ^ 6) ^ [] : [-(hBOOL(hAPP(int, bool, hAPP(int, fun(int, bool), ord_less(int), zero_zero(int)), plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n)))))]], [(3840 ^ 4) ^ [] : [-(linordered_semidom(int))]]], [(11264 ^ 3) ^ [int] : [-(ti(int, plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))) = zero_zero(int)), 11267 ^ 3 : [(11274 ^ 3) ^ [plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))] : [hAPP(nat, int, power_power(int, plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))), number_number_of(nat, bit0(bit1(pls)))) = zero_zero(int)]], ring_11004092258visors(int)], [(11755 ^ 6) ^ [] : [-(hAPP(nat, int, power_power(int, plus_plus(int, one_one(int), hAPP(nat, int, semiring_1_of_nat(int), n))), number_number_of(nat, bit0(bit1(pls)))) = zero_zero(int))]], [(8854 ^ 4) ^ [] : [-(ring_11004092258visors(int))]]]] 159.89/153.97 159.89/153.97 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p 159.89/153.97 EOF