%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN062+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:25 EDT 2023 % Result : Theorem 3.15s 1.14s % Output : Proof 3.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN062+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 18:42:24 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.48/0.94 Prover 1: Preprocessing ... % 1.48/0.94 Prover 4: Preprocessing ... % 2.16/0.99 Prover 0: Preprocessing ... % 2.16/0.99 Prover 3: Preprocessing ... % 2.16/0.99 Prover 6: Preprocessing ... % 2.16/0.99 Prover 2: Preprocessing ... % 2.16/0.99 Prover 5: Preprocessing ... % 2.65/1.06 Prover 2: Constructing countermodel ... % 2.65/1.06 Prover 5: Constructing countermodel ... % 2.65/1.06 Prover 6: Constructing countermodel ... % 2.65/1.07 Prover 1: Constructing countermodel ... % 2.65/1.09 Prover 3: Constructing countermodel ... % 2.65/1.11 Prover 4: Constructing countermodel ... % 3.15/1.13 Prover 5: proved (498ms) % 3.15/1.14 % 3.15/1.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.15/1.14 % 3.15/1.14 Prover 6: stopped % 3.15/1.14 Prover 2: stopped % 3.15/1.14 Prover 3: stopped % 3.15/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.15/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.15/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.15/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.15/1.16 Prover 10: Preprocessing ... % 3.15/1.16 Prover 7: Preprocessing ... % 3.15/1.16 Prover 8: Preprocessing ... % 3.48/1.17 Prover 0: Proving ... % 3.48/1.17 Prover 10: Constructing countermodel ... % 3.48/1.17 Prover 7: Constructing countermodel ... % 3.48/1.18 Prover 0: stopped % 3.48/1.18 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.48/1.19 Prover 13: Preprocessing ... % 3.48/1.19 Prover 11: Preprocessing ... % 3.48/1.21 Prover 13: Constructing countermodel ... % 3.48/1.21 Prover 10: Found proof (size 7) % 3.48/1.21 Prover 10: proved (70ms) % 3.48/1.21 Prover 11: stopped % 3.48/1.21 Prover 13: stopped % 3.48/1.21 Prover 7: stopped % 3.48/1.22 Prover 1: stopped % 3.48/1.22 Prover 4: stopped % 3.48/1.22 Prover 8: Warning: ignoring some quantifiers % 3.48/1.22 Prover 8: Constructing countermodel ... % 3.48/1.23 Prover 8: stopped % 3.48/1.23 % 3.48/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.48/1.23 % 3.48/1.24 % SZS output start Proof for theBenchmark % 3.48/1.24 Assumptions after simplification: % 3.48/1.24 --------------------------------- % 3.48/1.24 % 3.48/1.24 (pel32) % 3.48/1.24 ? [v0: $i] : ($i(v0) & big_k(v0) & big_f(v0) & ~ big_j(v0)) % 3.48/1.24 % 3.48/1.24 (pel32_1) % 3.97/1.25 ! [v0: $i] : ( ~ $i(v0) | ~ big_h(v0) | ~ big_f(v0) | big_i(v0)) & ! [v0: % 3.97/1.25 $i] : ( ~ $i(v0) | ~ big_g(v0) | ~ big_f(v0) | big_i(v0)) % 3.97/1.25 % 3.97/1.25 (pel32_2) % 3.97/1.25 ! [v0: $i] : ( ~ $i(v0) | ~ big_i(v0) | ~ big_h(v0) | big_j(v0)) % 3.97/1.25 % 3.97/1.25 (pel32_3) % 3.97/1.25 ! [v0: $i] : ( ~ $i(v0) | ~ big_k(v0) | big_h(v0)) % 3.97/1.25 % 3.97/1.25 Those formulas are unsatisfiable: % 3.97/1.25 --------------------------------- % 3.97/1.25 % 3.97/1.25 Begin of proof % 3.97/1.25 | % 3.97/1.25 | ALPHA: (pel32_1) implies: % 3.97/1.25 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ big_h(v0) | ~ big_f(v0) | big_i(v0)) % 3.97/1.25 | % 3.97/1.25 | DELTA: instantiating (pel32) with fresh symbol all_5_0 gives: % 3.97/1.25 | (2) $i(all_5_0) & big_k(all_5_0) & big_f(all_5_0) & ~ big_j(all_5_0) % 3.97/1.25 | % 3.97/1.25 | ALPHA: (2) implies: % 3.97/1.25 | (3) ~ big_j(all_5_0) % 3.97/1.26 | (4) big_f(all_5_0) % 3.97/1.26 | (5) big_k(all_5_0) % 3.97/1.26 | (6) $i(all_5_0) % 3.97/1.26 | % 3.97/1.26 | GROUND_INST: instantiating (pel32_3) with all_5_0, simplifying with (5), (6) % 3.97/1.26 | gives: % 3.97/1.26 | (7) big_h(all_5_0) % 3.97/1.26 | % 3.97/1.26 | GROUND_INST: instantiating (1) with all_5_0, simplifying with (4), (6), (7) % 3.97/1.26 | gives: % 3.97/1.26 | (8) big_i(all_5_0) % 3.97/1.26 | % 3.97/1.26 | GROUND_INST: instantiating (pel32_2) with all_5_0, simplifying with (3), (6), % 3.97/1.26 | (7), (8) gives: % 3.97/1.26 | (9) $false % 3.97/1.26 | % 3.97/1.26 | CLOSE: (9) is inconsistent. % 3.97/1.26 | % 3.97/1.26 End of proof % 3.97/1.26 % SZS output end Proof for theBenchmark % 3.97/1.26 % 3.97/1.26 654ms %------------------------------------------------------------------------------