0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command    : nanocop_casc.sh %s %d
0.03/0.28	% Computer   : n021.star.cs.uiowa.edu
0.03/0.28	% Model      : x86_64 x86_64
0.03/0.28	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.28	% Memory     : 32218.625MB
0.03/0.28	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.28	% CPULimit   : 300
0.03/0.28	% DateTime   : Fri Jul 13 14:54:11 CDT 2018
0.03/0.28	% CPUTime    : 
0.65/1.32	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.65/1.32	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.65/1.32	
0.65/1.32	- the following list represents a non-clausal connection proof
0.65/1.32	  (a tree in which each node is labelled with a nested clause)
0.65/1.32	- I^V is a skolem term f_I(V) for variable list V
0.65/1.32	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
0.65/1.32	  I is the unique index of C, K distinguishes different copies
0.65/1.32	  of C, and V is the list of (instantiated) variables in C
0.65/1.32	
0.65/1.32	[(689 ^ 0) ^ [] : [mighta(cax, thm)], [(641 ^ 1) ^ [thm, cax] : [-(mighta(cax, thm)), 642 ^ 1 : [(643 ^ 1) ^ [_55997, 660 ^ []] : [status(660 ^ [], _55997, cax), status(660 ^ [], _55997, thm)]]], [(304 ^ 4) ^ [_55997, 660 ^ []] : [-(status(660 ^ [], _55997, cax)), -(model(305 ^ [_55997, 660 ^ []], 660 ^ []))], [(662 ^ 5) ^ [305 ^ [_55997, 660 ^ []]] : [model(305 ^ [_55997, 660 ^ []], 660 ^ [])]]], [(103 ^ 4) ^ [_55997, 660 ^ []] : [-(status(660 ^ [], _55997, thm)), 105 ^ 4 : [(106 ^ 4) ^ [] : [-(model(104 ^ [_55997, 660 ^ []], 660 ^ []))], (108 ^ 4) ^ [] : [model(104 ^ [_55997, 660 ^ []], _55997)]]], [(662 ^ 7) ^ [104 ^ [_55997, 660 ^ []]] : [model(104 ^ [_55997, 660 ^ []], 660 ^ [])]]]]]
0.65/1.33	
0.65/1.33	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.65/1.33	EOF