%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN976+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Fri Sep 1 03:29:26 EDT 2023 % Result : Theorem 2.98s 1.17s % Output : Proof 3.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN976+1 : TPTP v8.1.2. Released v3.1.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n002.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sat Aug 26 19:15:48 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.67 ________ _____ % 0.20/0.67 ___ __ \_________(_)________________________________ % 0.20/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.67 % 0.20/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.67 (2023-06-19) % 0.20/0.67 % 0.20/0.67 (c) Philipp Rümmer, 2009-2023 % 0.20/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.67 Amanda Stjerna. % 0.20/0.67 Free software under BSD-3-Clause. % 0.20/0.67 % 0.20/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.67 % 0.20/0.67 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.68 Running up to 7 provers in parallel. % 0.20/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.71 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.04/0.99 Prover 1: Preprocessing ... % 2.04/0.99 Prover 4: Preprocessing ... % 2.04/1.04 Prover 5: Preprocessing ... % 2.04/1.04 Prover 6: Preprocessing ... % 2.04/1.04 Prover 2: Preprocessing ... % 2.04/1.04 Prover 3: Preprocessing ... % 2.04/1.04 Prover 0: Preprocessing ... % 2.49/1.09 Prover 5: Proving ... % 2.49/1.09 Prover 2: Proving ... % 2.49/1.09 Prover 1: Constructing countermodel ... % 2.49/1.09 Prover 4: Constructing countermodel ... % 2.49/1.09 Prover 0: Proving ... % 2.49/1.09 Prover 6: Proving ... % 2.49/1.09 Prover 3: Constructing countermodel ... % 2.98/1.17 Prover 0: proved (479ms) % 2.98/1.17 % 2.98/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.98/1.17 % 2.98/1.17 Prover 3: proved (476ms) % 2.98/1.17 % 2.98/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.98/1.17 % 2.98/1.17 Prover 4: Found proof (size 5) % 2.98/1.17 Prover 1: Found proof (size 5) % 2.98/1.17 Prover 4: proved (471ms) % 2.98/1.17 Prover 1: proved (482ms) % 2.98/1.17 Prover 5: stopped % 2.98/1.17 Prover 6: stopped % 2.98/1.17 Prover 2: stopped % 2.98/1.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.98/1.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.98/1.18 Prover 7: Preprocessing ... % 2.98/1.18 Prover 8: Preprocessing ... % 2.98/1.19 Prover 7: Warning: ignoring some quantifiers % 2.98/1.19 Prover 7: Constructing countermodel ... % 2.98/1.19 Prover 7: stopped % 2.98/1.20 Prover 8: Warning: ignoring some quantifiers % 2.98/1.20 Prover 8: Constructing countermodel ... % 2.98/1.20 Prover 8: stopped % 2.98/1.20 % 2.98/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.98/1.20 % 2.98/1.21 % SZS output start Proof for theBenchmark % 2.98/1.21 Assumptions after simplification: % 2.98/1.21 --------------------------------- % 2.98/1.21 % 2.98/1.21 (prove_this) % 3.41/1.25 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & q(v0) = v1 & $i(v0) & ! [v2: $i] % 3.41/1.25 : ! [v3: int] : (v3 = 0 | ~ (q(v2) = v3) | ~ $i(v2)) & ! [v2: $i] : ! % 3.41/1.25 [v3: int] : (v3 = 0 | ~ (p(v2) = v3) | ~ $i(v2)) & (g | f)) % 3.41/1.25 % 3.41/1.25 Those formulas are unsatisfiable: % 3.41/1.25 --------------------------------- % 3.41/1.25 % 3.41/1.25 Begin of proof % 3.41/1.25 | % 3.41/1.26 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1 gives: % 3.41/1.26 | (1) ~ (all_3_0 = 0) & q(all_3_1) = all_3_0 & $i(all_3_1) & ! [v0: $i] : % 3.41/1.26 | ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ! % 3.41/1.26 | [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) & (g | f) % 3.41/1.26 | % 3.41/1.26 | ALPHA: (1) implies: % 3.41/1.26 | (2) ~ (all_3_0 = 0) % 3.41/1.26 | (3) $i(all_3_1) % 3.41/1.26 | (4) q(all_3_1) = all_3_0 % 3.41/1.26 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0)) % 3.41/1.26 | % 3.41/1.26 | GROUND_INST: instantiating (5) with all_3_1, all_3_0, simplifying with (3), % 3.41/1.26 | (4) gives: % 3.41/1.26 | (6) all_3_0 = 0 % 3.41/1.26 | % 3.41/1.26 | REDUCE: (2), (6) imply: % 3.41/1.26 | (7) $false % 3.41/1.27 | % 3.41/1.27 | CLOSE: (7) is inconsistent. % 3.41/1.27 | % 3.41/1.27 End of proof % 3.41/1.27 % SZS output end Proof for theBenchmark % 3.41/1.27 % 3.41/1.27 593ms %------------------------------------------------------------------------------