%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS071+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n005.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:08 EDT 2023 % Result : Unsatisfiable 7.81s 1.89s % Output : Proof 11.99s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : KRS071+1 : TPTP v8.1.2. Released v3.1.0. % 0.11/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.33 % Computer : n005.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Mon Aug 28 01:41:53 EDT 2023 % 0.11/0.33 % CPUTime : % 0.17/0.62 ________ _____ % 0.17/0.62 ___ __ \_________(_)________________________________ % 0.17/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.62 % 0.17/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.62 (2023-06-19) % 0.17/0.62 % 0.17/0.62 (c) Philipp Rümmer, 2009-2023 % 0.17/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.62 Amanda Stjerna. % 0.17/0.62 Free software under BSD-3-Clause. % 0.17/0.62 % 0.17/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.62 % 0.17/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.17/0.64 Running up to 7 provers in parallel. % 0.17/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.17/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.61/1.17 Prover 4: Preprocessing ... % 2.61/1.17 Prover 1: Preprocessing ... % 3.26/1.22 Prover 2: Preprocessing ... % 3.26/1.22 Prover 0: Preprocessing ... % 3.26/1.22 Prover 5: Preprocessing ... % 3.26/1.22 Prover 3: Preprocessing ... % 3.26/1.22 Prover 6: Preprocessing ... % 6.06/1.65 Prover 5: Proving ... % 6.06/1.65 Prover 2: Proving ... % 6.59/1.70 Prover 1: Constructing countermodel ... % 6.59/1.74 Prover 6: Proving ... % 6.59/1.75 Prover 3: Constructing countermodel ... % 7.81/1.89 Prover 5: proved (1240ms) % 7.81/1.89 % 7.81/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.81/1.89 % 7.81/1.89 Prover 2: stopped % 7.81/1.89 Prover 6: stopped % 7.81/1.89 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.81/1.89 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.81/1.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.01/1.90 Prover 3: stopped % 8.01/1.91 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.21/1.95 Prover 10: Preprocessing ... % 8.21/1.96 Prover 4: Constructing countermodel ... % 8.21/1.97 Prover 0: Proving ... % 8.21/1.97 Prover 0: stopped % 8.21/1.98 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.21/1.99 Prover 7: Preprocessing ... % 8.21/1.99 Prover 8: Preprocessing ... % 8.21/2.00 Prover 11: Preprocessing ... % 8.21/2.04 Prover 10: Warning: ignoring some quantifiers % 8.21/2.05 Prover 10: Constructing countermodel ... % 8.21/2.06 Prover 13: Preprocessing ... % 8.21/2.07 Prover 1: gave up % 8.21/2.09 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.46/2.14 Prover 7: Warning: ignoring some quantifiers % 9.46/2.15 Prover 7: Constructing countermodel ... % 9.46/2.15 Prover 16: Preprocessing ... % 9.46/2.16 Prover 13: Warning: ignoring some quantifiers % 9.46/2.17 Prover 13: Constructing countermodel ... % 10.23/2.26 Prover 8: Warning: ignoring some quantifiers % 10.23/2.27 Prover 16: Warning: ignoring some quantifiers % 10.23/2.27 Prover 8: Constructing countermodel ... % 10.23/2.28 Prover 16: Constructing countermodel ... % 10.77/2.32 Prover 7: Found proof (size 28) % 10.77/2.32 Prover 7: proved (427ms) % 10.77/2.32 Prover 4: stopped % 10.77/2.32 Prover 8: stopped % 10.77/2.32 Prover 13: stopped % 10.77/2.32 Prover 16: stopped % 10.77/2.33 Prover 10: Found proof (size 29) % 10.77/2.33 Prover 10: proved (431ms) % 11.59/2.46 Prover 11: Constructing countermodel ... % 11.59/2.48 Prover 11: stopped % 11.59/2.48 % 11.59/2.48 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.59/2.48 % 11.59/2.49 % SZS output start Proof for theBenchmark % 11.59/2.49 Assumptions after simplification: % 11.59/2.49 --------------------------------- % 11.59/2.49 % 11.59/2.49 (axiom_2) % 11.99/2.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | v3 = v1 | % 11.99/2.51 v2 = v1 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v3) | ~ % 11.99/2.51 rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0)) & ! [v0: $i] : ! [v1: % 11.99/2.51 $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 11.99/2.51 $i(v0) | ~ rr(v0, v3) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cp3(v1) | ~ % 11.99/2.51 cp2(v2) | ~ cp1(v3) | cUnsatisfiable(v0) | ? [v4: $i] : ? [v5: $i] : ? % 11.99/2.51 [v6: $i] : ( ~ (v6 = v5) & ~ (v6 = v4) & ~ (v5 = v4) & $i(v6) & $i(v5) & % 11.99/2.51 $i(v4) & rr(v0, v6) & rr(v0, v5) & rr(v0, v4))) & ! [v0: $i] : ( ~ $i(v0) % 11.99/2.51 | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, v1) & cp3(v1))) & % 11.99/2.51 ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & % 11.99/2.51 rr(v0, v1) & cp2(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) % 11.99/2.51 | ? [v1: $i] : ($i(v1) & rr(v0, v1) & cp1(v1))) % 11.99/2.51 % 11.99/2.51 (axiom_3) % 11.99/2.52 ! [v0: $i] : ( ~ $i(v0) | ~ cp5(v0) | ~ cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) % 11.99/2.52 | ~ cp4(v0) | ~ cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ % 11.99/2.52 cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ~ cp1(v0)) % 11.99/2.52 % 11.99/2.52 (axiom_4) % 11.99/2.52 ! [v0: $i] : ( ~ $i(v0) | ~ cp5(v0) | ~ cp2(v0)) & ! [v0: $i] : ( ~ $i(v0) % 11.99/2.52 | ~ cp4(v0) | ~ cp2(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ % 11.99/2.52 cp2(v0)) % 11.99/2.52 % 11.99/2.52 (axiom_8) % 11.99/2.52 $i(i2003_11_14_17_18_39380) & cUnsatisfiable(i2003_11_14_17_18_39380) % 11.99/2.52 % 11.99/2.52 Further assumptions not needed in the proof: % 11.99/2.52 -------------------------------------------- % 11.99/2.52 axiom_0, axiom_1, axiom_5, axiom_6, axiom_7, cUnsatisfiable_substitution_1, % 11.99/2.52 cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1, % 11.99/2.52 cp2_substitution_1, cp3_substitution_1, cp4_substitution_1, cp5_substitution_1, % 11.99/2.52 rinvR_substitution_1, rinvR_substitution_2, rr_substitution_1, % 11.99/2.52 rr_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 11.99/2.52 % 11.99/2.52 Those formulas are unsatisfiable: % 11.99/2.52 --------------------------------- % 11.99/2.52 % 11.99/2.52 Begin of proof % 11.99/2.52 | % 11.99/2.52 | ALPHA: (axiom_8) implies: % 11.99/2.52 | (1) cUnsatisfiable(i2003_11_14_17_18_39380) % 11.99/2.52 | (2) $i(i2003_11_14_17_18_39380) % 11.99/2.52 | % 11.99/2.52 | ALPHA: (axiom_4) implies: % 11.99/2.52 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ cp2(v0)) % 11.99/2.52 | % 11.99/2.52 | ALPHA: (axiom_3) implies: % 11.99/2.53 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ~ cp1(v0)) % 11.99/2.53 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ cp1(v0)) % 11.99/2.53 | % 11.99/2.53 | ALPHA: (axiom_2) implies: % 11.99/2.53 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 11.99/2.53 | ($i(v1) & rr(v0, v1) & cp1(v1))) % 11.99/2.53 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 11.99/2.53 | ($i(v1) & rr(v0, v1) & cp2(v1))) % 11.99/2.53 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 11.99/2.53 | ($i(v1) & rr(v0, v1) & cp3(v1))) % 11.99/2.53 | (9) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | v3 = % 11.99/2.53 | v1 | v2 = v1 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 11.99/2.53 | rr(v0, v3) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0)) % 11.99/2.53 | % 11.99/2.53 | GROUND_INST: instantiating (8) with i2003_11_14_17_18_39380, simplifying with % 11.99/2.53 | (1), (2) gives: % 11.99/2.53 | (10) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_18_39380, v0) & cp3(v0)) % 11.99/2.53 | % 11.99/2.53 | GROUND_INST: instantiating (7) with i2003_11_14_17_18_39380, simplifying with % 11.99/2.53 | (1), (2) gives: % 11.99/2.53 | (11) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_18_39380, v0) & cp2(v0)) % 11.99/2.53 | % 11.99/2.54 | GROUND_INST: instantiating (6) with i2003_11_14_17_18_39380, simplifying with % 11.99/2.54 | (1), (2) gives: % 11.99/2.54 | (12) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_18_39380, v0) & cp1(v0)) % 11.99/2.54 | % 11.99/2.54 | DELTA: instantiating (12) with fresh symbol all_18_0 gives: % 11.99/2.54 | (13) $i(all_18_0) & rr(i2003_11_14_17_18_39380, all_18_0) & cp1(all_18_0) % 11.99/2.54 | % 11.99/2.54 | ALPHA: (13) implies: % 11.99/2.54 | (14) cp1(all_18_0) % 11.99/2.54 | (15) rr(i2003_11_14_17_18_39380, all_18_0) % 11.99/2.54 | (16) $i(all_18_0) % 11.99/2.54 | % 11.99/2.54 | DELTA: instantiating (11) with fresh symbol all_20_0 gives: % 11.99/2.54 | (17) $i(all_20_0) & rr(i2003_11_14_17_18_39380, all_20_0) & cp2(all_20_0) % 11.99/2.54 | % 11.99/2.54 | ALPHA: (17) implies: % 11.99/2.54 | (18) cp2(all_20_0) % 11.99/2.54 | (19) rr(i2003_11_14_17_18_39380, all_20_0) % 11.99/2.54 | (20) $i(all_20_0) % 11.99/2.54 | % 11.99/2.54 | DELTA: instantiating (10) with fresh symbol all_22_0 gives: % 11.99/2.54 | (21) $i(all_22_0) & rr(i2003_11_14_17_18_39380, all_22_0) & cp3(all_22_0) % 11.99/2.54 | % 11.99/2.54 | ALPHA: (21) implies: % 11.99/2.54 | (22) cp3(all_22_0) % 11.99/2.54 | (23) rr(i2003_11_14_17_18_39380, all_22_0) % 11.99/2.54 | (24) $i(all_22_0) % 11.99/2.54 | % 11.99/2.54 | GROUND_INST: instantiating (4) with all_18_0, simplifying with (14), (16) % 11.99/2.54 | gives: % 11.99/2.54 | (25) ~ cp2(all_18_0) % 11.99/2.54 | % 11.99/2.54 | GROUND_INST: instantiating (3) with all_20_0, simplifying with (18), (20) % 11.99/2.54 | gives: % 11.99/2.54 | (26) ~ cp3(all_20_0) % 11.99/2.54 | % 11.99/2.54 | GROUND_INST: instantiating (5) with all_18_0, simplifying with (14), (16) % 11.99/2.54 | gives: % 11.99/2.54 | (27) ~ cp3(all_18_0) % 11.99/2.54 | % 11.99/2.54 | GROUND_INST: instantiating (9) with i2003_11_14_17_18_39380, all_18_0, % 11.99/2.54 | all_20_0, all_22_0, simplifying with (1), (2), (15), (16), (19), % 11.99/2.54 | (20), (23), (24) gives: % 11.99/2.54 | (28) all_22_0 = all_20_0 | all_22_0 = all_18_0 | all_20_0 = all_18_0 % 11.99/2.54 | % 11.99/2.54 | PRED_UNIFY: (18), (25) imply: % 11.99/2.54 | (29) ~ (all_20_0 = all_18_0) % 11.99/2.54 | % 11.99/2.54 | PRED_UNIFY: (22), (27) imply: % 11.99/2.55 | (30) ~ (all_22_0 = all_18_0) % 11.99/2.55 | % 11.99/2.55 | PRED_UNIFY: (22), (26) imply: % 11.99/2.55 | (31) ~ (all_22_0 = all_20_0) % 11.99/2.55 | % 11.99/2.55 | BETA: splitting (28) gives: % 11.99/2.55 | % 11.99/2.55 | Case 1: % 11.99/2.55 | | % 11.99/2.55 | | (32) all_22_0 = all_20_0 % 11.99/2.55 | | % 11.99/2.55 | | REDUCE: (31), (32) imply: % 11.99/2.55 | | (33) $false % 11.99/2.55 | | % 11.99/2.55 | | CLOSE: (33) is inconsistent. % 11.99/2.55 | | % 11.99/2.55 | Case 2: % 11.99/2.55 | | % 11.99/2.55 | | (34) all_22_0 = all_18_0 | all_20_0 = all_18_0 % 11.99/2.55 | | % 11.99/2.55 | | BETA: splitting (34) gives: % 11.99/2.55 | | % 11.99/2.55 | | Case 1: % 11.99/2.55 | | | % 11.99/2.55 | | | (35) all_22_0 = all_18_0 % 11.99/2.55 | | | % 11.99/2.55 | | | REDUCE: (30), (35) imply: % 11.99/2.55 | | | (36) $false % 11.99/2.55 | | | % 11.99/2.55 | | | CLOSE: (36) is inconsistent. % 11.99/2.55 | | | % 11.99/2.55 | | Case 2: % 11.99/2.55 | | | % 11.99/2.55 | | | (37) all_20_0 = all_18_0 % 11.99/2.55 | | | % 11.99/2.55 | | | REDUCE: (29), (37) imply: % 11.99/2.55 | | | (38) $false % 11.99/2.55 | | | % 11.99/2.55 | | | CLOSE: (38) is inconsistent. % 11.99/2.55 | | | % 11.99/2.55 | | End of split % 11.99/2.55 | | % 11.99/2.55 | End of split % 11.99/2.55 | % 11.99/2.55 End of proof % 11.99/2.55 % SZS output end Proof for theBenchmark % 11.99/2.55 % 11.99/2.55 1932ms %------------------------------------------------------------------------------