%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS094+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 : n015.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:13 EDT 2023 % Result : Unsatisfiable 3.89s 1.34s % Output : Proof 5.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.14/0.14 % Problem : KRS094+1 : TPTP v8.1.2. Released v3.1.0. % 0.14/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.37 % Computer : n015.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 300 % 0.15/0.37 % DateTime : Mon Aug 28 02:42:39 EDT 2023 % 0.15/0.37 % CPUTime : % 0.22/0.65 ________ _____ % 0.22/0.65 ___ __ \_________(_)________________________________ % 0.22/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.65 % 0.22/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.65 (2023-06-19) % 0.22/0.65 % 0.22/0.65 (c) Philipp Rümmer, 2009-2023 % 0.22/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.65 Amanda Stjerna. % 0.22/0.65 Free software under BSD-3-Clause. % 0.22/0.65 % 0.22/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.65 % 0.22/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.22/0.66 Running up to 7 provers in parallel. % 0.22/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.00/1.02 Prover 4: Preprocessing ... % 2.00/1.02 Prover 1: Preprocessing ... % 2.37/1.07 Prover 0: Preprocessing ... % 2.37/1.07 Prover 5: Preprocessing ... % 2.37/1.07 Prover 2: Preprocessing ... % 2.37/1.07 Prover 6: Preprocessing ... % 2.37/1.07 Prover 3: Preprocessing ... % 2.87/1.17 Prover 2: Proving ... % 2.87/1.18 Prover 5: Proving ... % 3.45/1.27 Prover 4: Constructing countermodel ... % 3.45/1.27 Prover 6: Constructing countermodel ... % 3.45/1.27 Prover 3: Constructing countermodel ... % 3.89/1.28 Prover 1: Constructing countermodel ... % 3.89/1.30 Prover 0: Proving ... % 3.89/1.32 Prover 6: gave up % 3.89/1.34 Prover 2: proved (640ms) % 3.89/1.34 % 3.89/1.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.89/1.34 % 3.89/1.34 Prover 3: gave up % 3.89/1.35 Prover 5: proved (645ms) % 3.89/1.35 % 3.89/1.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.89/1.35 % 3.89/1.35 Prover 1: gave up % 4.39/1.36 Prover 0: proved (665ms) % 4.39/1.36 % 4.39/1.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.39/1.36 % 4.39/1.37 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.39/1.37 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.39/1.37 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.39/1.37 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.39/1.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.39/1.37 Prover 10: Preprocessing ... % 4.39/1.37 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.39/1.38 Prover 11: Preprocessing ... % 4.39/1.38 Prover 8: Preprocessing ... % 4.39/1.38 Prover 4: Found proof (size 13) % 4.39/1.38 Prover 4: proved (704ms) % 4.39/1.39 Prover 16: Preprocessing ... % 4.39/1.39 Prover 7: Preprocessing ... % 4.39/1.40 Prover 13: Preprocessing ... % 4.39/1.42 Prover 13: Warning: ignoring some quantifiers % 4.39/1.42 Prover 10: Warning: ignoring some quantifiers % 4.39/1.42 Prover 7: Warning: ignoring some quantifiers % 4.39/1.43 Prover 11: stopped % 4.39/1.43 Prover 13: Constructing countermodel ... % 4.39/1.43 Prover 10: Constructing countermodel ... % 4.39/1.43 Prover 16: Warning: ignoring some quantifiers % 4.39/1.43 Prover 7: Constructing countermodel ... % 4.39/1.43 Prover 13: stopped % 4.39/1.43 Prover 10: stopped % 4.39/1.43 Prover 16: Constructing countermodel ... % 4.39/1.43 Prover 7: stopped % 4.39/1.44 Prover 16: stopped % 4.39/1.47 Prover 8: Warning: ignoring some quantifiers % 4.39/1.47 Prover 8: Constructing countermodel ... % 4.39/1.48 Prover 8: stopped % 4.39/1.48 % 4.39/1.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.39/1.48 % 4.39/1.48 % SZS output start Proof for theBenchmark % 5.01/1.49 Assumptions after simplification: % 5.01/1.49 --------------------------------- % 5.01/1.49 % 5.01/1.49 (axiom_2) % 5.01/1.52 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cc1(v0) = v1) | ~ $i(v0) | ? [v2: % 5.01/1.52 int] : ( ~ (v2 = 0) & cUnsatisfiable(v0) = v2)) & ! [v0: $i] : ! [v1: % 5.01/1.52 int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ $i(v0) | ? [v2: int] : ( % 5.01/1.52 ~ (v2 = 0) & cc1(v0) = v2)) & ! [v0: $i] : ( ~ (cc1(v0) = 0) | ~ $i(v0) % 5.01/1.52 | cUnsatisfiable(v0) = 0) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ % 5.01/1.52 $i(v0) | cc1(v0) = 0) % 5.01/1.52 % 5.01/1.52 (axiom_4) % 5.01/1.52 ! [v0: $i] : ( ~ (cd1(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 5.01/1.52 cc1(v0) = v1)) & ! [v0: $i] : ( ~ (cc1(v0) = 0) | ~ $i(v0) | ? [v1: % 5.01/1.52 int] : ( ~ (v1 = 0) & cd1(v0) = v1)) % 5.01/1.52 % 5.01/1.52 (axiom_5) % 5.30/1.52 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd1(v0) = v1) | ~ $i(v0) | ? [v2: % 5.30/1.52 int] : ( ~ (v2 = 0) & cc1(v0) = v2)) & ! [v0: $i] : ( ~ (cc1(v0) = 0) | % 5.30/1.52 ~ $i(v0) | cd1(v0) = 0) % 5.30/1.52 % 5.30/1.52 (axiom_8) % 5.30/1.52 cUnsatisfiable(i2003_11_14_17_20_11330) = 0 & $i(i2003_11_14_17_20_11330) % 5.30/1.52 % 5.30/1.52 (function-axioms) % 5.30/1.53 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = % 5.30/1.53 v0 | ~ (cf(v2) = v1) | ~ (cf(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 5.30/1.53 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ce3(v2) = v1) | ~ % 5.30/1.53 (ce3(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 5.30/1.53 ! [v2: $i] : (v1 = v0 | ~ (cd1(v2) = v1) | ~ (cd1(v2) = v0)) & ! [v0: % 5.30/1.53 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.30/1.53 ~ (cd(v2) = v1) | ~ (cd(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 5.30/1.53 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) % 5.30/1.53 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.30/1.53 $i] : (v1 = v0 | ~ (cc1(v2) = v1) | ~ (cc1(v2) = v0)) & ! [v0: % 5.30/1.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.30/1.54 ~ (cUnsatisfiable(v2) = v1) | ~ (cUnsatisfiable(v2) = v0)) & ! [v0: % 5.30/1.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.30/1.54 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 5.30/1.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.30/1.54 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 5.30/1.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.30/1.54 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 5.30/1.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.30/1.54 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 5.30/1.54 % 5.30/1.54 Further assumptions not needed in the proof: % 5.30/1.54 -------------------------------------------- % 5.30/1.54 axiom_0, axiom_1, axiom_3, axiom_6, axiom_7 % 5.30/1.54 % 5.30/1.54 Those formulas are unsatisfiable: % 5.30/1.54 --------------------------------- % 5.30/1.54 % 5.30/1.54 Begin of proof % 5.30/1.54 | % 5.30/1.54 | ALPHA: (axiom_2) implies: % 5.30/1.54 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cc1(v0) = 0) % 5.30/1.54 | % 5.30/1.54 | ALPHA: (axiom_4) implies: % 5.30/1.54 | (2) ! [v0: $i] : ( ~ (cc1(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = % 5.30/1.54 | 0) & cd1(v0) = v1)) % 5.30/1.54 | % 5.30/1.54 | ALPHA: (axiom_5) implies: % 5.30/1.54 | (3) ! [v0: $i] : ( ~ (cc1(v0) = 0) | ~ $i(v0) | cd1(v0) = 0) % 5.30/1.54 | % 5.30/1.54 | ALPHA: (axiom_8) implies: % 5.30/1.54 | (4) $i(i2003_11_14_17_20_11330) % 5.30/1.54 | (5) cUnsatisfiable(i2003_11_14_17_20_11330) = 0 % 5.30/1.54 | % 5.30/1.54 | ALPHA: (function-axioms) implies: % 5.40/1.54 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 5.40/1.54 | (v1 = v0 | ~ (cd1(v2) = v1) | ~ (cd1(v2) = v0)) % 5.40/1.55 | % 5.40/1.55 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_11330, simplifying with % 5.40/1.55 | (4), (5) gives: % 5.40/1.55 | (7) cc1(i2003_11_14_17_20_11330) = 0 % 5.40/1.55 | % 5.40/1.55 | GROUND_INST: instantiating (3) with i2003_11_14_17_20_11330, simplifying with % 5.40/1.55 | (4), (7) gives: % 5.40/1.55 | (8) cd1(i2003_11_14_17_20_11330) = 0 % 5.40/1.55 | % 5.40/1.55 | GROUND_INST: instantiating (2) with i2003_11_14_17_20_11330, simplifying with % 5.40/1.55 | (4), (7) gives: % 5.40/1.55 | (9) ? [v0: int] : ( ~ (v0 = 0) & cd1(i2003_11_14_17_20_11330) = v0) % 5.40/1.55 | % 5.40/1.55 | DELTA: instantiating (9) with fresh symbol all_24_0 gives: % 5.40/1.55 | (10) ~ (all_24_0 = 0) & cd1(i2003_11_14_17_20_11330) = all_24_0 % 5.40/1.55 | % 5.40/1.55 | ALPHA: (10) implies: % 5.40/1.55 | (11) ~ (all_24_0 = 0) % 5.40/1.55 | (12) cd1(i2003_11_14_17_20_11330) = all_24_0 % 5.40/1.55 | % 5.40/1.55 | GROUND_INST: instantiating (6) with 0, all_24_0, i2003_11_14_17_20_11330, % 5.40/1.55 | simplifying with (8), (12) gives: % 5.40/1.55 | (13) all_24_0 = 0 % 5.40/1.55 | % 5.40/1.55 | REDUCE: (11), (13) imply: % 5.40/1.55 | (14) $false % 5.40/1.55 | % 5.40/1.55 | CLOSE: (14) is inconsistent. % 5.40/1.55 | % 5.40/1.55 End of proof % 5.40/1.55 % SZS output end Proof for theBenchmark % 5.40/1.55 % 5.40/1.55 901ms %------------------------------------------------------------------------------