0.00/0.04	% 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   : n173.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:17:42 CDT 2018
0.02/0.23	% CPUTime    : 
26.59/26.78	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
26.59/26.79	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
26.59/26.79	
26.59/26.79	- the following list represents a non-clausal connection proof
26.59/26.79	  (a tree in which each node is labelled with a nested clause)
26.59/26.79	- I^V is a skolem term f_I(V) for variable list V
26.59/26.79	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
26.59/26.79	  I is the unique index of C, K distinguishes different copies
26.59/26.79	  of C, and V is the list of (instantiated) variables in C
26.59/26.79	
26.59/26.79	[(7823 ^ 0) ^ [] : [iext(uri_rdf_type, uri_ex_w, uri_ex_z)], [(5887 ^ 1) ^ [uri_ex_z, uri_ex_w] : [-(iext(uri_rdf_type, uri_ex_w, uri_ex_z)), icext(uri_ex_z, uri_ex_w)], [(4587 ^ 2) ^ [literal_typed(dat_str_true, uri_xsd_boolean), uri_ex_p, uri_ex_z] : [-(icext(uri_ex_z, uri_ex_w)), 4594 ^ 2 : [(4601 ^ 2) ^ [uri_ex_w] : [iext(uri_ex_p, uri_ex_w, uri_ex_w)]], iext(uri_owl_onProperty, uri_ex_z, uri_ex_p), iext(uri_owl_hasSelf, uri_ex_z, literal_typed(dat_str_true, uri_xsd_boolean))], [(7819 ^ 5) ^ [] : [-(iext(uri_ex_p, uri_ex_w, uri_ex_w))]], [(7821 ^ 3) ^ [] : [-(iext(uri_owl_onProperty, uri_ex_z, uri_ex_p))]], [(7817 ^ 3) ^ [] : [-(iext(uri_owl_hasSelf, uri_ex_z, literal_typed(dat_str_true, uri_xsd_boolean)))]]]]]
26.59/26.79	
26.59/26.79	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
26.59/26.79	EOF