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.03/0.23	% Computer   : n155.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Fri Jul 13 14:53:11 CDT 2018
0.03/0.23	% CPUTime    : 
2.14/3.30	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
2.14/3.31	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
2.14/3.31	
2.14/3.31	- the following list represents a non-clausal connection proof
2.14/3.31	  (a tree in which each node is labelled with a nested clause)
2.14/3.31	- I^V is a skolem term f_I(V) for variable list V
2.14/3.31	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
2.14/3.31	  I is the unique index of C, K distinguishes different copies
2.14/3.31	  of C, and V is the list of (instantiated) variables in C
2.14/3.31	
2.14/3.31	[(36130 ^ 0) ^ [] : [individual(c_tptptptpcol_16_25985)], [(17176 ^ 1) ^ [] : [-(individual(c_tptptptpcol_16_25985))]]]
2.14/3.31	
2.14/3.31	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
2.14/3.32	EOF