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   : n067.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:41:55 CDT 2018
0.02/0.23	% CPUTime    : 
0.58/1.27	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.58/1.27	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.58/1.27	
0.58/1.27	- the following list represents a non-clausal connection proof
0.58/1.27	  (a tree in which each node is labelled with a nested clause)
0.58/1.27	- I^V is a skolem term f_I(V) for variable list V
0.58/1.27	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
0.58/1.27	  I is the unique index of C, K distinguishes different copies
0.58/1.27	  of C, and V is the list of (instantiated) variables in C
0.58/1.27	
0.58/1.27	[(311 ^ 0) ^ [580 ^ [thm, tca], 579 ^ [thm, tca]] : [status(579 ^ [thm, tca], 580 ^ [thm, tca], tca), 314 ^ 0 : [(315 ^ 0) ^ [104 ^ [580 ^ [thm, tca], 579 ^ [thm, tca]]] : [model(104 ^ [580 ^ [thm, tca], 579 ^ [thm, tca]], 579 ^ [thm, tca])]]], [(578 ^ 1) ^ [thm, tca] : [-(status(579 ^ [thm, tca], 580 ^ [thm, tca], tca)), 581 ^ 1 : [(582 ^ 1) ^ [] : []], -(isa(tca, thm))], [(689 ^ 2) ^ [] : [isa(tca, thm)]]], [(103 ^ 3) ^ [580 ^ [thm, tca], 579 ^ [thm, tca]] : [-(model(104 ^ [580 ^ [thm, tca], 579 ^ [thm, tca]], 579 ^ [thm, tca])), 105 ^ 3 : [(106 ^ 3) ^ [] : []], -(status(579 ^ [thm, tca], 580 ^ [thm, tca], thm))], [(578 ^ 4) ^ [thm, tca] : [status(579 ^ [thm, tca], 580 ^ [thm, tca], thm), 581 ^ 4 : [(584 ^ 4) ^ [] : []], -(isa(tca, thm))], [(689 ^ 5) ^ [] : [isa(tca, thm)]]]]]
0.58/1.28	
0.58/1.28	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.58/1.28	EOF