0.00/0.05	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command    : nanocop_casc.sh %s %d
0.03/0.25	% Computer   : n021.star.cs.uiowa.edu
0.03/0.25	% Model      : x86_64 x86_64
0.03/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.25	% Memory     : 32218.625MB
0.03/0.25	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.25	% CPULimit   : 300
0.03/0.25	% DateTime   : Sat Jul 14 04:30:25 CDT 2018
0.03/0.25	% CPUTime    : 
2.04/2.31	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.04/2.31	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.04/2.31	
2.04/2.31	- the following list represents a non-clausal connection proof
2.04/2.31	  (a tree in which each node is labelled with a nested clause)
2.04/2.31	- I^V is a skolem term f_I(V) for variable list V
2.04/2.31	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
2.04/2.31	  I is the unique index of C, K distinguishes different copies
2.04/2.31	  of C, and V is the list of (instantiated) variables in C
2.04/2.31	
2.04/2.31	[(36130 ^ 0) ^ [s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege] : [prettystring(f_instancewithrelationtofn(c_footballteam, c_affiliatedwith, c_beloitcollege), s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)], [(4090 ^ 1) ^ [] : [-(prettystring(f_instancewithrelationtofn(c_footballteam, c_affiliatedwith, c_beloitcollege), s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)), mtvisible(c_englishmt)], [(36128 ^ 2) ^ [_992206] : [-(mtvisible(c_englishmt))]]]]
2.04/2.32	
2.04/2.32	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.04/2.32	EOF