0.02/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : nanocop_casc.sh %s %d
0.10/0.31	% Computer   : n016.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 180
0.10/0.31	% DateTime   : Thu Aug 29 11:02:38 EDT 2019
0.10/0.31	% CPUTime    : 
28.87/28.24	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
28.94/28.25	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
28.94/28.25	
28.94/28.25	- the following list represents a non-clausal connection proof
28.94/28.25	  (a tree in which each node is labelled with a nested clause)
28.94/28.25	- I^V is a skolem term f_I(V) for variable list V
28.94/28.25	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
28.94/28.25	  I is the unique index of C, K distinguishes different copies
28.94/28.25	  of C, and V is the list of (instantiated) variables in C
28.94/28.26	
28.94/28.26	[(7823 ^ 0) ^ [] : [iext(uri_rdf_type, uri_ex_w, uri_ex_z)], [(3344 ^ 1) ^ [uri_ex_z, uri_ex_w] : [-(iext(uri_rdf_type, uri_ex_w, uri_ex_z)), icext(uri_ex_z, uri_ex_w)], [(6952 ^ 2) ^ [literal_typed(dat_str_true, uri_xsd_boolean), uri_ex_p, uri_ex_z] : [-(icext(uri_ex_z, uri_ex_w)), 6959 ^ 2 : [(6966 ^ 2) ^ [uri_ex_w] : [iext(uri_ex_p, uri_ex_w, uri_ex_w)]], iext(uri_owl_hasSelf, uri_ex_z, literal_typed(dat_str_true, uri_xsd_boolean)), iext(uri_owl_onProperty, uri_ex_z, uri_ex_p)], [(7819 ^ 5) ^ [] : [-(iext(uri_ex_p, uri_ex_w, uri_ex_w))]], [(7817 ^ 3) ^ [] : [-(iext(uri_owl_hasSelf, uri_ex_z, literal_typed(dat_str_true, uri_xsd_boolean)))]], [(7821 ^ 3) ^ [] : [-(iext(uri_owl_onProperty, uri_ex_z, uri_ex_p))]]]]]
28.94/28.26	
28.94/28.26	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
28.94/28.26	EOF