0.02/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.04	% Command    : nanocop_casc.sh %s %d
0.02/0.24	% Computer   : n115.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 04:18:10 CDT 2018
0.02/0.24	% CPUTime    : 
44.91/45.10	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
44.91/45.10	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
44.91/45.10	
44.91/45.10	- the following list represents a non-clausal connection proof
44.91/45.10	  (a tree in which each node is labelled with a nested clause)
44.91/45.10	- I^V is a skolem term f_I(V) for variable list V
44.91/45.10	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
44.91/45.10	  I is the unique index of C, K distinguishes different copies
44.91/45.10	  of C, and V is the list of (instantiated) variables in C
44.91/45.11	
44.91/45.11	[(36128 ^ 0) ^ [] : [-(disjointwith(c_xskijump_thegame, c_tptpcol_16_35301))], [(17694 ^ 1) ^ [c_tptpcol_16_35301, c_xskijump_thegame] : [disjointwith(c_xskijump_thegame, c_tptpcol_16_35301), -(collection(c_xskijump_thegame))], [(28882 ^ 2) ^ [c_xskijump_thegame] : [collection(c_xskijump_thegame), individual(c_xskijump_thegame)], [(16456 ^ 3) ^ [] : [-(individual(c_xskijump_thegame))]]]]]
44.91/45.11	
44.91/45.11	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
44.91/45.14	EOF