%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS181+1 : TPTP v8.1.2. Bugfixed v5.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n023.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:51:33 EDT 2023 % Result : Theorem 6.84s 1.61s % Output : Proof 8.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : KRS181+1 : TPTP v8.1.2. Bugfixed v5.4.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n023.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 : Mon Aug 28 01:31:10 EDT 2023 % 0.14/0.35 % CPUTime : % 0.64/0.61 ________ _____ % 0.64/0.61 ___ __ \_________(_)________________________________ % 0.64/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.64/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.64/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.64/0.61 % 0.64/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.64/0.61 (2023-06-19) % 0.64/0.61 % 0.64/0.61 (c) Philipp Rümmer, 2009-2023 % 0.64/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.64/0.61 Amanda Stjerna. % 0.64/0.61 Free software under BSD-3-Clause. % 0.64/0.61 % 0.64/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.64/0.61 % 0.64/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.64/0.62 Running up to 7 provers in parallel. % 0.69/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.69/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.69/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.69/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.69/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.69/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.69/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.51/1.04 Prover 1: Preprocessing ... % 2.51/1.04 Prover 4: Preprocessing ... % 2.88/1.08 Prover 2: Preprocessing ... % 2.88/1.08 Prover 0: Preprocessing ... % 2.88/1.08 Prover 5: Preprocessing ... % 2.88/1.08 Prover 6: Preprocessing ... % 2.88/1.08 Prover 3: Preprocessing ... % 4.61/1.33 Prover 2: Proving ... % 4.61/1.35 Prover 5: Proving ... % 5.04/1.42 Prover 6: Proving ... % 5.71/1.48 Prover 3: Constructing countermodel ... % 5.94/1.50 Prover 1: Constructing countermodel ... % 5.94/1.50 Prover 0: Proving ... % 5.94/1.53 Prover 4: Constructing countermodel ... % 6.84/1.61 Prover 3: proved (966ms) % 6.84/1.61 % 6.84/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.84/1.61 % 6.84/1.61 Prover 2: stopped % 6.84/1.61 Prover 0: stopped % 6.84/1.61 Prover 6: stopped % 6.84/1.61 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.84/1.61 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.84/1.61 Prover 5: stopped % 6.84/1.62 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.84/1.62 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.84/1.62 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.84/1.66 Prover 8: Preprocessing ... % 6.84/1.66 Prover 7: Preprocessing ... % 6.84/1.67 Prover 13: Preprocessing ... % 6.84/1.67 Prover 10: Preprocessing ... % 7.36/1.68 Prover 11: Preprocessing ... % 7.36/1.71 Prover 1: Found proof (size 18) % 7.36/1.71 Prover 1: proved (1077ms) % 7.36/1.71 Prover 4: stopped % 7.36/1.72 Prover 10: Warning: ignoring some quantifiers % 7.36/1.72 Prover 13: Warning: ignoring some quantifiers % 7.36/1.72 Prover 7: Warning: ignoring some quantifiers % 7.36/1.73 Prover 10: Constructing countermodel ... % 7.36/1.73 Prover 13: Constructing countermodel ... % 7.36/1.73 Prover 7: Constructing countermodel ... % 7.36/1.73 Prover 10: stopped % 7.36/1.73 Prover 7: stopped % 7.36/1.73 Prover 13: stopped % 7.36/1.74 Prover 11: stopped % 7.36/1.76 Prover 8: Warning: ignoring some quantifiers % 7.98/1.77 Prover 8: Constructing countermodel ... % 7.98/1.78 Prover 8: stopped % 7.98/1.78 % 7.98/1.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.98/1.78 % 7.98/1.78 % SZS output start Proof for theBenchmark % 7.98/1.79 Assumptions after simplification: % 7.98/1.79 --------------------------------- % 7.98/1.79 % 7.98/1.79 (isa) % 8.13/1.82 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (isa(v0, v1) = v2) | % 8.13/1.82 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : ? [v5: int] : ( ~ (v5 = % 8.13/1.82 0) & status(v3, v4, v1) = v5 & status(v3, v4, v0) = 0 & $i(v4) & % 8.13/1.82 $i(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ (isa(v0, v1) = 0) | ~ $i(v1) | % 8.13/1.82 ~ $i(v0) | ! [v2: $i] : ! [v3: $i] : ( ~ (status(v2, v3, v0) = 0) | ~ % 8.13/1.82 $i(v3) | ~ $i(v2) | status(v2, v3, v1) = 0)) % 8.13/1.82 % 8.13/1.82 (nota) % 8.13/1.82 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (nota(v0, v1) = v2) | % 8.13/1.82 ~ $i(v1) | ~ $i(v0) | ! [v3: $i] : ! [v4: $i] : ( ~ (status(v3, v4, v0) = % 8.13/1.82 0) | ~ $i(v4) | ~ $i(v3) | status(v3, v4, v1) = 0)) & ! [v0: $i] : ! % 8.13/1.82 [v1: $i] : ( ~ (nota(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : ? % 8.13/1.82 [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & status(v2, v3, v1) = v4 & % 8.13/1.82 status(v2, v3, v0) = 0 & $i(v3) & $i(v2))) % 8.13/1.82 % 8.13/1.82 (nota_isa_nota) % 8.13/1.82 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 8.13/1.82 nota(v1, v2) = v3 & nota(v0, v2) = 0 & isa(v0, v1) = 0 & $i(v2) & $i(v1) & % 8.13/1.82 $i(v0)) % 8.13/1.82 % 8.13/1.82 (function-axioms) % 8.28/1.83 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.28/1.83 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (status(v4, v3, v2) = v1) | ~ % 8.28/1.83 (status(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.28/1.83 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (model(v3, % 8.28/1.83 v2) = v1) | ~ (model(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 8.28/1.83 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (xora(v3, % 8.28/1.83 v2) = v1) | ~ (xora(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 8.28/1.83 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 8.28/1.83 (nevera(v3, v2) = v1) | ~ (nevera(v3, v2) = v0)) & ! [v0: % 8.28/1.83 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.28/1.83 : (v1 = v0 | ~ (nota(v3, v2) = v1) | ~ (nota(v3, v2) = v0)) & ! [v0: % 8.28/1.83 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.28/1.83 : (v1 = v0 | ~ (isa(v3, v2) = v1) | ~ (isa(v3, v2) = v0)) & ! [v0: % 8.28/1.83 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.28/1.83 : (v1 = v0 | ~ (mighta(v3, v2) = v1) | ~ (mighta(v3, v2) = v0)) & ! [v0: % 8.28/1.83 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (not(v2) = v1) | ~ (not(v2) % 8.28/1.83 = v0)) % 8.28/1.83 % 8.28/1.83 Further assumptions not needed in the proof: % 8.28/1.83 -------------------------------------------- % 8.28/1.83 completeness, contradiction, mighta, mixed_pair, nevera, non_thm_spt, not, % 8.28/1.83 sat_non_taut_pair, satisfiable, tautology, xora % 8.28/1.83 % 8.28/1.83 Those formulas are unsatisfiable: % 8.28/1.83 --------------------------------- % 8.28/1.83 % 8.28/1.83 Begin of proof % 8.28/1.83 | % 8.28/1.83 | ALPHA: (isa) implies: % 8.28/1.84 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (isa(v0, v1) = 0) | ~ $i(v1) | ~ % 8.28/1.84 | $i(v0) | ! [v2: $i] : ! [v3: $i] : ( ~ (status(v2, v3, v0) = 0) | % 8.28/1.84 | ~ $i(v3) | ~ $i(v2) | status(v2, v3, v1) = 0)) % 8.28/1.84 | % 8.28/1.84 | ALPHA: (nota) implies: % 8.28/1.84 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (nota(v0, v1) = 0) | ~ $i(v1) | ~ % 8.28/1.84 | $i(v0) | ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & % 8.28/1.84 | status(v2, v3, v1) = v4 & status(v2, v3, v0) = 0 & $i(v3) & % 8.28/1.84 | $i(v2))) % 8.28/1.84 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (nota(v0, v1) = % 8.28/1.84 | v2) | ~ $i(v1) | ~ $i(v0) | ! [v3: $i] : ! [v4: $i] : ( ~ % 8.28/1.84 | (status(v3, v4, v0) = 0) | ~ $i(v4) | ~ $i(v3) | status(v3, v4, % 8.28/1.84 | v1) = 0)) % 8.28/1.84 | % 8.28/1.84 | ALPHA: (function-axioms) implies: % 8.28/1.84 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 8.28/1.84 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (status(v4, v3, v2) = v1) | % 8.28/1.84 | ~ (status(v4, v3, v2) = v0)) % 8.28/1.84 | % 8.28/1.84 | DELTA: instantiating (nota_isa_nota) with fresh symbols all_18_0, all_18_1, % 8.28/1.84 | all_18_2, all_18_3 gives: % 8.28/1.84 | (5) ~ (all_18_0 = 0) & nota(all_18_2, all_18_1) = all_18_0 & % 8.28/1.84 | nota(all_18_3, all_18_1) = 0 & isa(all_18_3, all_18_2) = 0 & % 8.28/1.84 | $i(all_18_1) & $i(all_18_2) & $i(all_18_3) % 8.28/1.84 | % 8.28/1.84 | ALPHA: (5) implies: % 8.28/1.85 | (6) ~ (all_18_0 = 0) % 8.28/1.85 | (7) $i(all_18_3) % 8.28/1.85 | (8) $i(all_18_2) % 8.28/1.85 | (9) $i(all_18_1) % 8.28/1.85 | (10) isa(all_18_3, all_18_2) = 0 % 8.28/1.85 | (11) nota(all_18_3, all_18_1) = 0 % 8.28/1.85 | (12) nota(all_18_2, all_18_1) = all_18_0 % 8.28/1.85 | % 8.28/1.85 | GROUND_INST: instantiating (1) with all_18_3, all_18_2, simplifying with (7), % 8.28/1.85 | (8), (10) gives: % 8.28/1.85 | (13) ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, all_18_3) = 0) | ~ % 8.28/1.85 | $i(v1) | ~ $i(v0) | status(v0, v1, all_18_2) = 0) % 8.28/1.85 | % 8.28/1.85 | GROUND_INST: instantiating (2) with all_18_3, all_18_1, simplifying with (7), % 8.28/1.85 | (9), (11) gives: % 8.28/1.85 | (14) ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & status(v0, % 8.28/1.85 | v1, all_18_1) = v2 & status(v0, v1, all_18_3) = 0 & $i(v1) & % 8.28/1.85 | $i(v0)) % 8.28/1.85 | % 8.28/1.85 | GROUND_INST: instantiating (3) with all_18_2, all_18_1, all_18_0, simplifying % 8.28/1.85 | with (8), (9), (12) gives: % 8.28/1.85 | (15) all_18_0 = 0 | ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, % 8.28/1.85 | all_18_2) = 0) | ~ $i(v1) | ~ $i(v0) | status(v0, v1, % 8.28/1.85 | all_18_1) = 0) % 8.28/1.85 | % 8.28/1.85 | DELTA: instantiating (14) with fresh symbols all_50_0, all_50_1, all_50_2 % 8.28/1.85 | gives: % 8.28/1.85 | (16) ~ (all_50_0 = 0) & status(all_50_2, all_50_1, all_18_1) = all_50_0 & % 8.28/1.85 | status(all_50_2, all_50_1, all_18_3) = 0 & $i(all_50_1) & $i(all_50_2) % 8.28/1.85 | % 8.28/1.85 | ALPHA: (16) implies: % 8.28/1.85 | (17) ~ (all_50_0 = 0) % 8.28/1.85 | (18) $i(all_50_2) % 8.28/1.85 | (19) $i(all_50_1) % 8.28/1.85 | (20) status(all_50_2, all_50_1, all_18_3) = 0 % 8.28/1.85 | (21) status(all_50_2, all_50_1, all_18_1) = all_50_0 % 8.28/1.85 | % 8.28/1.85 | BETA: splitting (15) gives: % 8.28/1.85 | % 8.28/1.85 | Case 1: % 8.28/1.85 | | % 8.28/1.85 | | (22) all_18_0 = 0 % 8.28/1.85 | | % 8.28/1.85 | | REDUCE: (6), (22) imply: % 8.28/1.85 | | (23) $false % 8.28/1.85 | | % 8.28/1.85 | | CLOSE: (23) is inconsistent. % 8.28/1.85 | | % 8.28/1.86 | Case 2: % 8.28/1.86 | | % 8.28/1.86 | | (24) ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, all_18_2) = 0) | ~ % 8.28/1.86 | | $i(v1) | ~ $i(v0) | status(v0, v1, all_18_1) = 0) % 8.28/1.86 | | % 8.28/1.86 | | GROUND_INST: instantiating (13) with all_50_2, all_50_1, simplifying with % 8.28/1.86 | | (18), (19), (20) gives: % 8.28/1.86 | | (25) status(all_50_2, all_50_1, all_18_2) = 0 % 8.28/1.86 | | % 8.28/1.86 | | GROUND_INST: instantiating (24) with all_50_2, all_50_1, simplifying with % 8.28/1.86 | | (18), (19), (25) gives: % 8.28/1.86 | | (26) status(all_50_2, all_50_1, all_18_1) = 0 % 8.28/1.86 | | % 8.28/1.86 | | GROUND_INST: instantiating (4) with all_50_0, 0, all_18_1, all_50_1, % 8.28/1.86 | | all_50_2, simplifying with (21), (26) gives: % 8.28/1.86 | | (27) all_50_0 = 0 % 8.28/1.86 | | % 8.28/1.86 | | REDUCE: (17), (27) imply: % 8.28/1.86 | | (28) $false % 8.28/1.86 | | % 8.28/1.86 | | CLOSE: (28) is inconsistent. % 8.28/1.86 | | % 8.28/1.86 | End of split % 8.28/1.86 | % 8.28/1.86 End of proof % 8.28/1.86 % SZS output end Proof for theBenchmark % 8.28/1.86 % 8.28/1.86 1246ms %------------------------------------------------------------------------------