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.24 % Computer : n062.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 : Sat Jul 14 04:17:10 CDT 2018 0.02/0.24 % CPUTime : 0.64/1.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.64/1.28 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.64/1.28 0.64/1.28 - the following list represents a non-clausal connection proof 0.64/1.28 (a tree in which each node is labelled with a nested clause) 0.64/1.28 - I^V is a skolem term f_I(V) for variable list V 0.64/1.28 - (I^K)^V:C is the (nested) clause C with index (I^K)^V, in which 0.64/1.28 I is the unique index of C, K distinguishes different copies 0.64/1.28 of C, and V is the list of (instantiated) variables in C 0.64/1.29 0.64/1.29 [(689 ^ 0) ^ [] : [mighta(sca, thm)], [(641 ^ 1) ^ [thm, sca] : [-(mighta(sca, thm)), 642 ^ 1 : [(643 ^ 1) ^ [532 ^ [], 660 ^ []] : [status(660 ^ [], 532 ^ [], sca), status(660 ^ [], 532 ^ [], thm)]]], [(122 ^ 4) ^ [532 ^ [], 660 ^ []] : [-(status(660 ^ [], 532 ^ [], sca)), -(model(125 ^ [532 ^ [], 660 ^ []], 660 ^ [])), 128 ^ 4 : [(129 ^ 4) ^ [535 ^ []] : [model(535 ^ [], 532 ^ [])]]], [(662 ^ 5) ^ [125 ^ [532 ^ [], 660 ^ []]] : [model(125 ^ [532 ^ [], 660 ^ []], 660 ^ [])]], [(537 ^ 7) ^ [] : [-(model(535 ^ [], 532 ^ []))]]], [(103 ^ 4) ^ [532 ^ [], 660 ^ []] : [-(status(660 ^ [], 532 ^ [], thm)), 105 ^ 4 : [(106 ^ 4) ^ [] : [-(model(104 ^ [532 ^ [], 660 ^ []], 660 ^ []))], (108 ^ 4) ^ [] : [model(104 ^ [532 ^ [], 660 ^ []], 532 ^ [])]]], [(662 ^ 7) ^ [104 ^ [532 ^ [], 660 ^ []]] : [model(104 ^ [532 ^ [], 660 ^ []], 660 ^ [])]]]]] 0.64/1.29 0.64/1.29 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.71/1.37 EOF