%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN064+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 : n001.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:26:26 EDT 2023 % Result : Theorem 2.64s 1.18s % Output : Proof 3.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN064+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.14/0.34 % Computer : n001.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Sat Aug 26 21:33:31 EDT 2023 % 0.14/0.34 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.43/0.99 Prover 4: Preprocessing ... % 1.43/0.99 Prover 1: Preprocessing ... % 2.00/1.03 Prover 2: Preprocessing ... % 2.00/1.03 Prover 6: Preprocessing ... % 2.00/1.03 Prover 0: Preprocessing ... % 2.00/1.03 Prover 3: Preprocessing ... % 2.00/1.03 Prover 5: Preprocessing ... % 2.00/1.06 Prover 1: Warning: ignoring some quantifiers % 2.00/1.06 Prover 3: Warning: ignoring some quantifiers % 2.00/1.07 Prover 4: Constructing countermodel ... % 2.00/1.07 Prover 3: Constructing countermodel ... % 2.00/1.07 Prover 1: Constructing countermodel ... % 2.00/1.07 Prover 5: Proving ... % 2.00/1.07 Prover 2: Proving ... % 2.00/1.07 Prover 0: Proving ... % 2.00/1.07 Prover 6: Proving ... % 2.64/1.15 Prover 4: Found proof (size 6) % 2.64/1.16 Prover 4: proved (508ms) % 2.64/1.16 Prover 1: gave up % 2.64/1.16 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.64/1.16 Prover 0: proved (519ms) % 2.64/1.16 Prover 2: proved (517ms) % 2.64/1.16 Prover 6: stopped % 2.64/1.16 Prover 5: stopped % 2.64/1.16 Prover 3: stopped % 2.64/1.17 Prover 7: Preprocessing ... % 2.64/1.18 Prover 7: Warning: ignoring some quantifiers % 2.64/1.18 Prover 7: Constructing countermodel ... % 2.64/1.18 Prover 7: stopped % 2.64/1.18 % 2.64/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.64/1.18 % 2.64/1.18 % SZS output start Proof for theBenchmark % 2.64/1.19 Assumptions after simplification: % 2.64/1.19 --------------------------------- % 2.64/1.19 % 2.64/1.19 (pel35) % 3.16/1.23 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (big_p(v0, v1) = v2) | % 3.16/1.23 ~ $i(v1) | ~ $i(v0)) & ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 % 3.16/1.23 = 0) & big_p(v0, v1) = v2 & $i(v1) & $i(v0)) % 3.16/1.23 % 3.16/1.23 Those formulas are unsatisfiable: % 3.16/1.23 --------------------------------- % 3.16/1.23 % 3.16/1.23 Begin of proof % 3.16/1.23 | % 3.16/1.23 | ALPHA: (pel35) implies: % 3.16/1.23 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (big_p(v0, v1) % 3.16/1.23 | = v2) | ~ $i(v1) | ~ $i(v0)) % 3.16/1.23 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & big_p(v0, v1) % 3.16/1.23 | = v2 & $i(v1) & $i(v0)) % 3.16/1.23 | % 3.16/1.24 | DELTA: instantiating (2) with fresh symbols all_4_0, all_4_1, all_4_2 gives: % 3.16/1.24 | (3) ~ (all_4_0 = 0) & big_p(all_4_2, all_4_1) = all_4_0 & $i(all_4_1) & % 3.16/1.24 | $i(all_4_2) % 3.16/1.24 | % 3.16/1.24 | ALPHA: (3) implies: % 3.16/1.24 | (4) ~ (all_4_0 = 0) % 3.16/1.24 | (5) $i(all_4_2) % 3.16/1.24 | (6) $i(all_4_1) % 3.16/1.24 | (7) big_p(all_4_2, all_4_1) = all_4_0 % 3.16/1.24 | % 3.16/1.24 | GROUND_INST: instantiating (1) with all_4_2, all_4_1, all_4_0, simplifying % 3.16/1.24 | with (5), (6), (7) gives: % 3.16/1.24 | (8) all_4_0 = 0 % 3.16/1.24 | % 3.16/1.24 | REDUCE: (4), (8) imply: % 3.16/1.24 | (9) $false % 3.16/1.24 | % 3.16/1.24 | CLOSE: (9) is inconsistent. % 3.16/1.24 | % 3.16/1.24 End of proof % 3.16/1.24 % SZS output end Proof for theBenchmark % 3.16/1.24 % 3.16/1.24 622ms %------------------------------------------------------------------------------