%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN055+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 : n027.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:22 EDT 2023 % Result : Theorem 3.32s 1.20s % Output : Proof 3.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN055+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.14/0.35 % Computer : n027.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sat Aug 26 20:59:50 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.00/0.98 Prover 4: Preprocessing ... % 2.00/0.98 Prover 1: Preprocessing ... % 2.00/1.03 Prover 3: Preprocessing ... % 2.00/1.03 Prover 2: Preprocessing ... % 2.00/1.03 Prover 5: Preprocessing ... % 2.00/1.03 Prover 0: Preprocessing ... % 2.00/1.03 Prover 6: Preprocessing ... % 2.60/1.12 Prover 5: Constructing countermodel ... % 2.60/1.12 Prover 2: Constructing countermodel ... % 2.60/1.13 Prover 1: Constructing countermodel ... % 2.60/1.13 Prover 6: Proving ... % 2.60/1.13 Prover 3: Constructing countermodel ... % 3.08/1.16 Prover 4: Constructing countermodel ... % 3.32/1.19 Prover 2: proved (563ms) % 3.32/1.20 % 3.32/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.32/1.20 % 3.32/1.20 Prover 3: gave up % 3.32/1.20 Prover 5: stopped % 3.32/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.32/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.32/1.20 Prover 0: Proving ... % 3.32/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.32/1.20 Prover 6: stopped % 3.32/1.21 Prover 0: stopped % 3.32/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.32/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.32/1.22 Prover 1: gave up % 3.32/1.23 Prover 8: Preprocessing ... % 3.32/1.23 Prover 10: Preprocessing ... % 3.32/1.23 Prover 7: Preprocessing ... % 3.32/1.23 Prover 11: Preprocessing ... % 3.71/1.23 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 3.71/1.23 Prover 13: Preprocessing ... % 3.71/1.25 Prover 7: Constructing countermodel ... % 3.71/1.25 Prover 10: Constructing countermodel ... % 3.71/1.25 Prover 13: Constructing countermodel ... % 3.71/1.25 Prover 16: Preprocessing ... % 3.71/1.27 Prover 8: Warning: ignoring some quantifiers % 3.71/1.28 Prover 16: Constructing countermodel ... % 3.71/1.28 Prover 8: Constructing countermodel ... % 3.71/1.29 Prover 13: Found proof (size 8) % 3.71/1.29 Prover 13: proved (78ms) % 3.71/1.29 Prover 16: stopped % 3.71/1.29 Prover 8: stopped % 3.71/1.29 Prover 4: stopped % 3.71/1.29 Prover 10: stopped % 3.71/1.29 Prover 7: stopped % 3.71/1.32 Prover 11: Constructing countermodel ... % 3.71/1.33 Prover 11: stopped % 3.71/1.33 % 3.71/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.71/1.33 % 3.71/1.33 % SZS output start Proof for theBenchmark % 3.71/1.34 Assumptions after simplification: % 3.71/1.34 --------------------------------- % 3.71/1.34 % 3.71/1.34 (pel25_1) % 3.71/1.34 ? [v0: $i] : ($i(v0) & big_p(v0)) % 3.71/1.34 % 3.71/1.34 (pel25_2) % 3.71/1.34 ! [v0: $i] : ( ~ $i(v0) | ~ big_g(v0) | ~ big_f(v0)) & ! [v0: $i] : ( ~ % 3.71/1.34 $i(v0) | ~ big_f(v0) | big_r(v0)) % 3.71/1.34 % 3.71/1.34 (pel25_3) % 3.71/1.34 ! [v0: $i] : ( ~ $i(v0) | ~ big_p(v0) | big_g(v0)) & ! [v0: $i] : ( ~ % 3.71/1.34 $i(v0) | ~ big_p(v0) | big_f(v0)) % 3.71/1.34 % 3.71/1.34 Further assumptions not needed in the proof: % 3.71/1.34 -------------------------------------------- % 3.71/1.34 pel25, pel25_4 % 3.71/1.34 % 3.71/1.34 Those formulas are unsatisfiable: % 3.71/1.34 --------------------------------- % 3.71/1.34 % 3.71/1.34 Begin of proof % 3.71/1.35 | % 3.71/1.35 | ALPHA: (pel25_3) implies: % 3.71/1.35 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ big_p(v0) | big_f(v0)) % 3.71/1.35 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ big_p(v0) | big_g(v0)) % 3.71/1.35 | % 3.71/1.35 | ALPHA: (pel25_2) implies: % 3.71/1.35 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ big_g(v0) | ~ big_f(v0)) % 3.71/1.35 | % 3.71/1.35 | DELTA: instantiating (pel25_1) with fresh symbol all_5_0 gives: % 3.71/1.35 | (4) $i(all_5_0) & big_p(all_5_0) % 3.71/1.35 | % 3.71/1.35 | ALPHA: (4) implies: % 3.71/1.35 | (5) big_p(all_5_0) % 3.71/1.35 | (6) $i(all_5_0) % 3.71/1.35 | % 3.71/1.35 | GROUND_INST: instantiating (2) with all_5_0, simplifying with (5), (6) gives: % 3.71/1.35 | (7) big_g(all_5_0) % 3.71/1.35 | % 3.71/1.35 | GROUND_INST: instantiating (1) with all_5_0, simplifying with (5), (6) gives: % 3.71/1.35 | (8) big_f(all_5_0) % 3.71/1.35 | % 3.71/1.35 | GROUND_INST: instantiating (3) with all_5_0, simplifying with (6), (7), (8) % 3.71/1.35 | gives: % 3.71/1.36 | (9) $false % 3.71/1.36 | % 3.71/1.36 | CLOSE: (9) is inconsistent. % 3.71/1.36 | % 3.71/1.36 End of proof % 3.71/1.36 % SZS output end Proof for theBenchmark % 3.71/1.36 % 3.71/1.36 747ms %------------------------------------------------------------------------------