%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN405+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 : n010.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:33 EDT 2023 % Result : Theorem 2.83s 1.08s % Output : Proof 3.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN405+1 : TPTP v8.1.2. Released v2.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n010.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 21:42:05 EDT 2023 % 0.13/0.35 % CPUTime : % 0.21/0.59 ________ _____ % 0.21/0.59 ___ __ \_________(_)________________________________ % 0.21/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.59 % 0.21/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.59 (2023-06-19) % 0.21/0.59 % 0.21/0.59 (c) Philipp Rümmer, 2009-2023 % 0.21/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.59 Amanda Stjerna. % 0.21/0.59 Free software under BSD-3-Clause. % 0.21/0.59 % 0.21/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.59 % 0.21/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.60 Running up to 7 provers in parallel. % 0.21/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.67/0.90 Prover 1: Preprocessing ... % 1.67/0.90 Prover 4: Preprocessing ... % 2.09/0.96 Prover 6: Preprocessing ... % 2.09/0.96 Prover 3: Preprocessing ... % 2.09/0.96 Prover 2: Preprocessing ... % 2.09/0.96 Prover 5: Preprocessing ... % 2.09/0.96 Prover 0: Preprocessing ... % 2.30/1.00 Prover 2: Proving ... % 2.30/1.00 Prover 5: Proving ... % 2.30/1.00 Prover 6: Proving ... % 2.30/1.00 Prover 4: Constructing countermodel ... % 2.30/1.00 Prover 1: Constructing countermodel ... % 2.30/1.01 Prover 0: Proving ... % 2.30/1.01 Prover 3: Constructing countermodel ... % 2.83/1.08 Prover 2: proved (464ms) % 2.83/1.08 % 2.83/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.08 % 2.83/1.08 Prover 3: proved (462ms) % 2.83/1.08 % 2.83/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.08 % 2.83/1.08 Prover 0: proved (465ms) % 2.83/1.08 % 2.83/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.08 % 2.83/1.08 Prover 5: proved (461ms) % 2.83/1.08 % 2.83/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.08 % 2.83/1.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.83/1.08 Prover 6: stopped % 2.83/1.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.83/1.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.83/1.08 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.83/1.08 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.83/1.09 Prover 7: Preprocessing ... % 2.83/1.09 Prover 8: Preprocessing ... % 2.83/1.09 Prover 1: Found proof (size 9) % 2.83/1.09 Prover 1: proved (479ms) % 2.83/1.09 Prover 11: Preprocessing ... % 2.83/1.09 Prover 4: Found proof (size 8) % 2.83/1.09 Prover 4: proved (477ms) % 2.83/1.09 Prover 10: Preprocessing ... % 2.83/1.09 Prover 7: Warning: ignoring some quantifiers % 2.83/1.10 Prover 13: Preprocessing ... % 2.83/1.10 Prover 7: Constructing countermodel ... % 2.83/1.10 Prover 7: stopped % 2.83/1.10 Prover 10: Warning: ignoring some quantifiers % 2.83/1.10 Prover 10: Constructing countermodel ... % 2.83/1.10 Prover 10: stopped % 2.83/1.10 Prover 13: Warning: ignoring some quantifiers % 2.83/1.10 Prover 13: Constructing countermodel ... % 2.83/1.11 Prover 13: stopped % 2.83/1.11 Prover 8: Warning: ignoring some quantifiers % 2.83/1.11 Prover 8: Constructing countermodel ... % 2.83/1.11 Prover 8: stopped % 2.83/1.12 Prover 11: Constructing countermodel ... % 2.83/1.12 Prover 11: stopped % 2.83/1.12 % 2.83/1.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.83/1.12 % 3.30/1.12 % SZS output start Proof for theBenchmark % 3.30/1.12 Assumptions after simplification: % 3.30/1.12 --------------------------------- % 3.30/1.12 % 3.30/1.12 (kalish239) % 3.30/1.16 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (f(v0) = v1) | ~ $i(v0)) & ! [v0: % 3.30/1.16 $i] : ( ~ (g(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & f(v0) = % 3.30/1.16 v1)) & ? [v0: $i] : (g(v0) = 0 & $i(v0)) % 3.30/1.16 % 3.30/1.16 Those formulas are unsatisfiable: % 3.30/1.16 --------------------------------- % 3.30/1.16 % 3.30/1.16 Begin of proof % 3.30/1.16 | % 3.30/1.16 | ALPHA: (kalish239) implies: % 3.41/1.17 | (1) ! [v0: $i] : ( ~ (g(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) % 3.41/1.17 | & f(v0) = v1)) % 3.41/1.17 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (f(v0) = v1) | ~ $i(v0)) % 3.41/1.17 | (3) ? [v0: $i] : (g(v0) = 0 & $i(v0)) % 3.41/1.17 | % 3.41/1.17 | DELTA: instantiating (3) with fresh symbol all_4_0 gives: % 3.41/1.17 | (4) g(all_4_0) = 0 & $i(all_4_0) % 3.41/1.17 | % 3.41/1.17 | ALPHA: (4) implies: % 3.41/1.17 | (5) $i(all_4_0) % 3.41/1.17 | (6) g(all_4_0) = 0 % 3.41/1.17 | % 3.41/1.17 | GROUND_INST: instantiating (1) with all_4_0, simplifying with (5), (6) gives: % 3.41/1.17 | (7) ? [v0: int] : ( ~ (v0 = 0) & f(all_4_0) = v0) % 3.41/1.17 | % 3.41/1.17 | DELTA: instantiating (7) with fresh symbol all_11_0 gives: % 3.41/1.17 | (8) ~ (all_11_0 = 0) & f(all_4_0) = all_11_0 % 3.41/1.17 | % 3.41/1.17 | ALPHA: (8) implies: % 3.41/1.17 | (9) ~ (all_11_0 = 0) % 3.41/1.17 | (10) f(all_4_0) = all_11_0 % 3.41/1.17 | % 3.41/1.17 | GROUND_INST: instantiating (2) with all_4_0, all_11_0, simplifying with (5), % 3.41/1.18 | (10) gives: % 3.41/1.18 | (11) all_11_0 = 0 % 3.41/1.18 | % 3.41/1.18 | REDUCE: (9), (11) imply: % 3.41/1.18 | (12) $false % 3.41/1.18 | % 3.41/1.18 | CLOSE: (12) is inconsistent. % 3.41/1.18 | % 3.41/1.18 End of proof % 3.41/1.18 % SZS output end Proof for theBenchmark % 3.41/1.18 % 3.41/1.18 583ms %------------------------------------------------------------------------------