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   : n061.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:32:40 CDT 2018
0.02/0.23	% CPUTime    : 
4.28/5.35	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.28/5.35	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.28/5.35	
4.28/5.35	- the following list represents a non-clausal connection proof
4.28/5.35	  (a tree in which each node is labelled with a nested clause)
4.28/5.35	- I^V is a skolem term f_I(V) for variable list V
4.28/5.35	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
4.28/5.35	  I is the unique index of C, K distinguishes different copies
4.28/5.35	  of C, and V is the list of (instantiated) variables in C
4.32/5.36	
4.32/5.36	[(36130 ^ 0) ^ [c_individual] : [isa(f_citynamedfn(s_agen, c_france), c_individual)], [(27710 ^ 1) ^ [f_citynamedfn(s_agen, c_france)] : [-(isa(f_citynamedfn(s_agen, c_france), c_individual)), individual(f_citynamedfn(s_agen, c_france))], [(4132 ^ 2) ^ [] : [-(individual(f_citynamedfn(s_agen, c_france)))]]]]
4.32/5.36	
4.32/5.36	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.32/5.36	EOF