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   : n022.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:16:52 CDT 2018
0.02/0.23	% CPUTime    : 
1.44/2.28	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
1.44/2.29	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
1.44/2.29	
1.44/2.29	- the following list represents a non-clausal connection proof
1.44/2.29	  (a tree in which each node is labelled with a nested clause)
1.44/2.29	- I^V is a skolem term f_I(V) for variable list V
1.44/2.29	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
1.44/2.29	  I is the unique index of C, K distinguishes different copies
1.44/2.29	  of C, and V is the list of (instantiated) variables in C
1.44/2.29	
1.44/2.29	[(563 ^ 0) ^ [] : [model(561 ^ [], 560 ^ [])], [(112 ^ 1) ^ [560 ^ [], 663 ^ []] : [-(model(561 ^ [], 560 ^ [])), 115 ^ 1 : [(116 ^ 1) ^ [561 ^ []] : [model(561 ^ [], 663 ^ [])]], status(663 ^ [], 560 ^ [], thm)], [(665 ^ 4) ^ [561 ^ []] : [-(model(561 ^ [], 663 ^ []))]], [(598 ^ 2) ^ [thm, sap] : [-(status(663 ^ [], 560 ^ [], thm)), 599 ^ 2 : [(600 ^ 2) ^ [560 ^ [], 663 ^ []] : [status(663 ^ [], 560 ^ [], sap)]], -(nota(sap, thm))], [(60 ^ 5) ^ [560 ^ [], 663 ^ []] : [-(status(663 ^ [], 560 ^ [], sap)), 62 ^ 5 : [(63 ^ 5) ^ [] : [-(model(61 ^ [560 ^ [], 663 ^ []], 663 ^ []))], (65 ^ 5) ^ [564 ^ []] : [model(564 ^ [], 560 ^ [])]]], [(566 ^ 8) ^ [] : [-(model(564 ^ [], 560 ^ []))]]], [(689 ^ 3) ^ [] : [nota(sap, thm)]]]]]
1.44/2.29	
1.44/2.29	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
1.51/2.30	EOF