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.03/0.24	% Computer   : n141.star.cs.uiowa.edu
0.03/0.24	% Model      : x86_64 x86_64
0.03/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.24	% Memory     : 32218.625MB
0.03/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.24	% CPULimit   : 300
0.03/0.24	% DateTime   : Sat Jul 14 05:29:10 CDT 2018
0.03/0.24	% CPUTime    : 
45.32/45.14	% SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
45.32/45.15	% SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
45.32/45.15	
45.32/45.15	- the following list represents a non-clausal connection proof
45.32/45.15	  (a tree in which each node is labelled with a nested clause)
45.32/45.15	- I^V is a skolem term f_I(V) for variable list V
45.32/45.15	- (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which
45.32/45.15	  I is the unique index of C, K distinguishes different copies
45.32/45.15	  of C, and V is the list of (instantiated) variables in C
45.32/45.15	
45.32/45.15	[(52779 ^ 0) ^ [52789 ^ [], 52788 ^ []] : [v_fun1(52788 ^ [], 52789 ^ []), 52782 ^ 0 : [(52783 ^ 0) ^ [52792 ^ []] : [c_Natural_Oevaln(v_com, 52789 ^ [], hAPP(c_Nat_OSuc, v_n), 52792 ^ []), -(v_fun2(52788 ^ [], 52792 ^ []))]]], [(52791 ^ 1) ^ [] : [-(v_fun1(52788 ^ [], 52789 ^ []))]], [(45927 ^ 3) ^ [v_com, 52789 ^ [], v_n, 52792 ^ []] : [-(c_Natural_Oevaln(v_com, 52789 ^ [], hAPP(c_Nat_OSuc, v_n), 52792 ^ [])), c_Natural_Oevaln(v_com, 52789 ^ [], v_n, 52792 ^ [])], [(52794 ^ 4) ^ [] : [-(c_Natural_Oevaln(v_com, 52789 ^ [], v_n, 52792 ^ []))]]], [(52796 ^ 3) ^ [] : [v_fun2(52788 ^ [], 52792 ^ [])]]]
45.32/45.15	
45.32/45.15	% SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
45.32/45.16	EOF