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