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