%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN925+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 : n009.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:14 EDT 2023 % Result : Theorem 2.50s 1.05s % Output : Proof 2.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SYN925+1 : TPTP v8.1.2. Released v3.1.0. % 0.10/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n009.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sat Aug 26 18:33:35 EDT 2023 % 0.12/0.33 % CPUTime : % 0.19/0.58 ________ _____ % 0.19/0.58 ___ __ \_________(_)________________________________ % 0.19/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.58 (2023-06-19) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2023 % 0.19/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.58 Amanda Stjerna. % 0.19/0.58 Free software under BSD-3-Clause. % 0.19/0.58 % 0.19/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.59 Running up to 7 provers in parallel. % 0.19/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.69/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 1.68/0.89 Prover 1: Preprocessing ... % 1.85/0.89 Prover 4: Preprocessing ... % 2.05/0.93 Prover 0: Preprocessing ... % 2.05/0.93 Prover 2: Preprocessing ... % 2.05/0.93 Prover 5: Preprocessing ... % 2.05/0.93 Prover 6: Preprocessing ... % 2.05/0.93 Prover 3: Preprocessing ... % 2.05/0.95 Prover 1: Warning: ignoring some quantifiers % 2.05/0.95 Prover 3: Warning: ignoring some quantifiers % 2.05/0.96 Prover 4: Constructing countermodel ... % 2.05/0.97 Prover 1: Constructing countermodel ... % 2.05/0.97 Prover 3: Constructing countermodel ... % 2.05/0.97 Prover 2: Proving ... % 2.05/0.97 Prover 6: Proving ... % 2.05/0.97 Prover 5: Proving ... % 2.05/0.97 Prover 0: Proving ... % 2.50/1.04 Prover 2: proved (440ms) % 2.50/1.05 % 2.50/1.05 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.50/1.05 % 2.50/1.05 Prover 0: proved (444ms) % 2.50/1.05 % 2.50/1.05 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.50/1.05 % 2.50/1.05 Prover 5: stopped % 2.50/1.05 Prover 6: stopped % 2.50/1.05 Prover 3: gave up % 2.50/1.05 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.50/1.05 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.50/1.05 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.50/1.05 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.50/1.05 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.50/1.06 Prover 10: Preprocessing ... % 2.50/1.06 Prover 8: Preprocessing ... % 2.50/1.06 Prover 13: Preprocessing ... % 2.50/1.06 Prover 7: Preprocessing ... % 2.50/1.06 Prover 4: Found proof (size 6) % 2.50/1.06 Prover 4: proved (454ms) % 2.50/1.06 Prover 11: Preprocessing ... % 2.50/1.06 Prover 10: Warning: ignoring some quantifiers % 2.50/1.07 Prover 10: Constructing countermodel ... % 2.50/1.07 Prover 7: Warning: ignoring some quantifiers % 2.50/1.07 Prover 13: Warning: ignoring some quantifiers % 2.50/1.07 Prover 7: Constructing countermodel ... % 2.50/1.07 Prover 10: stopped % 2.50/1.07 Prover 13: Constructing countermodel ... % 2.50/1.07 Prover 7: stopped % 2.50/1.07 Prover 1: stopped % 2.50/1.07 Prover 13: stopped % 2.97/1.07 Prover 11: Constructing countermodel ... % 2.97/1.07 Prover 8: Warning: ignoring some quantifiers % 2.97/1.07 Prover 11: stopped % 2.97/1.08 Prover 8: Constructing countermodel ... % 2.97/1.08 Prover 8: stopped % 2.97/1.08 % 2.97/1.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.97/1.08 % 2.97/1.08 % SZS output start Proof for theBenchmark % 2.97/1.08 Assumptions after simplification: % 2.97/1.08 --------------------------------- % 2.97/1.08 % 2.97/1.08 (prove_this) % 2.97/1.13 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) & ? [v0: % 2.97/1.13 $i] : ? [v1: int] : ( ~ (v1 = 0) & p(v0) = v1 & $i(v0)) % 2.97/1.13 % 2.97/1.13 Those formulas are unsatisfiable: % 2.97/1.13 --------------------------------- % 2.97/1.13 % 2.97/1.13 Begin of proof % 2.97/1.13 | % 2.97/1.13 | ALPHA: (prove_this) implies: % 2.97/1.13 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 2.97/1.13 | (2) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & p(v0) = v1 & $i(v0)) % 2.97/1.13 | % 2.97/1.13 | DELTA: instantiating (2) with fresh symbols all_4_0, all_4_1 gives: % 2.97/1.13 | (3) ~ (all_4_0 = 0) & p(all_4_1) = all_4_0 & $i(all_4_1) % 2.97/1.13 | % 2.97/1.13 | ALPHA: (3) implies: % 2.97/1.13 | (4) ~ (all_4_0 = 0) % 2.97/1.13 | (5) $i(all_4_1) % 2.97/1.13 | (6) p(all_4_1) = all_4_0 % 2.97/1.13 | % 2.97/1.13 | GROUND_INST: instantiating (1) with all_4_1, all_4_0, simplifying with (5), % 2.97/1.13 | (6) gives: % 2.97/1.13 | (7) all_4_0 = 0 % 2.97/1.13 | % 2.97/1.13 | REDUCE: (4), (7) imply: % 2.97/1.13 | (8) $false % 2.97/1.13 | % 2.97/1.14 | CLOSE: (8) is inconsistent. % 2.97/1.14 | % 2.97/1.14 End of proof % 2.97/1.14 % SZS output end Proof for theBenchmark % 2.97/1.14 % 2.97/1.14 554ms %------------------------------------------------------------------------------