0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : nanocop_casc.sh %s %d
0.12/0.32	% Computer   : n005.cluster.edu
0.12/0.32	% Model      : x86_64 x86_64
0.12/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory     : 8042.1875MB
0.12/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 180
0.12/0.32	% DateTime   : Thu Aug 29 09:46:33 EDT 2019
0.12/0.33	% CPUTime    : 
2.35/3.47	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.35/3.47	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.35/3.47	
2.35/3.47	- the following list represents a non-clausal connection proof
2.35/3.47	  (a tree in which each node is labelled with a nested clause)
2.35/3.47	- I^V is a skolem term f_I(V) for variable list V
2.35/3.47	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
2.35/3.47	  I is the unique index of C, K distinguishes different copies
2.35/3.47	  of C, and V is the list of (instantiated) variables in C
2.35/3.48	
2.35/3.48	[(36130 ^ 0) ^ [c_individual] : [isa(f_citynamedfn(s_agen, c_france), c_individual)], [(17694 ^ 1) ^ [f_citynamedfn(s_agen, c_france)] : [-(isa(f_citynamedfn(s_agen, c_france), c_individual)), individual(f_citynamedfn(s_agen, c_france))], [(25382 ^ 2) ^ [] : [-(individual(f_citynamedfn(s_agen, c_france)))]]]]
2.35/3.48	
2.44/3.49	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.44/3.49	EOF