%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN054+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 : n025.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:21 EDT 2023 % Result : Theorem 3.70s 1.26s % Output : Proof 4.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN054+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 : n025.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 22:07:53 EDT 2023 % 0.13/0.34 % 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.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 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 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 % 1.98/1.01 Prover 1: Preprocessing ... % 1.98/1.01 Prover 4: Preprocessing ... % 2.35/1.05 Prover 2: Preprocessing ... % 2.35/1.05 Prover 6: Preprocessing ... % 2.35/1.05 Prover 5: Preprocessing ... % 2.35/1.05 Prover 0: Preprocessing ... % 2.35/1.06 Prover 3: Preprocessing ... % 2.80/1.13 Prover 5: Proving ... % 2.80/1.13 Prover 2: Constructing countermodel ... % 2.80/1.14 Prover 3: Constructing countermodel ... % 2.80/1.14 Prover 6: Proving ... % 3.10/1.15 Prover 1: Constructing countermodel ... % 3.10/1.17 Prover 4: Constructing countermodel ... % 3.10/1.19 Prover 0: Proving ... % 3.10/1.23 Prover 3: gave up % 3.10/1.23 Prover 1: gave up % 3.10/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.10/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.70/1.26 Prover 8: Preprocessing ... % 3.70/1.26 Prover 7: Preprocessing ... % 3.70/1.26 Prover 2: proved (630ms) % 3.70/1.26 % 3.70/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.70/1.26 % 3.70/1.27 Prover 5: stopped % 3.70/1.27 Prover 6: stopped % 3.70/1.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.70/1.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.70/1.27 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.70/1.27 Prover 7: Constructing countermodel ... % 3.70/1.27 Prover 0: stopped % 4.00/1.29 Prover 13: Preprocessing ... % 4.00/1.29 Prover 11: Preprocessing ... % 4.00/1.29 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.00/1.30 Prover 10: Preprocessing ... % 4.00/1.30 Prover 16: Preprocessing ... % 4.00/1.30 Prover 13: Constructing countermodel ... % 4.00/1.31 Prover 8: Warning: ignoring some quantifiers % 4.00/1.31 Prover 8: Constructing countermodel ... % 4.00/1.31 Prover 7: Found proof (size 10) % 4.00/1.31 Prover 7: proved (81ms) % 4.00/1.31 Prover 4: stopped % 4.00/1.31 Prover 13: stopped % 4.00/1.31 Prover 8: stopped % 4.00/1.31 Prover 10: Constructing countermodel ... % 4.00/1.32 Prover 16: Constructing countermodel ... % 4.00/1.32 Prover 16: stopped % 4.00/1.33 Prover 10: stopped % 4.00/1.36 Prover 11: Constructing countermodel ... % 4.00/1.36 Prover 11: stopped % 4.00/1.36 % 4.00/1.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.00/1.36 % 4.00/1.37 % SZS output start Proof for theBenchmark % 4.00/1.37 Assumptions after simplification: % 4.00/1.37 --------------------------------- % 4.00/1.37 % 4.00/1.37 (pel24) % 4.00/1.37 ! [v0: $i] : ( ~ $i(v0) | ~ big_r(v0) | ~ big_p(v0)) % 4.00/1.37 % 4.00/1.37 (pel24_1) % 4.00/1.37 ! [v0: $i] : ( ~ $i(v0) | ~ big_q(v0) | ~ big_s(v0)) % 4.00/1.37 % 4.00/1.37 (pel24_2) % 4.00/1.38 ! [v0: $i] : ( ~ $i(v0) | ~ big_p(v0) | big_r(v0) | big_q(v0)) % 4.00/1.38 % 4.00/1.38 (pel24_3) % 4.00/1.38 ? [v0: $i] : ($i(v0) & (big_p(v0) | big_q(v0))) % 4.00/1.38 % 4.00/1.38 (pel24_4) % 4.00/1.38 ! [v0: $i] : ( ~ $i(v0) | ~ big_r(v0) | big_s(v0)) & ! [v0: $i] : ( ~ % 4.00/1.38 $i(v0) | ~ big_q(v0) | big_s(v0)) % 4.00/1.38 % 4.00/1.38 Those formulas are unsatisfiable: % 4.00/1.38 --------------------------------- % 4.00/1.38 % 4.00/1.38 Begin of proof % 4.00/1.38 | % 4.00/1.38 | ALPHA: (pel24_4) implies: % 4.00/1.38 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ big_q(v0) | big_s(v0)) % 4.00/1.38 | % 4.00/1.38 | DELTA: instantiating (pel24_3) with fresh symbol all_6_0 gives: % 4.00/1.38 | (2) $i(all_6_0) & (big_p(all_6_0) | big_q(all_6_0)) % 4.00/1.38 | % 4.00/1.38 | ALPHA: (2) implies: % 4.00/1.38 | (3) $i(all_6_0) % 4.00/1.38 | (4) big_p(all_6_0) | big_q(all_6_0) % 4.00/1.38 | % 4.00/1.38 | BETA: splitting (4) gives: % 4.00/1.38 | % 4.00/1.38 | Case 1: % 4.00/1.38 | | % 4.00/1.38 | | (5) big_q(all_6_0) % 4.00/1.38 | | % 4.00/1.38 | | GROUND_INST: instantiating (1) with all_6_0, simplifying with (3), (5) % 4.00/1.38 | | gives: % 4.00/1.38 | | (6) big_s(all_6_0) % 4.00/1.38 | | % 4.00/1.38 | | GROUND_INST: instantiating (pel24_1) with all_6_0, simplifying with (3), % 4.00/1.38 | | (5), (6) gives: % 4.00/1.38 | | (7) $false % 4.00/1.39 | | % 4.00/1.39 | | CLOSE: (7) is inconsistent. % 4.00/1.39 | | % 4.00/1.39 | Case 2: % 4.00/1.39 | | % 4.00/1.39 | | (8) ~ big_q(all_6_0) % 4.00/1.39 | | (9) big_p(all_6_0) % 4.00/1.39 | | % 4.00/1.39 | | GROUND_INST: instantiating (pel24_2) with all_6_0, simplifying with (3), % 4.00/1.39 | | (8), (9) gives: % 4.00/1.39 | | (10) big_r(all_6_0) % 4.00/1.39 | | % 4.00/1.39 | | GROUND_INST: instantiating (pel24) with all_6_0, simplifying with (3), (9), % 4.00/1.39 | | (10) gives: % 4.00/1.39 | | (11) $false % 4.00/1.39 | | % 4.00/1.39 | | CLOSE: (11) is inconsistent. % 4.00/1.39 | | % 4.00/1.39 | End of split % 4.00/1.39 | % 4.00/1.39 End of proof % 4.00/1.39 % SZS output end Proof for theBenchmark % 4.00/1.39 % 4.00/1.39 779ms %------------------------------------------------------------------------------