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.03/0.23	% Computer   : n025.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 05:11:40 CDT 2018
0.03/0.23	% CPUTime    : 
180.83/177.64	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
180.83/177.65	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
180.83/177.65	
180.83/177.65	- the following list represents a non-clausal connection proof
180.83/177.65	  (a tree in which each node is labelled with a nested clause)
180.83/177.65	- I^V is a skolem term f_I(V) for variable list V
180.83/177.65	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
180.83/177.65	  I is the unique index of C, K distinguishes different copies
180.83/177.65	  of C, and V is the list of (instantiated) variables in C
180.83/177.65	
180.83/177.65	[(50897 ^ 0) ^ [] : [hBOOL(hAPP(c_Com_OWT, v_y))], [(35554 ^ 1) ^ [v_pn, v_y] : [-(hBOOL(hAPP(c_Com_OWT, v_y))), c_Com_OWT__bodies, hAPP(c_Option_Ooption_OSome(tc_Com_Ocom), v_y) = hAPP(c_Com_Obody, v_pn)], [(44264 ^ 2) ^ [] : [-(c_Com_OWT__bodies)]], [(4 ^ 2) ^ [hAPP(c_Option_Ooption_OSome(tc_Com_Ocom), v_y), hAPP(c_Com_Obody, v_pn)] : [-(hAPP(c_Option_Ooption_OSome(tc_Com_Ocom), v_y) = hAPP(c_Com_Obody, v_pn)), hAPP(c_Com_Obody, v_pn) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom), v_y)], [(17418 ^ 3) ^ [] : [-(hAPP(c_Com_Obody, v_pn) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom), v_y))]]]]]
180.83/177.65	
180.83/177.65	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
180.83/177.67	EOF