0.00/0.03	% 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   : n024.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   : Fri Jul 13 14:54:27 CDT 2018
0.02/0.23	% CPUTime    : 
0.62/1.27	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.62/1.27	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
0.62/1.27	
0.62/1.27	- the following list represents a non-clausal connection proof
0.62/1.27	  (a tree in which each node is labelled with a nested clause)
0.62/1.27	- I^V is a skolem term f_I(V) for variable list V
0.62/1.27	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
0.62/1.27	  I is the unique index of C, K distinguishes different copies
0.62/1.27	  of C, and V is the list of (instantiated) variables in C
0.62/1.28	
0.62/1.28	[(689 ^ 0) ^ [] : [nota(unp, thm)], [(598 ^ 1) ^ [thm, unp] : [-(nota(unp, thm)), 599 ^ 1 : [(600 ^ 1) ^ [660 ^ [], 532 ^ []] : [status(532 ^ [], 660 ^ [], unp), -(status(532 ^ [], 660 ^ [], thm))]]], [(13 ^ 4) ^ [660 ^ [], 532 ^ []] : [-(status(532 ^ [], 660 ^ [], unp)), 14 ^ 4 : [(15 ^ 4) ^ [535 ^ []] : [model(535 ^ [], 532 ^ [])], (18 ^ 4) ^ [] : [-(model(16 ^ [660 ^ [], 532 ^ []], 660 ^ []))]]], [(537 ^ 7) ^ [] : [-(model(535 ^ [], 532 ^ []))]]], [(112 ^ 4) ^ [660 ^ [], 532 ^ []] : [status(532 ^ [], 660 ^ [], thm), 115 ^ 4 : [(116 ^ 4) ^ [535 ^ []] : [model(535 ^ [], 532 ^ []), -(model(535 ^ [], 660 ^ []))]]], [(537 ^ 7) ^ [] : [-(model(535 ^ [], 532 ^ []))]], [(662 ^ 7) ^ [535 ^ []] : [model(535 ^ [], 660 ^ [])]]]]]
0.62/1.28	
0.62/1.28	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
0.62/1.28	EOF