%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS069+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 : n020.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 5.44s 1.47s % Output : Proof 7.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KRS069+1 : TPTP v8.1.2. Released v3.1.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n020.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Mon Aug 28 01:56:44 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.26/1.01 Prover 4: Preprocessing ... % 2.26/1.01 Prover 1: Preprocessing ... % 2.84/1.05 Prover 6: Preprocessing ... % 2.84/1.05 Prover 0: Preprocessing ... % 2.84/1.05 Prover 5: Preprocessing ... % 2.84/1.05 Prover 3: Preprocessing ... % 2.84/1.05 Prover 2: Preprocessing ... % 4.41/1.29 Prover 5: Proving ... % 4.41/1.29 Prover 2: Proving ... % 4.41/1.36 Prover 1: Constructing countermodel ... % 4.41/1.38 Prover 3: Constructing countermodel ... % 4.41/1.40 Prover 6: Proving ... % 5.44/1.45 Prover 4: Constructing countermodel ... % 5.44/1.47 Prover 5: proved (851ms) % 5.44/1.47 % 5.44/1.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.44/1.47 % 5.44/1.47 Prover 2: stopped % 5.44/1.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.44/1.47 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.44/1.47 Prover 3: stopped % 5.44/1.47 Prover 6: stopped % 5.44/1.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.44/1.49 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.03/1.51 Prover 0: Proving ... % 6.03/1.51 Prover 1: gave up % 6.03/1.52 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.03/1.52 Prover 0: stopped % 6.03/1.53 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 6.03/1.53 Prover 8: Preprocessing ... % 6.03/1.54 Prover 10: Preprocessing ... % 6.03/1.55 Prover 11: Preprocessing ... % 6.50/1.56 Prover 7: Preprocessing ... % 6.50/1.58 Prover 10: Warning: ignoring some quantifiers % 6.50/1.59 Prover 10: Constructing countermodel ... % 6.50/1.60 Prover 7: Warning: ignoring some quantifiers % 6.50/1.60 Prover 16: Preprocessing ... % 6.50/1.60 Prover 13: Preprocessing ... % 6.88/1.61 Prover 7: Constructing countermodel ... % 7.20/1.65 Prover 16: Warning: ignoring some quantifiers % 7.20/1.65 Prover 16: Constructing countermodel ... % 7.20/1.67 Prover 8: Warning: ignoring some quantifiers % 7.20/1.67 Prover 13: Warning: ignoring some quantifiers % 7.20/1.67 Prover 8: Constructing countermodel ... % 7.20/1.68 Prover 13: Constructing countermodel ... % 7.20/1.68 Prover 10: Found proof (size 19) % 7.20/1.68 Prover 10: proved (207ms) % 7.20/1.68 Prover 4: stopped % 7.20/1.68 Prover 8: stopped % 7.20/1.68 Prover 13: stopped % 7.20/1.68 Prover 16: stopped % 7.20/1.68 Prover 7: stopped % 7.20/1.73 Prover 11: Constructing countermodel ... % 7.20/1.73 Prover 11: stopped % 7.20/1.73 % 7.20/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.20/1.73 % 7.20/1.74 % SZS output start Proof for theBenchmark % 7.77/1.74 Assumptions after simplification: % 7.77/1.74 --------------------------------- % 7.77/1.74 % 7.77/1.74 (axiom_2) % 7.77/1.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 7.77/1.75 | ~ $i(v1) | ~ $i(v0) | ~ rf3(v0, v1) | ~ rf2(v0, v2) | ~ rf1(v0, v3) | % 7.77/1.75 ~ cp2(v1) | ~ cp1(v3) | cp1(v2) | cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ % 7.77/1.75 $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rf3(v0, v1) & % 7.77/1.75 cp2(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] % 7.77/1.75 : ($i(v1) & rf2(v0, v1) & ~ cp1(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.77/1.75 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rf1(v0, v1) & cp1(v1))) % 7.77/1.75 % 7.77/1.75 (axiom_3) % 7.77/1.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 7.77/1.75 ~ $i(v0) | ~ rf1(v0, v2) | ~ rf1(v0, v1)) % 7.77/1.75 % 7.77/1.75 (axiom_4) % 7.77/1.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 7.77/1.75 ~ $i(v0) | ~ rf2(v0, v2) | ~ rf2(v0, v1)) % 7.77/1.75 % 7.77/1.75 (axiom_6) % 7.77/1.75 $i(i2003_11_14_17_18_2750) & cUnsatisfiable(i2003_11_14_17_18_2750) % 7.77/1.75 % 7.77/1.76 (axiom_7) % 7.77/1.76 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf3(v0, v1) | rf1(v0, % 7.77/1.76 v1)) % 7.77/1.76 % 7.77/1.76 (axiom_8) % 7.77/1.76 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf3(v0, v1) | rf2(v0, % 7.77/1.76 v1)) % 7.77/1.76 % 7.77/1.76 Further assumptions not needed in the proof: % 7.77/1.76 -------------------------------------------- % 7.77/1.76 axiom_0, axiom_1, axiom_5, cUnsatisfiable_substitution_1, % 7.77/1.76 cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1, % 7.77/1.76 cp2_substitution_1, rf1_substitution_1, rf1_substitution_2, rf2_substitution_1, % 7.77/1.76 rf2_substitution_2, rf3_substitution_1, rf3_substitution_2, % 7.77/1.76 xsd_integer_substitution_1, xsd_string_substitution_1 % 7.77/1.76 % 7.77/1.76 Those formulas are unsatisfiable: % 7.77/1.76 --------------------------------- % 7.77/1.76 % 7.77/1.76 Begin of proof % 7.77/1.76 | % 7.77/1.76 | ALPHA: (axiom_6) implies: % 7.77/1.76 | (1) cUnsatisfiable(i2003_11_14_17_18_2750) % 7.77/1.76 | (2) $i(i2003_11_14_17_18_2750) % 7.77/1.76 | % 7.77/1.76 | ALPHA: (axiom_2) implies: % 7.77/1.76 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 7.77/1.76 | ($i(v1) & rf1(v0, v1) & cp1(v1))) % 7.77/1.76 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 7.77/1.76 | ($i(v1) & rf2(v0, v1) & ~ cp1(v1))) % 7.77/1.76 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 7.77/1.76 | ($i(v1) & rf3(v0, v1) & cp2(v1))) % 7.77/1.76 | % 7.77/1.77 | GROUND_INST: instantiating (5) with i2003_11_14_17_18_2750, simplifying with % 7.77/1.77 | (1), (2) gives: % 7.77/1.77 | (6) ? [v0: $i] : ($i(v0) & rf3(i2003_11_14_17_18_2750, v0) & cp2(v0)) % 7.77/1.77 | % 7.77/1.77 | GROUND_INST: instantiating (4) with i2003_11_14_17_18_2750, simplifying with % 7.77/1.77 | (1), (2) gives: % 7.77/1.77 | (7) ? [v0: $i] : ($i(v0) & rf2(i2003_11_14_17_18_2750, v0) & ~ cp1(v0)) % 7.77/1.77 | % 7.77/1.77 | GROUND_INST: instantiating (3) with i2003_11_14_17_18_2750, simplifying with % 7.77/1.77 | (1), (2) gives: % 7.77/1.77 | (8) ? [v0: $i] : ($i(v0) & rf1(i2003_11_14_17_18_2750, v0) & cp1(v0)) % 7.77/1.77 | % 7.77/1.77 | DELTA: instantiating (8) with fresh symbol all_18_0 gives: % 7.77/1.77 | (9) $i(all_18_0) & rf1(i2003_11_14_17_18_2750, all_18_0) & cp1(all_18_0) % 7.77/1.77 | % 7.77/1.77 | ALPHA: (9) implies: % 7.77/1.77 | (10) cp1(all_18_0) % 7.77/1.77 | (11) rf1(i2003_11_14_17_18_2750, all_18_0) % 7.77/1.77 | (12) $i(all_18_0) % 7.77/1.77 | % 7.77/1.77 | DELTA: instantiating (7) with fresh symbol all_20_0 gives: % 7.77/1.77 | (13) $i(all_20_0) & rf2(i2003_11_14_17_18_2750, all_20_0) & ~ % 7.77/1.77 | cp1(all_20_0) % 7.77/1.77 | % 7.77/1.77 | ALPHA: (13) implies: % 7.77/1.77 | (14) ~ cp1(all_20_0) % 7.77/1.77 | (15) rf2(i2003_11_14_17_18_2750, all_20_0) % 7.77/1.77 | (16) $i(all_20_0) % 7.77/1.77 | % 7.77/1.77 | DELTA: instantiating (6) with fresh symbol all_22_0 gives: % 7.77/1.77 | (17) $i(all_22_0) & rf3(i2003_11_14_17_18_2750, all_22_0) & cp2(all_22_0) % 7.77/1.77 | % 7.77/1.77 | ALPHA: (17) implies: % 7.77/1.77 | (18) rf3(i2003_11_14_17_18_2750, all_22_0) % 7.77/1.77 | (19) $i(all_22_0) % 7.77/1.77 | % 7.77/1.77 | GROUND_INST: instantiating (axiom_8) with i2003_11_14_17_18_2750, all_22_0, % 7.77/1.77 | simplifying with (2), (18), (19) gives: % 7.77/1.77 | (20) rf2(i2003_11_14_17_18_2750, all_22_0) % 7.77/1.77 | % 7.77/1.77 | GROUND_INST: instantiating (axiom_7) with i2003_11_14_17_18_2750, all_22_0, % 7.77/1.77 | simplifying with (2), (18), (19) gives: % 7.77/1.77 | (21) rf1(i2003_11_14_17_18_2750, all_22_0) % 7.77/1.77 | % 7.77/1.77 | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_18_2750, all_18_0, % 7.77/1.77 | all_22_0, simplifying with (2), (11), (12), (19), (21) gives: % 7.77/1.78 | (22) all_22_0 = all_18_0 % 7.77/1.78 | % 7.77/1.78 | GROUND_INST: instantiating (axiom_4) with i2003_11_14_17_18_2750, all_20_0, % 7.77/1.78 | all_22_0, simplifying with (2), (15), (16), (19), (20) gives: % 7.77/1.78 | (23) all_22_0 = all_20_0 % 7.77/1.78 | % 7.77/1.78 | COMBINE_EQS: (22), (23) imply: % 7.77/1.78 | (24) all_20_0 = all_18_0 % 7.77/1.78 | % 7.77/1.78 | REDUCE: (14), (24) imply: % 7.77/1.78 | (25) ~ cp1(all_18_0) % 7.77/1.78 | % 7.77/1.78 | PRED_UNIFY: (10), (25) imply: % 7.77/1.78 | (26) $false % 7.77/1.78 | % 7.77/1.78 | CLOSE: (26) is inconsistent. % 7.77/1.78 | % 7.77/1.78 End of proof % 7.77/1.78 % SZS output end Proof for theBenchmark % 7.77/1.78 % 7.77/1.78 1188ms %------------------------------------------------------------------------------