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   : n144.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   : Sat Jul 14 04:39:55 CDT 2018
0.03/0.23	% CPUTime    : 
0.48/1.27	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.48/1.27	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.48/1.27	
0.48/1.27	- the following list represents a non-clausal connection proof
0.48/1.27	  (a tree in which each node is labelled with a nested clause)
0.48/1.27	- I^V is a skolem term f_I(V) for variable list V
0.48/1.27	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
0.48/1.27	  I is the unique index of C, K distinguishes different copies
0.48/1.27	  of C, and V is the list of (instantiated) variables in C
0.48/1.27	
0.48/1.27	[(23143 ^ 0) ^ [c24784, c24791, c25819, c24785, c25868] : [flp(c25868, c25819), scar(c24791, c24784), val(c24785, new_york_0), sub(c24785, name_1_1)], [(22189 ^ 1) ^ [] : [-(flp(c25868, c25819))]], [(22173 ^ 1) ^ [] : [-(scar(c24791, c24784))]], [(22171 ^ 1) ^ [] : [-(val(c24785, new_york_0))]], [(22169 ^ 1) ^ [] : [-(sub(c24785, name_1_1))]]]
0.48/1.28	
0.48/1.28	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.48/1.28	EOF