%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS092+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 : n007.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:12 EDT 2023 % Result : Unsatisfiable 5.23s 1.52s % Output : Proof 6.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : KRS092+1 : TPTP v8.1.2. Released v3.1.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Mon Aug 28 01:30:42 EDT 2023 % 0.12/0.34 % CPUTime : % 0.17/0.65 ________ _____ % 0.17/0.65 ___ __ \_________(_)________________________________ % 0.17/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.65 % 0.17/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.65 (2023-06-19) % 0.17/0.65 % 0.17/0.65 (c) Philipp Rümmer, 2009-2023 % 0.17/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.65 Amanda Stjerna. % 0.17/0.65 Free software under BSD-3-Clause. % 0.17/0.65 % 0.17/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.65 % 0.17/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.17/0.66 Running up to 7 provers in parallel. % 0.17/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.17/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.79/1.08 Prover 4: Preprocessing ... % 1.79/1.08 Prover 1: Preprocessing ... % 2.31/1.13 Prover 3: Preprocessing ... % 2.31/1.13 Prover 6: Preprocessing ... % 2.31/1.13 Prover 5: Preprocessing ... % 2.31/1.14 Prover 0: Preprocessing ... % 2.31/1.14 Prover 2: Preprocessing ... % 3.66/1.34 Prover 2: Proving ... % 3.66/1.34 Prover 5: Proving ... % 4.34/1.40 Prover 1: Constructing countermodel ... % 4.46/1.42 Prover 3: Constructing countermodel ... % 4.46/1.42 Prover 6: Proving ... % 4.57/1.50 Prover 4: Constructing countermodel ... % 5.23/1.52 Prover 5: proved (843ms) % 5.23/1.52 % 5.23/1.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.23/1.52 % 5.23/1.52 Prover 2: stopped % 5.23/1.53 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.23/1.53 Prover 3: stopped % 5.23/1.53 Prover 6: stopped % 5.23/1.55 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.23/1.55 Prover 0: Proving ... % 5.23/1.55 Prover 0: stopped % 5.23/1.56 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.23/1.56 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.23/1.56 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.23/1.58 Prover 8: Preprocessing ... % 5.23/1.58 Prover 7: Preprocessing ... % 5.23/1.59 Prover 10: Preprocessing ... % 5.72/1.60 Prover 13: Preprocessing ... % 5.72/1.60 Prover 11: Preprocessing ... % 5.72/1.62 Prover 7: Warning: ignoring some quantifiers % 5.72/1.63 Prover 10: Warning: ignoring some quantifiers % 5.72/1.63 Prover 7: Constructing countermodel ... % 5.72/1.63 Prover 10: Constructing countermodel ... % 5.72/1.64 Prover 13: Warning: ignoring some quantifiers % 5.72/1.64 Prover 13: Constructing countermodel ... % 5.72/1.65 Prover 1: Found proof (size 15) % 5.72/1.66 Prover 1: proved (984ms) % 5.72/1.66 Prover 7: stopped % 5.72/1.66 Prover 10: stopped % 5.72/1.66 Prover 4: Found proof (size 15) % 5.72/1.66 Prover 4: proved (982ms) % 5.72/1.66 Prover 13: stopped % 5.72/1.66 Prover 11: stopped % 6.45/1.71 Prover 8: Warning: ignoring some quantifiers % 6.45/1.72 Prover 8: Constructing countermodel ... % 6.45/1.73 Prover 8: stopped % 6.45/1.73 % 6.45/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.45/1.73 % 6.45/1.73 % SZS output start Proof for theBenchmark % 6.45/1.74 Assumptions after simplification: % 6.45/1.74 --------------------------------- % 6.45/1.74 % 6.45/1.74 (axiom_2) % 6.45/1.80 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ % 6.45/1.80 $i(v0) | ? [v2: $i] : ? [v3: any] : ? [v4: any] : (cd(v2) = v3 & cc(v2) = % 6.45/1.80 v4 & rr(v0, v2) = 0 & $i(v2) & ( ~ (v4 = 0) | ~ (v3 = 0))) | ! [v2: $i] % 6.45/1.80 : ( ~ (cowlThing(v2) = 0) | ~ $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & rr(v0, % 6.45/1.80 v2) = v3))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | % 6.45/1.80 ( ! [v1: $i] : ( ~ (rr(v0, v1) = 0) | ~ $i(v1) | (cd(v1) = 0 & cc(v1) = 0)) % 6.45/1.80 & ? [v1: $i] : (rr(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1)))) % 6.45/1.80 % 6.45/1.80 (axiom_3) % 6.45/1.80 ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.45/1.80 cc(v0) = v1)) % 6.45/1.80 % 6.45/1.80 (axiom_8) % 6.45/1.80 cUnsatisfiable(i2003_11_14_17_20_04172) = 0 & $i(i2003_11_14_17_20_04172) % 6.45/1.80 % 6.45/1.80 (function-axioms) % 6.85/1.82 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 6.85/1.82 [v3: $i] : (v1 = v0 | ~ (rr(v3, v2) = v1) | ~ (rr(v3, v2) = v0)) & ! [v0: % 6.85/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.85/1.82 ~ (cf(v2) = v1) | ~ (cf(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.85/1.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ce3(v2) = v1) | ~ % 6.85/1.82 (ce3(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 6.85/1.82 ! [v2: $i] : (v1 = v0 | ~ (cd1(v2) = v1) | ~ (cd1(v2) = v0)) & ! [v0: % 6.85/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.85/1.82 ~ (cc1(v2) = v1) | ~ (cc1(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.85/1.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | % 6.85/1.82 ~ (cUnsatisfiable(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.85/1.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cd(v2) = v1) | ~ (cd(v2) % 6.85/1.82 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 6.85/1.82 $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) & ! [v0: % 6.85/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.85/1.82 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 6.85/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.85/1.82 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 6.85/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.85/1.82 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 6.85/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.85/1.82 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 6.85/1.82 % 6.85/1.82 Further assumptions not needed in the proof: % 6.85/1.82 -------------------------------------------- % 6.85/1.82 axiom_0, axiom_1, axiom_4, axiom_5, axiom_6, axiom_7 % 6.85/1.82 % 6.85/1.82 Those formulas are unsatisfiable: % 6.85/1.82 --------------------------------- % 6.85/1.82 % 6.85/1.82 Begin of proof % 6.85/1.82 | % 6.85/1.82 | ALPHA: (axiom_2) implies: % 6.85/1.83 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] : % 6.85/1.83 | ( ~ (rr(v0, v1) = 0) | ~ $i(v1) | (cd(v1) = 0 & cc(v1) = 0)) & ? % 6.85/1.83 | [v1: $i] : (rr(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1)))) % 6.85/1.83 | % 6.85/1.83 | ALPHA: (axiom_8) implies: % 6.85/1.83 | (2) $i(i2003_11_14_17_20_04172) % 6.85/1.83 | (3) cUnsatisfiable(i2003_11_14_17_20_04172) = 0 % 6.85/1.83 | % 6.85/1.83 | ALPHA: (function-axioms) implies: % 6.85/1.83 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.85/1.83 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) % 6.85/1.83 | % 6.85/1.84 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_04172, simplifying with % 6.85/1.84 | (2), (3) gives: % 6.85/1.84 | (5) ! [v0: $i] : ( ~ (rr(i2003_11_14_17_20_04172, v0) = 0) | ~ $i(v0) | % 6.85/1.84 | (cd(v0) = 0 & cc(v0) = 0)) & ? [v0: $i] : % 6.85/1.84 | (rr(i2003_11_14_17_20_04172, v0) = 0 & cowlThing(v0) = 0 & $i(v0)) % 6.85/1.84 | % 6.85/1.84 | ALPHA: (5) implies: % 6.85/1.85 | (6) ! [v0: $i] : ( ~ (rr(i2003_11_14_17_20_04172, v0) = 0) | ~ $i(v0) | % 6.85/1.85 | (cd(v0) = 0 & cc(v0) = 0)) % 6.85/1.85 | (7) ? [v0: $i] : (rr(i2003_11_14_17_20_04172, v0) = 0 & cowlThing(v0) = 0 % 6.85/1.85 | & $i(v0)) % 6.85/1.85 | % 6.85/1.85 | DELTA: instantiating (7) with fresh symbol all_18_0 gives: % 6.85/1.85 | (8) rr(i2003_11_14_17_20_04172, all_18_0) = 0 & cowlThing(all_18_0) = 0 & % 6.85/1.85 | $i(all_18_0) % 6.85/1.85 | % 6.85/1.85 | ALPHA: (8) implies: % 6.85/1.85 | (9) $i(all_18_0) % 6.85/1.85 | (10) rr(i2003_11_14_17_20_04172, all_18_0) = 0 % 6.85/1.85 | % 6.85/1.85 | GROUND_INST: instantiating (6) with all_18_0, simplifying with (9), (10) % 6.85/1.85 | gives: % 6.85/1.85 | (11) cd(all_18_0) = 0 & cc(all_18_0) = 0 % 6.85/1.85 | % 6.85/1.85 | ALPHA: (11) implies: % 6.85/1.85 | (12) cc(all_18_0) = 0 % 6.85/1.85 | (13) cd(all_18_0) = 0 % 6.85/1.85 | % 6.85/1.85 | GROUND_INST: instantiating (axiom_3) with all_18_0, simplifying with (9), (13) % 6.85/1.85 | gives: % 6.85/1.85 | (14) ? [v0: int] : ( ~ (v0 = 0) & cc(all_18_0) = v0) % 6.85/1.85 | % 6.85/1.85 | DELTA: instantiating (14) with fresh symbol all_31_0 gives: % 6.85/1.85 | (15) ~ (all_31_0 = 0) & cc(all_18_0) = all_31_0 % 6.85/1.85 | % 6.85/1.85 | ALPHA: (15) implies: % 6.85/1.85 | (16) ~ (all_31_0 = 0) % 6.85/1.85 | (17) cc(all_18_0) = all_31_0 % 6.85/1.85 | % 6.85/1.86 | GROUND_INST: instantiating (4) with 0, all_31_0, all_18_0, simplifying with % 6.85/1.86 | (12), (17) gives: % 6.85/1.86 | (18) all_31_0 = 0 % 6.85/1.86 | % 6.85/1.86 | REDUCE: (16), (18) imply: % 6.85/1.86 | (19) $false % 6.85/1.86 | % 6.85/1.86 | CLOSE: (19) is inconsistent. % 6.85/1.86 | % 6.85/1.86 End of proof % 6.85/1.86 % SZS output end Proof for theBenchmark % 6.85/1.86 % 6.85/1.86 1208ms %------------------------------------------------------------------------------