%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS072+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 : n011.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 6.16s 1.58s % Output : Proof 7.92s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : KRS072+1 : TPTP v8.1.2. Released v3.1.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n011.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Mon Aug 28 02:28:25 EDT 2023 % 0.14/0.36 % CPUTime : % 0.22/0.63 ________ _____ % 0.22/0.63 ___ __ \_________(_)________________________________ % 0.22/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.63 % 0.22/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.63 (2023-06-19) % 0.22/0.63 % 0.22/0.63 (c) Philipp Rümmer, 2009-2023 % 0.22/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.63 Amanda Stjerna. % 0.22/0.63 Free software under BSD-3-Clause. % 0.22/0.63 % 0.22/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.63 % 0.22/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.22/0.64 Running up to 7 provers in parallel. % 0.22/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.18/1.05 Prover 4: Preprocessing ... % 2.18/1.06 Prover 1: Preprocessing ... % 2.95/1.09 Prover 3: Preprocessing ... % 2.95/1.09 Prover 2: Preprocessing ... % 2.95/1.09 Prover 6: Preprocessing ... % 2.95/1.09 Prover 5: Preprocessing ... % 2.95/1.10 Prover 0: Preprocessing ... % 4.80/1.38 Prover 2: Proving ... % 4.80/1.38 Prover 5: Proving ... % 4.80/1.42 Prover 1: Constructing countermodel ... % 5.22/1.43 Prover 3: Constructing countermodel ... % 5.22/1.44 Prover 6: Proving ... % 5.86/1.56 Prover 4: Constructing countermodel ... % 6.16/1.57 Prover 5: proved (909ms) % 6.16/1.57 Prover 2: proved (922ms) % 6.16/1.58 % 6.16/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.16/1.58 % 6.16/1.58 % 6.16/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.16/1.58 % 6.16/1.58 Prover 3: stopped % 6.16/1.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.16/1.58 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.16/1.58 Prover 6: stopped % 6.16/1.60 Prover 1: gave up % 6.16/1.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.16/1.60 Prover 0: Proving ... % 6.16/1.60 Prover 0: stopped % 6.16/1.61 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.16/1.61 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.16/1.62 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 6.16/1.62 Prover 8: Preprocessing ... % 6.16/1.63 Prover 10: Preprocessing ... % 6.16/1.63 Prover 7: Preprocessing ... % 6.69/1.65 Prover 11: Preprocessing ... % 6.69/1.65 Prover 16: Preprocessing ... % 6.69/1.65 Prover 13: Preprocessing ... % 6.90/1.70 Prover 7: Warning: ignoring some quantifiers % 6.90/1.71 Prover 10: Warning: ignoring some quantifiers % 6.90/1.71 Prover 13: Warning: ignoring some quantifiers % 6.90/1.71 Prover 7: Constructing countermodel ... % 6.90/1.72 Prover 13: Constructing countermodel ... % 6.90/1.72 Prover 10: Constructing countermodel ... % 7.34/1.74 Prover 16: Warning: ignoring some quantifiers % 7.34/1.74 Prover 16: Constructing countermodel ... % 7.34/1.79 Prover 16: Found proof (size 14) % 7.34/1.79 Prover 16: proved (170ms) % 7.34/1.79 Prover 4: stopped % 7.34/1.79 Prover 10: stopped % 7.34/1.79 Prover 8: Warning: ignoring some quantifiers % 7.34/1.79 Prover 13: stopped % 7.34/1.79 Prover 7: stopped % 7.34/1.79 Prover 8: Constructing countermodel ... % 7.34/1.80 Prover 8: stopped % 7.92/1.84 Prover 11: Constructing countermodel ... % 7.92/1.85 Prover 11: stopped % 7.92/1.85 % 7.92/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.92/1.85 % 7.92/1.85 % SZS output start Proof for theBenchmark % 7.92/1.85 Assumptions after simplification: % 7.92/1.85 --------------------------------- % 7.92/1.85 % 7.92/1.85 (axiom_2) % 7.92/1.86 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 7.92/1.86 ~ rr(v1, v2) | ~ rinvR(v0, v1) | ~ cp2(v0) | ~ cp1(v2) | % 7.92/1.86 cUnsatisfiable(v0) | ? [v3: $i] : ? [v4: $i] : ( ~ (v4 = v3) & $i(v4) & % 7.92/1.86 $i(v3) & rr(v1, v4) & rr(v1, v3))) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.92/1.86 cUnsatisfiable(v0) | cp2(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.92/1.86 cUnsatisfiable(v0) | ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & rr(v1, % 7.92/1.86 v2) & rinvR(v0, v1) & cp1(v2) & ! [v3: $i] : ! [v4: $i] : (v4 = v3 | % 7.92/1.86 ~ $i(v4) | ~ $i(v3) | ~ rr(v1, v4) | ~ rr(v1, v3)))) % 7.92/1.86 % 7.92/1.86 (axiom_3) % 7.92/1.86 ! [v0: $i] : ( ~ $i(v0) | ~ cp5(v0) | ~ cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) % 7.92/1.87 | ~ cp4(v0) | ~ cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ % 7.92/1.87 cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ~ cp1(v0)) % 7.92/1.87 % 7.92/1.87 (axiom_7) % 7.92/1.87 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | rinvR(v0, % 7.92/1.87 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, % 7.92/1.87 v1) | rr(v1, v0)) % 7.92/1.87 % 7.92/1.87 (axiom_8) % 7.92/1.87 $i(i2003_11_14_17_18_50190) & cUnsatisfiable(i2003_11_14_17_18_50190) % 7.92/1.87 % 7.92/1.87 Further assumptions not needed in the proof: % 7.92/1.87 -------------------------------------------- % 7.92/1.87 axiom_0, axiom_1, axiom_4, axiom_5, axiom_6, cUnsatisfiable_substitution_1, % 7.92/1.87 cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1, % 7.92/1.87 cp2_substitution_1, cp3_substitution_1, cp4_substitution_1, cp5_substitution_1, % 7.92/1.87 rinvR_substitution_1, rinvR_substitution_2, rr_substitution_1, % 7.92/1.87 rr_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 7.92/1.87 % 7.92/1.87 Those formulas are unsatisfiable: % 7.92/1.87 --------------------------------- % 7.92/1.87 % 7.92/1.87 Begin of proof % 7.92/1.87 | % 7.92/1.87 | ALPHA: (axiom_8) implies: % 7.92/1.87 | (1) cUnsatisfiable(i2003_11_14_17_18_50190) % 7.92/1.87 | (2) $i(i2003_11_14_17_18_50190) % 7.92/1.87 | % 7.92/1.87 | ALPHA: (axiom_7) implies: % 7.92/1.87 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | % 7.92/1.87 | rr(v1, v0)) % 7.92/1.87 | % 7.92/1.87 | ALPHA: (axiom_3) implies: % 7.92/1.87 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ~ cp1(v0)) % 7.92/1.87 | % 7.92/1.87 | ALPHA: (axiom_2) implies: % 7.92/1.88 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ? % 7.92/1.88 | [v2: $i] : ($i(v2) & $i(v1) & rr(v1, v2) & rinvR(v0, v1) & cp1(v2) & % 7.92/1.88 | ! [v3: $i] : ! [v4: $i] : (v4 = v3 | ~ $i(v4) | ~ $i(v3) | ~ % 7.92/1.88 | rr(v1, v4) | ~ rr(v1, v3)))) % 7.92/1.88 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | cp2(v0)) % 7.92/1.88 | % 7.92/1.88 | GROUND_INST: instantiating (6) with i2003_11_14_17_18_50190, simplifying with % 7.92/1.88 | (1), (2) gives: % 7.92/1.88 | (7) cp2(i2003_11_14_17_18_50190) % 7.92/1.88 | % 7.92/1.88 | GROUND_INST: instantiating (5) with i2003_11_14_17_18_50190, simplifying with % 7.92/1.88 | (1), (2) gives: % 7.92/1.88 | (8) ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & rr(v0, v1) & % 7.92/1.88 | rinvR(i2003_11_14_17_18_50190, v0) & cp1(v1) & ! [v2: $i] : ! [v3: % 7.92/1.88 | $i] : (v3 = v2 | ~ $i(v3) | ~ $i(v2) | ~ rr(v0, v3) | ~ rr(v0, % 7.92/1.88 | v2))) % 7.92/1.88 | % 7.92/1.88 | DELTA: instantiating (8) with fresh symbols all_19_0, all_19_1 gives: % 7.92/1.88 | (9) $i(all_19_0) & $i(all_19_1) & rr(all_19_1, all_19_0) & % 7.92/1.88 | rinvR(i2003_11_14_17_18_50190, all_19_1) & cp1(all_19_0) & ! [v0: $i] % 7.92/1.88 | : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ rr(all_19_1, v1) % 7.92/1.88 | | ~ rr(all_19_1, v0)) % 7.92/1.88 | % 7.92/1.88 | ALPHA: (9) implies: % 7.92/1.88 | (10) cp1(all_19_0) % 7.92/1.88 | (11) rinvR(i2003_11_14_17_18_50190, all_19_1) % 7.92/1.88 | (12) rr(all_19_1, all_19_0) % 7.92/1.88 | (13) $i(all_19_1) % 7.92/1.88 | (14) $i(all_19_0) % 7.92/1.88 | (15) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 7.92/1.88 | rr(all_19_1, v1) | ~ rr(all_19_1, v0)) % 7.92/1.88 | % 7.92/1.88 | GROUND_INST: instantiating (4) with i2003_11_14_17_18_50190, simplifying with % 7.92/1.88 | (2), (7) gives: % 7.92/1.88 | (16) ~ cp1(i2003_11_14_17_18_50190) % 7.92/1.88 | % 7.92/1.89 | GROUND_INST: instantiating (3) with i2003_11_14_17_18_50190, all_19_1, % 7.92/1.89 | simplifying with (2), (11), (13) gives: % 7.92/1.89 | (17) rr(all_19_1, i2003_11_14_17_18_50190) % 7.92/1.89 | % 7.92/1.89 | PRED_UNIFY: (10), (16) imply: % 7.92/1.89 | (18) ~ (all_19_0 = i2003_11_14_17_18_50190) % 7.92/1.89 | % 7.92/1.89 | GROUND_INST: instantiating (15) with all_19_0, i2003_11_14_17_18_50190, % 7.92/1.89 | simplifying with (2), (12), (14), (17) gives: % 7.92/1.89 | (19) all_19_0 = i2003_11_14_17_18_50190 % 7.92/1.89 | % 7.92/1.89 | REDUCE: (18), (19) imply: % 7.92/1.89 | (20) $false % 7.92/1.89 | % 7.92/1.89 | CLOSE: (20) is inconsistent. % 7.92/1.89 | % 7.92/1.89 End of proof % 7.92/1.89 % SZS output end Proof for theBenchmark % 8.26/1.89 % 8.26/1.89 1259ms %------------------------------------------------------------------------------