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.02/0.24	% Computer   : n138.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Fri Jul 13 14:52:49 CDT 2018
0.02/0.24	% CPUTime    : 
0.15/1.27	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/1.28	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/1.28	
0.15/1.28	- the following list represents a non-clausal connection proof
0.15/1.28	  (a tree in which each node is labelled with a nested clause)
0.15/1.28	- I^V is a skolem term f_I(V) for variable list V
0.15/1.28	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
0.15/1.28	  I is the unique index of C, K distinguishes different copies
0.15/1.28	  of C, and V is the list of (instantiated) variables in C
0.15/1.28	
0.15/1.28	[(804 ^ 0) ^ [n12, n12] : [less(n12, n12), 807 ^ 0 : [(808 ^ 0) ^ [] : [n12 = n12], (810 ^ 0) ^ [] : [less(n12, n12)]]], [(34 ^ 1) ^ [n12, n10, n12, nn26] : [-(less(n12, n12)), less(nn26, n10), nn26 = n12, n10 = n12], [(718 ^ 2) ^ [rdn(rdnn(n0), rdnn(n1)), rdn(rdnn(n6), rdnn(n2)), n10, nn26] : [-(less(nn26, n10)), rdn_translate(nn26, rdn_neg(rdn(rdnn(n6), rdnn(n2)))), rdn_translate(n10, rdn_pos(rdn(rdnn(n0), rdnn(n1))))], [(206 ^ 3) ^ [] : [-(rdn_translate(nn26, rdn_neg(rdn(rdnn(n6), rdnn(n2)))))]], [(204 ^ 3) ^ [] : [-(rdn_translate(n10, rdn_pos(rdn(rdnn(n0), rdnn(n1)))))]]], [(1312 ^ 2) ^ [nn26] : [-(nn26 = n12)]], [(1312 ^ 2) ^ [n10] : [-(n10 = n12)]]], [(1312 ^ 3) ^ [n12] : [-(n12 = n12)]]]
0.15/1.28	
0.15/1.29	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/1.29	EOF