%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN051+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 : n011.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:20 EDT 2023 % Result : Theorem 3.06s 1.14s % Output : Proof 3.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN051+1 : TPTP v8.1.2. Released v2.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n011.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 20:31:24 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.62 ________ _____ % 0.19/0.62 ___ __ \_________(_)________________________________ % 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.62 % 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.62 (2023-06-19) % 0.19/0.62 % 0.19/0.62 (c) Philipp Rümmer, 2009-2023 % 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.62 Amanda Stjerna. % 0.19/0.62 Free software under BSD-3-Clause. % 0.19/0.62 % 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.62 % 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.63 Running up to 7 provers in parallel. % 0.19/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.47/0.93 Prover 1: Preprocessing ... % 1.47/0.93 Prover 4: Preprocessing ... % 2.16/1.00 Prover 6: Preprocessing ... % 2.16/1.00 Prover 5: Preprocessing ... % 2.16/1.00 Prover 2: Preprocessing ... % 2.16/1.00 Prover 3: Preprocessing ... % 2.16/1.00 Prover 0: Preprocessing ... % 2.46/1.03 Prover 4: Constructing countermodel ... % 2.46/1.03 Prover 1: Constructing countermodel ... % 2.56/1.05 Prover 3: Constructing countermodel ... % 2.56/1.05 Prover 0: Proving ... % 2.56/1.05 Prover 2: Proving ... % 2.56/1.05 Prover 6: Proving ... % 2.56/1.05 Prover 5: Proving ... % 3.06/1.14 Prover 0: proved (499ms) % 3.06/1.14 % 3.06/1.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.06/1.14 % 3.06/1.14 Prover 5: proved (494ms) % 3.06/1.14 % 3.06/1.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.06/1.14 % 3.06/1.14 Prover 6: stopped % 3.06/1.14 Prover 2: stopped % 3.06/1.14 Prover 3: stopped % 3.06/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.06/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.06/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.06/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.06/1.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.06/1.15 Prover 8: Preprocessing ... % 3.06/1.15 Prover 10: Preprocessing ... % 3.06/1.15 Prover 11: Preprocessing ... % 3.06/1.15 Prover 13: Preprocessing ... % 3.06/1.16 Prover 10: Warning: ignoring some quantifiers % 3.06/1.16 Prover 10: Constructing countermodel ... % 3.06/1.16 Prover 7: Preprocessing ... % 3.06/1.17 Prover 8: Warning: ignoring some quantifiers % 3.43/1.17 Prover 8: Constructing countermodel ... % 3.43/1.17 Prover 1: Found proof (size 19) % 3.43/1.17 Prover 1: proved (532ms) % 3.43/1.17 Prover 4: stopped % 3.43/1.17 Prover 8: stopped % 3.43/1.17 Prover 10: stopped % 3.43/1.17 Prover 7: Warning: ignoring some quantifiers % 3.43/1.17 Prover 7: Constructing countermodel ... % 3.43/1.18 Prover 7: stopped % 3.43/1.18 Prover 11: Constructing countermodel ... % 3.43/1.18 Prover 13: Warning: ignoring some quantifiers % 3.43/1.18 Prover 13: Constructing countermodel ... % 3.43/1.18 Prover 11: stopped % 3.43/1.18 Prover 13: stopped % 3.43/1.18 % 3.43/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.43/1.18 % 3.43/1.19 % SZS output start Proof for theBenchmark % 3.43/1.19 Assumptions after simplification: % 3.43/1.19 --------------------------------- % 3.43/1.19 % 3.43/1.19 (pel21) % 3.43/1.23 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_f(v0) = v1) | ~ $i(v0) | p) & % 3.43/1.23 ! [v0: $i] : ( ~ (big_f(v0) = 0) | ~ $i(v0) | ~ p) % 3.43/1.23 % 3.43/1.23 (pel21_1) % 3.43/1.23 ? [v0: $i] : ? [v1: any] : (big_f(v0) = v1 & $i(v0) & (v1 = 0 | ~ p)) % 3.43/1.23 % 3.43/1.23 (pel21_2) % 3.43/1.23 ? [v0: $i] : ? [v1: any] : (big_f(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | p)) % 3.43/1.23 % 3.43/1.23 Those formulas are unsatisfiable: % 3.43/1.23 --------------------------------- % 3.43/1.23 % 3.43/1.23 Begin of proof % 3.43/1.23 | % 3.43/1.23 | ALPHA: (pel21) implies: % 3.43/1.23 | (1) ! [v0: $i] : ( ~ (big_f(v0) = 0) | ~ $i(v0) | ~ p) % 3.43/1.23 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_f(v0) = v1) | ~ $i(v0) % 3.43/1.23 | | p) % 3.43/1.23 | % 3.43/1.23 | DELTA: instantiating (pel21_1) with fresh symbols all_4_0, all_4_1 gives: % 3.43/1.24 | (3) big_f(all_4_1) = all_4_0 & $i(all_4_1) & (all_4_0 = 0 | ~ p) % 3.43/1.24 | % 3.43/1.24 | ALPHA: (3) implies: % 3.43/1.24 | (4) $i(all_4_1) % 3.43/1.24 | (5) big_f(all_4_1) = all_4_0 % 3.43/1.24 | (6) all_4_0 = 0 | ~ p % 3.43/1.24 | % 3.43/1.24 | DELTA: instantiating (pel21_2) with fresh symbols all_6_0, all_6_1 gives: % 3.43/1.24 | (7) big_f(all_6_1) = all_6_0 & $i(all_6_1) & ( ~ (all_6_0 = 0) | p) % 3.43/1.24 | % 3.43/1.24 | ALPHA: (7) implies: % 3.43/1.24 | (8) $i(all_6_1) % 3.43/1.24 | (9) big_f(all_6_1) = all_6_0 % 3.43/1.24 | (10) ~ (all_6_0 = 0) | p % 3.43/1.24 | % 3.43/1.24 | GROUND_INST: instantiating (2) with all_6_1, all_6_0, simplifying with (8), % 3.43/1.24 | (9) gives: % 3.43/1.24 | (11) all_6_0 = 0 | p % 3.43/1.24 | % 3.43/1.24 | BETA: splitting (6) gives: % 3.43/1.24 | % 3.43/1.24 | Case 1: % 3.43/1.24 | | % 3.43/1.24 | | (12) ~ p % 3.43/1.24 | | % 3.43/1.24 | | BETA: splitting (10) gives: % 3.43/1.24 | | % 3.43/1.24 | | Case 1: % 3.43/1.24 | | | % 3.43/1.24 | | | (13) p % 3.43/1.24 | | | % 3.43/1.24 | | | PRED_UNIFY: (12), (13) imply: % 3.43/1.24 | | | (14) $false % 3.43/1.24 | | | % 3.43/1.24 | | | CLOSE: (14) is inconsistent. % 3.43/1.24 | | | % 3.43/1.24 | | Case 2: % 3.43/1.24 | | | % 3.43/1.24 | | | (15) ~ (all_6_0 = 0) % 3.43/1.24 | | | % 3.43/1.24 | | | BETA: splitting (11) gives: % 3.43/1.24 | | | % 3.43/1.24 | | | Case 1: % 3.43/1.24 | | | | % 3.43/1.24 | | | | (16) p % 3.43/1.24 | | | | % 3.43/1.24 | | | | PRED_UNIFY: (12), (16) imply: % 3.43/1.24 | | | | (17) $false % 3.43/1.24 | | | | % 3.43/1.24 | | | | CLOSE: (17) is inconsistent. % 3.43/1.24 | | | | % 3.43/1.24 | | | Case 2: % 3.43/1.24 | | | | % 3.43/1.24 | | | | (18) all_6_0 = 0 % 3.43/1.24 | | | | % 3.43/1.24 | | | | REDUCE: (15), (18) imply: % 3.43/1.24 | | | | (19) $false % 3.43/1.24 | | | | % 3.43/1.24 | | | | CLOSE: (19) is inconsistent. % 3.43/1.24 | | | | % 3.43/1.24 | | | End of split % 3.43/1.24 | | | % 3.43/1.24 | | End of split % 3.43/1.24 | | % 3.43/1.24 | Case 2: % 3.43/1.25 | | % 3.43/1.25 | | (20) all_4_0 = 0 % 3.43/1.25 | | (21) p % 3.43/1.25 | | % 3.43/1.25 | | REDUCE: (5), (20) imply: % 3.43/1.25 | | (22) big_f(all_4_1) = 0 % 3.43/1.25 | | % 3.43/1.25 | | GROUND_INST: instantiating (1) with all_4_1, simplifying with (4), (21), % 3.43/1.25 | | (22) gives: % 3.43/1.25 | | (23) $false % 3.43/1.25 | | % 3.43/1.25 | | CLOSE: (23) is inconsistent. % 3.43/1.25 | | % 3.43/1.25 | End of split % 3.43/1.25 | % 3.43/1.25 End of proof % 3.43/1.25 % SZS output end Proof for theBenchmark % 3.43/1.25 % 3.43/1.25 630ms %------------------------------------------------------------------------------