0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : nanocop_casc.sh %s %d 0.02/0.23 % Computer : n068.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:34:12 CDT 2018 0.02/0.23 % CPUTime : 3.65/4.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 3.65/4.33 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p 3.65/4.33 3.65/4.33 - the following list represents a non-clausal connection proof 3.65/4.33 (a tree in which each node is labelled with a nested clause) 3.65/4.33 - I^V is a skolem term f_I(V) for variable list V 3.65/4.33 - (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which 3.65/4.33 I is the unique index of C, K distinguishes different copies 3.65/4.33 of C, and V is the list of (instantiated) variables in C 3.65/4.33 3.65/4.33 [(4731 ^ 0) ^ [] : [4723 ^ [] = vd1102], [(1602 ^ 1) ^ [4723 ^ [], vd1102, vd1089, vd1096, vd1096] : [-(4723 ^ [] = vd1102), vf(vd1089, vd1096) = vf(vd1089, vd1096), ron(vd1096, 4723 ^ []), ron(vd1096, vd1102), 1617 ^ 1 : [(1618 ^ 1) ^ [vd1096] : [vd1096 = vd1096, rpoint(vd1096)]], 1625 ^ 1 : [(1626 ^ 1) ^ [vd1096] : [vd1096 = vd1096, rpoint(vd1096)]], rcenter(vd1089, vd1102), rcenter(vd1089, 4723 ^ [])], [(2 ^ 2) ^ [vf(vd1089, vd1096)] : [-(vf(vd1089, vd1096) = vf(vd1089, vd1096))]], [(4729 ^ 2) ^ [] : [-(ron(vd1096, 4723 ^ []))]], [(463 ^ 2) ^ [] : [-(ron(vd1096, vd1102))]], [(2 ^ 4) ^ [vd1096] : [-(vd1096 = vd1096)]], [(4368 ^ 4) ^ [] : [-(rpoint(vd1096))]], [(2 ^ 4) ^ [vd1096] : [-(vd1096 = vd1096)]], [(4368 ^ 4) ^ [] : [-(rpoint(vd1096))]], [(461 ^ 2) ^ [] : [-(rcenter(vd1089, vd1102))]], [(4727 ^ 2) ^ [] : [-(rcenter(vd1089, 4723 ^ []))]]]] 3.65/4.33 3.65/4.33 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p 3.65/4.34 EOF