0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : princess-casc +printProof -timeout=%d %s 0.03/0.25 % Computer : n138.star.cs.uiowa.edu 0.03/0.25 % Model : x86_64 x86_64 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.25 % Memory : 32218.625MB 0.03/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.25 % CPULimit : 300 0.03/0.25 % DateTime : Sat Jul 14 04:27:55 CDT 2018 0.03/0.25 % CPUTime : 0.07/0.46 ________ _____ 0.07/0.46 ___ __ \_________(_)________________________________ 0.07/0.46 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ 0.07/0.46 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) 0.07/0.46 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ 0.07/0.46 0.07/0.46 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic 0.07/0.46 (CASC 2017-07-17) 0.07/0.46 0.07/0.46 (c) Philipp Rümmer, 2009-2017 0.07/0.46 (contributions by Peter Backeman, Peter Baumgartner, 0.07/0.46 Angelo Brillout, Aleksandar Zeljic) 0.07/0.46 Free software under GNU Lesser General Public License (LGPL). 0.07/0.46 Bug reports to ph_r@gmx.net 0.07/0.46 0.07/0.46 For more information, visit http://www.philipp.ruemmer.org/princess.shtml 0.07/0.46 0.07/0.47 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... 0.07/0.50 Prover 0: Options: +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 1.01/0.80 Prover 0: Warning: using theory to encode multiplication: GroebnerMultiplication 1.01/0.81 Prover 0: Preprocessing ... 1.01/0.86 Prover 0: Constructing countermodel ... 1.33/1.02 Prover 0: proved (525ms) 1.51/1.02 1.51/1.04 VALID 1.51/1.04 % SZS status Theorem for theBenchmark 1.51/1.04 1.51/1.04 Prover 1: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.51/1.04 Prover 1: Warning: using theory to encode multiplication: GroebnerMultiplication 1.51/1.04 Prover 1: Preprocessing ... 1.51/1.06 Prover 1: Constructing countermodel ... 1.69/1.11 Prover 1: Found proof (size 8) 1.69/1.12 Prover 1: proved (92ms) 1.69/1.12 1.69/1.12 1.69/1.12 % SZS output start Proof for theBenchmark 1.69/1.12 Assumptions after simplification: 1.69/1.12 --------------------------------- 1.69/1.12 1.69/1.12 (conj) 1.69/1.13 ? [v0: $int] : ? [v1: $int] : ( ~ (v1 = b) & $product(v0, c) = v1 & 1.69/1.13 $product(d, a) = v0) 1.69/1.13 1.69/1.13 (eq) 1.69/1.13 ? [v0: $int] : ($product(v0, d) = b & $product(a, c) = v0) 1.69/1.13 1.69/1.13 Those formulas are unsatisfiable: 1.69/1.13 --------------------------------- 1.69/1.13 1.69/1.13 Begin of proof 1.69/1.13 | 1.69/1.13 | DELTA: instantiating (conj) with fresh symbols all_0_0, all_0_1 gives: 1.69/1.13 | (1) ~ (all_0_0 = b) & $product(all_0_1, c) = all_0_0 & $product(d, a) = 1.69/1.13 | all_0_1 1.69/1.13 | 1.69/1.14 | ALPHA: (1) implies: 1.69/1.14 | (2) ~ (all_0_0 = b) 1.69/1.14 | (3) $product(d, a) = all_0_1 1.69/1.14 | (4) $product(all_0_1, c) = all_0_0 1.69/1.14 | 1.69/1.14 | DELTA: instantiating (eq) with fresh symbol all_2_0 gives: 1.69/1.14 | (5) $product(all_2_0, d) = b & $product(a, c) = all_2_0 1.69/1.14 | 1.69/1.14 | ALPHA: (5) implies: 1.69/1.14 | (6) $product(a, c) = all_2_0 1.69/1.14 | (7) $product(all_2_0, d) = b 1.69/1.14 | 1.69/1.14 | THEORY_AXIOM GroebnerMultiplication: 1.69/1.14 | (8) ! [v0: $int] : ! [v1: $int] : ! [v2: $int] : ! [v3: $int] : ! [v4: 1.69/1.14 | $int] : ! [v5: $int] : ! [v6: $int] : (v5 = v0 | ~ ($product(v6, 1.69/1.14 | v3) = v0) | ~ ($product(v4, v2) = v5) | ~ ($product(v3, v1) = 1.69/1.14 | v4) | ~ ($product(v1, v2) = v6)) 1.69/1.14 | 1.69/1.15 | GROUND_INST: instantiating (8) with b, a, c, d, all_0_1, all_0_0, all_2_0, 1.69/1.15 | simplifying with (3), (4), (6), (7) gives: 1.69/1.15 | (9) all_0_0 = b 1.69/1.15 | 1.69/1.15 | REDUCE: (2), (9) imply: 1.69/1.15 | (10) ~ (0 = 0) 1.69/1.15 | 1.69/1.15 | CLOSE: (10) is inconsistent. 1.69/1.15 | 1.69/1.15 End of proof 1.69/1.15 % SZS output end Proof for theBenchmark 1.69/1.15 1.69/1.15 673ms 1.79/1.18 EOF