%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN357+1 : TPTP v8.1.2. Released v2.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n024.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:27:20 EDT 2023 % Result : Theorem 2.83s 1.23s % Output : Proof 2.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SYN357+1 : TPTP v8.1.2. Released v2.0.0. % 0.13/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n024.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 18:52:24 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.64 ________ _____ % 0.21/0.64 ___ __ \_________(_)________________________________ % 0.21/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.64 % 0.21/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.64 (2023-06-19) % 0.21/0.64 % 0.21/0.64 (c) Philipp Rümmer, 2009-2023 % 0.21/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.64 Amanda Stjerna. % 0.21/0.64 Free software under BSD-3-Clause. % 0.21/0.64 % 0.21/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.64 % 0.21/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.65 Running up to 7 provers in parallel. % 0.21/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.88/1.08 Prover 1: Preprocessing ... % 1.88/1.08 Prover 4: Preprocessing ... % 2.08/1.12 Prover 6: Preprocessing ... % 2.08/1.12 Prover 3: Preprocessing ... % 2.08/1.12 Prover 2: Preprocessing ... % 2.08/1.12 Prover 5: Preprocessing ... % 2.08/1.12 Prover 0: Preprocessing ... % 2.39/1.16 Prover 1: Warning: ignoring some quantifiers % 2.39/1.16 Prover 3: Warning: ignoring some quantifiers % 2.39/1.16 Prover 1: Constructing countermodel ... % 2.39/1.16 Prover 4: Constructing countermodel ... % 2.39/1.17 Prover 2: Constructing countermodel ... % 2.39/1.17 Prover 3: Constructing countermodel ... % 2.39/1.17 Prover 6: Proving ... % 2.39/1.17 Prover 5: Proving ... % 2.39/1.17 Prover 0: Proving ... % 2.83/1.23 Prover 2: proved (556ms) % 2.83/1.23 % 2.83/1.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.23 % 2.83/1.23 Prover 3: stopped % 2.83/1.23 Prover 6: stopped % 2.83/1.23 Prover 0: proved (570ms) % 2.83/1.23 % 2.83/1.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.23 % 2.83/1.23 Prover 5: stopped % 2.83/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.83/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.83/1.23 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.83/1.23 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.83/1.24 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.83/1.24 Prover 4: Found proof (size 4) % 2.83/1.24 Prover 4: proved (561ms) % 2.83/1.24 Prover 1: stopped % 2.83/1.24 Prover 7: Preprocessing ... % 2.83/1.24 Prover 8: Preprocessing ... % 2.83/1.24 Prover 10: Preprocessing ... % 2.83/1.24 Prover 7: Constructing countermodel ... % 2.83/1.25 Prover 10: Constructing countermodel ... % 2.83/1.25 Prover 7: stopped % 2.83/1.25 Prover 10: stopped % 2.83/1.25 Prover 13: Preprocessing ... % 2.83/1.25 Prover 11: Preprocessing ... % 2.83/1.25 Prover 8: Warning: ignoring some quantifiers % 2.83/1.25 Prover 8: Constructing countermodel ... % 2.83/1.26 Prover 13: Constructing countermodel ... % 2.83/1.26 Prover 13: stopped % 2.83/1.26 Prover 8: stopped % 2.83/1.26 Prover 11: Constructing countermodel ... % 2.83/1.26 Prover 11: stopped % 2.83/1.26 % 2.83/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.26 % 2.83/1.27 % SZS output start Proof for theBenchmark % 2.83/1.27 Assumptions after simplification: % 2.83/1.27 --------------------------------- % 2.83/1.27 % 2.83/1.27 (x2108) % 2.83/1.31 ? [v0: $i] : (big_p(v0) = 0 & $i(v0) & ! [v1: $i] : ( ~ (big_p(v1) = 0) | ~ % 2.83/1.31 $i(v1))) % 2.83/1.31 % 2.83/1.31 Those formulas are unsatisfiable: % 2.83/1.31 --------------------------------- % 2.83/1.31 % 2.83/1.31 Begin of proof % 2.83/1.31 | % 2.83/1.31 | DELTA: instantiating (x2108) with fresh symbol all_3_0 gives: % 2.83/1.31 | (1) big_p(all_3_0) = 0 & $i(all_3_0) & ! [v0: $i] : ( ~ (big_p(v0) = 0) | % 2.83/1.31 | ~ $i(v0)) % 2.83/1.31 | % 2.83/1.31 | ALPHA: (1) implies: % 2.83/1.31 | (2) $i(all_3_0) % 2.83/1.31 | (3) big_p(all_3_0) = 0 % 2.83/1.31 | (4) ! [v0: $i] : ( ~ (big_p(v0) = 0) | ~ $i(v0)) % 2.83/1.31 | % 2.83/1.32 | GROUND_INST: instantiating (4) with all_3_0, simplifying with (2), (3) gives: % 2.83/1.32 | (5) $false % 2.83/1.32 | % 2.83/1.32 | CLOSE: (5) is inconsistent. % 2.83/1.32 | % 2.83/1.32 End of proof % 2.83/1.32 % SZS output end Proof for theBenchmark % 2.83/1.32 % 2.83/1.32 678ms %------------------------------------------------------------------------------