%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN963+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 : n005.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:23 EDT 2023 % Result : Theorem 2.63s 1.13s % Output : Proof 3.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SYN963+1 : TPTP v8.1.2. Released v3.1.0. % 0.08/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n005.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sat Aug 26 19:10:53 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 1.64/0.97 Prover 4: Preprocessing ... % 1.64/0.97 Prover 1: Preprocessing ... % 2.15/1.02 Prover 6: Preprocessing ... % 2.15/1.02 Prover 3: Preprocessing ... % 2.15/1.02 Prover 2: Preprocessing ... % 2.15/1.02 Prover 5: Preprocessing ... % 2.15/1.02 Prover 0: Preprocessing ... % 2.15/1.06 Prover 1: Constructing countermodel ... % 2.15/1.06 Prover 4: Constructing countermodel ... % 2.15/1.06 Prover 5: Constructing countermodel ... % 2.15/1.06 Prover 2: Constructing countermodel ... % 2.15/1.06 Prover 0: Proving ... % 2.15/1.06 Prover 6: Proving ... % 2.15/1.07 Prover 3: Constructing countermodel ... % 2.63/1.12 Prover 2: proved (483ms) % 2.63/1.12 Prover 5: proved (473ms) % 2.63/1.12 % 2.63/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.63/1.13 % 2.63/1.13 % 2.63/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.63/1.13 % 2.63/1.13 Prover 3: proved (476ms) % 2.63/1.13 % 2.63/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.63/1.13 % 2.63/1.13 Prover 6: stopped % 2.63/1.13 Prover 0: stopped % 2.63/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.63/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.63/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.63/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.63/1.14 Prover 7: Preprocessing ... % 2.63/1.14 Prover 10: Preprocessing ... % 2.63/1.14 Prover 4: Found proof (size 4) % 2.63/1.14 Prover 1: Found proof (size 5) % 2.63/1.14 Prover 1: proved (497ms) % 2.63/1.14 Prover 4: proved (491ms) % 2.63/1.14 Prover 8: Preprocessing ... % 2.63/1.14 Prover 10: Constructing countermodel ... % 2.63/1.14 Prover 7: Constructing countermodel ... % 2.63/1.14 Prover 11: Preprocessing ... % 2.63/1.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.63/1.15 Prover 7: stopped % 2.63/1.15 Prover 10: stopped % 2.63/1.15 Prover 13: Preprocessing ... % 2.63/1.15 Prover 8: Warning: ignoring some quantifiers % 2.63/1.15 Prover 8: Constructing countermodel ... % 2.63/1.16 Prover 13: Constructing countermodel ... % 2.63/1.16 Prover 13: stopped % 2.63/1.16 Prover 8: stopped % 2.63/1.16 Prover 11: Constructing countermodel ... % 2.63/1.17 Prover 11: stopped % 2.63/1.17 % 2.63/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.63/1.17 % 2.63/1.17 % SZS output start Proof for theBenchmark % 2.63/1.17 Assumptions after simplification: % 2.63/1.17 --------------------------------- % 2.63/1.17 % 2.63/1.17 (prove_this) % 3.28/1.21 ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0)) & ? [v0: $i] : (p(v0) = 0 & % 3.28/1.21 $i(v0)) % 3.28/1.21 % 3.28/1.21 Those formulas are unsatisfiable: % 3.28/1.21 --------------------------------- % 3.28/1.21 % 3.28/1.21 Begin of proof % 3.28/1.21 | % 3.28/1.21 | ALPHA: (prove_this) implies: % 3.28/1.22 | (1) ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0)) % 3.28/1.22 | (2) ? [v0: $i] : (p(v0) = 0 & $i(v0)) % 3.28/1.22 | % 3.28/1.22 | DELTA: instantiating (2) with fresh symbol all_4_0 gives: % 3.28/1.22 | (3) p(all_4_0) = 0 & $i(all_4_0) % 3.28/1.22 | % 3.28/1.22 | ALPHA: (3) implies: % 3.28/1.22 | (4) $i(all_4_0) % 3.28/1.22 | (5) p(all_4_0) = 0 % 3.28/1.22 | % 3.28/1.22 | GROUND_INST: instantiating (1) with all_4_0, simplifying with (4), (5) gives: % 3.28/1.22 | (6) $false % 3.28/1.22 | % 3.28/1.22 | CLOSE: (6) is inconsistent. % 3.28/1.22 | % 3.28/1.22 End of proof % 3.28/1.22 % SZS output end Proof for theBenchmark % 3.28/1.22 % 3.28/1.22 604ms %------------------------------------------------------------------------------