%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KLE051+1 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n006.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 : Thu Aug 31 05:34:23 EDT 2023 % Result : Theorem 5.20s 1.47s % Output : Proof 6.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : KLE051+1 : TPTP v8.1.2. Released v4.0.0. % 0.12/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n006.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 11:39:51 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.61 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 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 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 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 % 2.14/1.02 Prover 1: Preprocessing ... % 2.14/1.02 Prover 4: Preprocessing ... % 2.14/1.05 Prover 3: Preprocessing ... % 2.14/1.05 Prover 2: Preprocessing ... % 2.14/1.06 Prover 5: Preprocessing ... % 2.14/1.06 Prover 6: Preprocessing ... % 2.14/1.06 Prover 0: Preprocessing ... % 4.57/1.37 Prover 6: Constructing countermodel ... % 4.57/1.38 Prover 1: Constructing countermodel ... % 4.57/1.38 Prover 4: Constructing countermodel ... % 4.57/1.38 Prover 3: Constructing countermodel ... % 5.20/1.42 Prover 5: Proving ... % 5.20/1.42 Prover 0: Proving ... % 5.20/1.47 Prover 6: proved (833ms) % 5.20/1.47 % 5.20/1.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.20/1.47 % 5.20/1.48 Prover 3: stopped % 5.20/1.48 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.20/1.48 Prover 5: stopped % 5.20/1.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.20/1.48 Prover 0: stopped % 5.71/1.49 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.71/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.71/1.51 Prover 1: Found proof (size 5) % 5.71/1.51 Prover 1: proved (888ms) % 5.71/1.51 Prover 4: Found proof (size 5) % 5.71/1.51 Prover 4: proved (880ms) % 5.71/1.51 Prover 7: Preprocessing ... % 5.71/1.52 Prover 11: Preprocessing ... % 5.71/1.52 Prover 10: Preprocessing ... % 5.71/1.53 Prover 8: Preprocessing ... % 5.71/1.53 Prover 2: Proving ... % 5.71/1.53 Prover 2: stopped % 5.71/1.54 Prover 7: stopped % 5.71/1.54 Prover 11: stopped % 5.71/1.55 Prover 10: stopped % 6.28/1.58 Prover 8: Warning: ignoring some quantifiers % 6.35/1.59 Prover 8: Constructing countermodel ... % 6.35/1.59 Prover 8: stopped % 6.35/1.59 % 6.35/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.35/1.60 % 6.35/1.60 % SZS output start Proof for theBenchmark % 6.35/1.60 Assumptions after simplification: % 6.35/1.60 --------------------------------- % 6.35/1.60 % 6.35/1.60 (additive_idempotence) % 6.55/1.63 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (addition(v0, v0) = v1) | ~ $i(v0)) % 6.55/1.63 % 6.55/1.63 (goals) % 6.55/1.63 ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & addition(v0, v0) = v1 & $i(v1) & % 6.55/1.63 $i(v0)) % 6.55/1.63 % 6.55/1.63 Further assumptions not needed in the proof: % 6.55/1.63 -------------------------------------------- % 6.55/1.63 additive_associativity, additive_commutativity, additive_identity, domain1, % 6.55/1.63 domain2, domain3, domain4, domain5, left_annihilation, left_distributivity, % 6.55/1.63 multiplicative_associativity, multiplicative_left_identity, % 6.55/1.63 multiplicative_right_identity, order, right_annihilation, right_distributivity % 6.55/1.63 % 6.55/1.63 Those formulas are unsatisfiable: % 6.55/1.63 --------------------------------- % 6.55/1.63 % 6.55/1.63 Begin of proof % 6.55/1.63 | % 6.55/1.64 | DELTA: instantiating (goals) with fresh symbols all_20_0, all_20_1 gives: % 6.55/1.64 | (1) ~ (all_20_0 = all_20_1) & addition(all_20_1, all_20_1) = all_20_0 & % 6.55/1.64 | $i(all_20_0) & $i(all_20_1) % 6.55/1.64 | % 6.55/1.64 | ALPHA: (1) implies: % 6.55/1.64 | (2) ~ (all_20_0 = all_20_1) % 6.55/1.64 | (3) $i(all_20_1) % 6.55/1.64 | (4) addition(all_20_1, all_20_1) = all_20_0 % 6.55/1.64 | % 6.55/1.64 | GROUND_INST: instantiating (additive_idempotence) with all_20_1, all_20_0, % 6.55/1.64 | simplifying with (3), (4) gives: % 6.55/1.64 | (5) all_20_0 = all_20_1 % 6.55/1.64 | % 6.55/1.64 | REDUCE: (2), (5) imply: % 6.55/1.64 | (6) $false % 6.55/1.64 | % 6.55/1.64 | CLOSE: (6) is inconsistent. % 6.55/1.64 | % 6.55/1.64 End of proof % 6.55/1.64 % SZS output end Proof for theBenchmark % 6.55/1.64 % 6.55/1.64 1044ms %------------------------------------------------------------------------------