0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : nanocop_casc.sh %s %d
0.12/0.33	% Computer   : n008.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 09:15:23 EDT 2019
0.12/0.33	% CPUTime    : 
0.61/1.40	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.61/1.41	% SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.61/1.41	
0.61/1.41	- the following list represents a non-clausal connection proof
0.61/1.41	  (a tree in which each node is labelled with a nested clause)
0.61/1.41	- I^V is a skolem term f_I(V) for variable list V
0.61/1.41	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
0.61/1.41	  I is the unique index of C, K distinguishes different copies
0.61/1.41	  of C, and V is the list of (instantiated) variables in C
0.61/1.42	
0.61/1.42	[(22507 ^ 0) ^ [c74, c73, 16530 ^ [n374bernehmen_1_1, annahme_1_1, c25], c73, c74, c73] : [attr(c73, c74), sub(c73, firma_1_1), val(c74, bmw_0), subs(16530 ^ [n374bernehmen_1_1, annahme_1_1, c25], n374bernehmen_1_1), sub(c74, name_1_1), attr(c73, c74)], [(22165 ^ 1) ^ [] : [-(attr(c73, c74))]], [(22495 ^ 1) ^ [] : [-(sub(c73, firma_1_1))]], [(22493 ^ 1) ^ [] : [-(val(c74, bmw_0))]], [(16523 ^ 1) ^ [n374bernehmen_1_1, annahme_1_1, c25] : [-(subs(16530 ^ [n374bernehmen_1_1, annahme_1_1, c25], n374bernehmen_1_1)), 16531 ^ 1 : [(16534 ^ 1) ^ [] : []], chea(n374bernehmen_1_1, annahme_1_1), subs(c25, annahme_1_1)], [(14669 ^ 2) ^ [] : [-(chea(n374bernehmen_1_1, annahme_1_1))]], [(22501 ^ 2) ^ [] : [-(subs(c25, annahme_1_1))]]], [(22167 ^ 1) ^ [] : [-(sub(c74, name_1_1))]], [(22165 ^ 1) ^ [] : [-(attr(c73, c74))]]]
0.61/1.42	
0.61/1.42	% SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.61/1.43	EOF