%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN969+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:24 EDT 2023 % Result : Theorem 2.63s 1.07s % Output : Proof 3.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SYN969+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 17:02: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.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.63/0.60 Running up to 7 provers in parallel. % 0.71/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.71/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.71/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.71/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.71/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.71/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.71/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.76/0.90 Prover 1: Preprocessing ... % 1.76/0.90 Prover 4: Preprocessing ... % 2.05/0.94 Prover 5: Preprocessing ... % 2.05/0.94 Prover 6: Preprocessing ... % 2.05/0.94 Prover 3: Preprocessing ... % 2.05/0.94 Prover 0: Preprocessing ... % 2.05/0.94 Prover 2: Preprocessing ... % 2.05/1.00 Prover 5: Constructing countermodel ... % 2.05/1.00 Prover 2: Constructing countermodel ... % 2.05/1.01 Prover 3: Constructing countermodel ... % 2.05/1.01 Prover 6: Proving ... % 2.05/1.01 Prover 1: Constructing countermodel ... % 2.05/1.01 Prover 4: Constructing countermodel ... % 2.05/1.02 Prover 0: Proving ... % 2.63/1.07 Prover 5: proved (449ms) % 2.63/1.07 % 2.63/1.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.63/1.07 % 2.63/1.07 Prover 3: stopped % 2.63/1.07 Prover 2: stopped % 2.63/1.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.63/1.08 Prover 0: proved (470ms) % 2.63/1.08 % 2.63/1.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.63/1.08 % 3.13/1.09 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.13/1.09 Prover 6: stopped % 3.13/1.10 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.13/1.10 Prover 7: Preprocessing ... % 3.13/1.10 Prover 8: Preprocessing ... % 3.13/1.10 Prover 10: Preprocessing ... % 3.13/1.10 Prover 7: Constructing countermodel ... % 3.13/1.10 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.13/1.10 Prover 11: Preprocessing ... % 3.13/1.10 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.13/1.11 Prover 10: Constructing countermodel ... % 3.13/1.11 Prover 13: Preprocessing ... % 3.13/1.12 Prover 7: Found proof (size 5) % 3.13/1.12 Prover 7: proved (44ms) % 3.13/1.12 Prover 4: Found proof (size 13) % 3.13/1.12 Prover 4: proved (502ms) % 3.13/1.12 Prover 1: stopped % 3.13/1.12 Prover 10: stopped % 3.13/1.12 Prover 8: Warning: ignoring some quantifiers % 3.13/1.13 Prover 8: Constructing countermodel ... % 3.13/1.13 Prover 8: stopped % 3.13/1.13 Prover 13: Constructing countermodel ... % 3.13/1.13 Prover 13: stopped % 3.13/1.14 Prover 11: Constructing countermodel ... % 3.13/1.14 Prover 11: stopped % 3.13/1.14 % 3.13/1.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.13/1.14 % 3.13/1.15 % SZS output start Proof for theBenchmark % 3.13/1.15 Assumptions after simplification: % 3.13/1.15 --------------------------------- % 3.13/1.15 % 3.13/1.15 (prove_this) % 3.13/1.15 ? [v0: $i] : ($i(v0) & r(v0) & ~ q(v0) & ! [v1: $i] : ( ~ $i(v1) | ~ r(v1) % 3.13/1.15 | p(v1)) & ! [v1: $i] : ( ~ $i(v1) | ~ p(v1) | q(v1))) % 3.13/1.15 % 3.13/1.15 Those formulas are unsatisfiable: % 3.13/1.15 --------------------------------- % 3.13/1.15 % 3.13/1.15 Begin of proof % 3.13/1.15 | % 3.13/1.16 | DELTA: instantiating (prove_this) with fresh symbol all_2_0 gives: % 3.13/1.16 | (1) $i(all_2_0) & r(all_2_0) & ~ q(all_2_0) & ! [v0: $i] : ( ~ $i(v0) | % 3.13/1.16 | ~ r(v0) | p(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ p(v0) | q(v0)) % 3.13/1.16 | % 3.13/1.16 | ALPHA: (1) implies: % 3.13/1.16 | (2) ~ q(all_2_0) % 3.13/1.16 | (3) r(all_2_0) % 3.13/1.16 | (4) $i(all_2_0) % 3.13/1.16 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ p(v0) | q(v0)) % 3.13/1.16 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ r(v0) | p(v0)) % 3.13/1.16 | % 3.13/1.16 | GROUND_INST: instantiating (6) with all_2_0, simplifying with (3), (4) gives: % 3.13/1.16 | (7) p(all_2_0) % 3.13/1.16 | % 3.13/1.16 | GROUND_INST: instantiating (5) with all_2_0, simplifying with (2), (4), (7) % 3.13/1.16 | gives: % 3.13/1.16 | (8) $false % 3.13/1.16 | % 3.13/1.16 | CLOSE: (8) is inconsistent. % 3.13/1.16 | % 3.13/1.16 End of proof % 3.13/1.17 % SZS output end Proof for theBenchmark % 3.13/1.17 % 3.13/1.17 579ms %------------------------------------------------------------------------------