0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : nanocop_casc.sh %s %d
0.13/0.33	% Computer   : n010.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 180
0.13/0.33	% DateTime   : Thu Aug 29 11:59:36 EDT 2019
0.13/0.34	% CPUTime    : 
29.53/29.44	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
29.53/29.45	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
29.53/29.45	
29.53/29.45	- the following list represents a non-clausal connection proof
29.53/29.45	  (a tree in which each node is labelled with a nested clause)
29.53/29.45	- I^V is a skolem term f_I(V) for variable list V
29.53/29.45	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
29.53/29.45	  I is the unique index of C, K distinguishes different copies
29.53/29.45	  of C, and V is the list of (instantiated) variables in C
29.53/29.45	
29.53/29.45	[(51696 ^ 0) ^ [] : [v_P(51688 ^ [], 51692 ^ [])], [(1832 ^ 1) ^ [51692 ^ [], 51689 ^ [], 51688 ^ [], 51688 ^ []] : [-(v_P(51688 ^ [], 51692 ^ [])), v_P(51688 ^ [], 51689 ^ []), 51688 ^ [] = 51688 ^ [], 51689 ^ [] = 51692 ^ []], [(51691 ^ 2) ^ [] : [-(v_P(51688 ^ [], 51689 ^ []))]], [(2 ^ 2) ^ [51688 ^ []] : [-(51688 ^ [] = 51688 ^ [])]], [(37190 ^ 2) ^ [51689 ^ [], v_n, 51692 ^ []] : [-(51689 ^ [] = 51692 ^ []), c_Natural_Oevaln(c_Com_Ocom_OSKIP, 51689 ^ [], v_n, 51692 ^ [])], [(51694 ^ 3) ^ [] : [-(c_Natural_Oevaln(c_Com_Ocom_OSKIP, 51689 ^ [], v_n, 51692 ^ []))]]]]]
29.53/29.46	
29.53/29.46	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
29.53/29.46	EOF