%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS076+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:09 EDT 2023 % Result : Unsatisfiable 6.52s 1.62s % Output : Proof 9.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS076+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n015.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Mon Aug 28 02:06:09 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.84/1.09 Prover 4: Preprocessing ... % 2.84/1.09 Prover 1: Preprocessing ... % 2.84/1.13 Prover 3: Preprocessing ... % 2.84/1.13 Prover 5: Preprocessing ... % 2.84/1.13 Prover 0: Preprocessing ... % 2.84/1.13 Prover 2: Preprocessing ... % 2.84/1.13 Prover 6: Preprocessing ... % 4.96/1.39 Prover 5: Proving ... % 4.96/1.40 Prover 2: Proving ... % 4.96/1.53 Prover 3: Constructing countermodel ... % 4.96/1.56 Prover 6: Proving ... % 4.96/1.56 Prover 1: Constructing countermodel ... % 6.52/1.62 Prover 5: proved (972ms) % 6.52/1.62 % 6.52/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.52/1.62 % 6.52/1.62 Prover 2: proved (976ms) % 6.52/1.62 % 6.52/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.52/1.62 % 6.52/1.62 Prover 3: gave up % 6.52/1.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.52/1.62 Prover 6: stopped % 6.52/1.62 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.52/1.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.52/1.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.69/1.64 Prover 4: Constructing countermodel ... % 6.69/1.66 Prover 8: Preprocessing ... % 6.69/1.67 Prover 1: gave up % 6.69/1.67 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.69/1.67 Prover 7: Preprocessing ... % 6.69/1.68 Prover 0: Proving ... % 6.69/1.68 Prover 0: stopped % 6.69/1.68 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 6.69/1.69 Prover 10: Preprocessing ... % 6.69/1.69 Prover 11: Preprocessing ... % 6.69/1.71 Prover 16: Preprocessing ... % 7.40/1.73 Prover 13: Preprocessing ... % 7.40/1.75 Prover 7: Warning: ignoring some quantifiers % 7.40/1.76 Prover 7: Constructing countermodel ... % 7.40/1.76 Prover 10: Warning: ignoring some quantifiers % 7.40/1.78 Prover 10: Constructing countermodel ... % 7.84/1.81 Prover 16: Warning: ignoring some quantifiers % 7.84/1.81 Prover 16: Constructing countermodel ... % 7.84/1.82 Prover 13: Warning: ignoring some quantifiers % 7.84/1.83 Prover 13: Constructing countermodel ... % 8.54/1.88 Prover 4: Found proof (size 25) % 8.54/1.88 Prover 4: proved (1233ms) % 8.54/1.88 Prover 13: stopped % 8.54/1.88 Prover 10: Found proof (size 22) % 8.54/1.88 Prover 10: proved (248ms) % 8.54/1.88 Prover 16: stopped % 8.54/1.89 Prover 7: Found proof (size 22) % 8.54/1.89 Prover 7: proved (269ms) % 8.54/1.89 Prover 8: Warning: ignoring some quantifiers % 8.54/1.90 Prover 8: Constructing countermodel ... % 8.54/1.91 Prover 8: stopped % 8.74/1.93 Prover 11: Constructing countermodel ... % 8.84/1.94 Prover 11: stopped % 8.84/1.94 % 8.84/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.84/1.94 % 8.84/1.95 % SZS output start Proof for theBenchmark % 8.84/1.95 Assumptions after simplification: % 8.84/1.95 --------------------------------- % 8.84/1.95 % 8.84/1.95 (axiom_10) % 8.84/1.97 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rf1(v0, v1) = v2) | % 8.84/1.97 ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rs(v0, v1) = v3)) & ! % 8.84/1.97 [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | % 8.84/1.97 rf1(v0, v1) = 0) % 8.84/1.97 % 8.84/1.97 (axiom_11) % 8.84/1.98 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rf(v0, v1) = v2) | ~ % 8.84/1.98 $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rs(v0, v1) = v3)) & ! % 8.84/1.98 [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | rf(v0, % 8.84/1.98 v1) = 0) % 8.84/1.98 % 8.84/1.98 (axiom_2) % 8.84/1.99 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: int] : ! [v4: $i] : (v3 = % 8.84/1.99 0 | v1 = 0 | ~ (rf(v0, v4) = 0) | ~ (cp(v2) = v3) | ~ (cUnsatisfiable(v0) % 8.84/1.99 = v1) | ~ $i(v4) | ~ $i(v2) | ~ $i(v0) | ? [v5: int] : ? [v6: $i] : % 8.84/1.99 ? [v7: int] : ? [v8: int] : ($i(v6) & ((v7 = 0 & rinvF1(v2, v6) = 0 & ! % 8.84/1.99 [v9: $i] : ( ~ (rs(v6, v9) = 0) | ~ $i(v9) | ? [v10: int] : ( ~ (v10 % 8.84/1.99 = 0) & cowlThing(v9) = v10)) & ! [v9: $i] : ( ~ (cowlThing(v9) % 8.84/1.99 = 0) | ~ $i(v9) | ? [v10: int] : ( ~ (v10 = 0) & rs(v6, v9) = % 8.84/1.99 v10))) | ( ~ (v8 = 0) & cp(v4) = v8) | ( ~ (v5 = 0) & rf1(v0, v2) % 8.84/1.99 = v5)))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: int] : % 8.84/1.99 ! [v4: $i] : (v3 = 0 | v1 = 0 | ~ (cp(v4) = 0) | ~ (cp(v2) = v3) | ~ % 8.84/1.99 (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v2) | ~ $i(v0) | ? [v5: int] % 8.84/1.99 : ? [v6: $i] : ? [v7: int] : ? [v8: int] : ($i(v6) & ((v7 = 0 & % 8.84/1.99 rinvF1(v2, v6) = 0 & ! [v9: $i] : ( ~ (rs(v6, v9) = 0) | ~ $i(v9) | % 8.84/1.99 ? [v10: int] : ( ~ (v10 = 0) & cowlThing(v9) = v10)) & ! [v9: $i] : % 8.84/1.99 ( ~ (cowlThing(v9) = 0) | ~ $i(v9) | ? [v10: int] : ( ~ (v10 = 0) & % 8.84/1.99 rs(v6, v9) = v10))) | ( ~ (v8 = 0) & rf(v0, v4) = v8) | ( ~ (v5 = % 8.84/1.99 0) & rf1(v0, v2) = v5)))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] % 8.84/1.99 : ! [v3: $i] : (v1 = 0 | ~ (rf1(v0, v2) = 0) | ~ (rf(v0, v3) = 0) | ~ % 8.84/1.99 (cUnsatisfiable(v0) = v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v4: int] % 8.84/1.99 : ? [v5: $i] : ? [v6: int] : ? [v7: int] : ($i(v5) & ((v6 = 0 & % 8.84/1.99 rinvF1(v2, v5) = 0 & ! [v8: $i] : ( ~ (rs(v5, v8) = 0) | ~ $i(v8) | % 8.84/1.99 ? [v9: int] : ( ~ (v9 = 0) & cowlThing(v8) = v9)) & ! [v8: $i] : ( % 8.84/1.99 ~ (cowlThing(v8) = 0) | ~ $i(v8) | ? [v9: int] : ( ~ (v9 = 0) & % 8.84/1.99 rs(v5, v8) = v9))) | (v4 = 0 & cp(v2) = 0) | ( ~ (v7 = 0) & cp(v3) % 8.84/1.99 = v7)))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: $i] : % 8.84/1.99 (v1 = 0 | ~ (rf1(v0, v2) = 0) | ~ (cp(v3) = 0) | ~ (cUnsatisfiable(v0) = % 8.84/1.99 v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v4: int] : ? [v5: $i] : ? % 8.84/1.99 [v6: int] : ? [v7: int] : ($i(v5) & ((v6 = 0 & rinvF1(v2, v5) = 0 & ! [v8: % 8.84/1.99 $i] : ( ~ (rs(v5, v8) = 0) | ~ $i(v8) | ? [v9: int] : ( ~ (v9 = 0) % 8.84/1.99 & cowlThing(v8) = v9)) & ! [v8: $i] : ( ~ (cowlThing(v8) = 0) | % 8.84/1.99 ~ $i(v8) | ? [v9: int] : ( ~ (v9 = 0) & rs(v5, v8) = v9))) | (v4 = % 8.84/1.99 0 & cp(v2) = 0) | ( ~ (v7 = 0) & rf(v0, v3) = v7)))) & ! [v0: $i] : ( % 8.84/1.99 ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : ? [v2: int] : ( ~ % 8.84/1.99 (v2 = 0) & rf1(v0, v1) = 0 & cp(v1) = v2 & $i(v1) & ! [v3: $i] : ( ~ % 8.84/1.99 (rinvF1(v1, v3) = 0) | ~ $i(v3) | ? [v4: $i] : (rs(v3, v4) = 0 & % 8.84/1.99 cowlThing(v4) = 0 & $i(v4))))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) % 8.84/1.99 = 0) | ~ $i(v0) | ? [v1: $i] : (rf(v0, v1) = 0 & cp(v1) = 0 & $i(v1))) % 8.84/1.99 % 8.84/1.99 (axiom_3) % 8.84/2.00 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rf(v0, v2) = 0) | ~ % 8.84/2.00 (rf(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) % 8.84/2.00 % 8.84/2.00 (axiom_4) % 8.84/2.00 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rf1(v0, v2) = 0) | ~ % 8.84/2.00 (rf1(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) % 8.84/2.00 % 8.84/2.00 (axiom_6) % 8.84/2.00 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rinvF1(v0, v1) = v2) % 8.84/2.00 | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rf1(v1, v0) = v3)) & % 8.84/2.00 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rf1(v1, v0) = v2) | % 8.84/2.00 ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rinvF1(v0, v1) = v3)) & % 8.84/2.00 ! [v0: $i] : ! [v1: $i] : ( ~ (rinvF1(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | % 8.84/2.00 rf1(v1, v0) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (rf1(v1, v0) = 0) | ~ % 8.84/2.00 $i(v1) | ~ $i(v0) | rinvF1(v0, v1) = 0) % 8.84/2.00 % 8.84/2.00 (axiom_9) % 8.84/2.00 cUnsatisfiable(i2003_11_14_17_19_06193) = 0 & $i(i2003_11_14_17_19_06193) % 8.84/2.00 % 8.84/2.00 (function-axioms) % 8.84/2.00 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.84/2.00 [v3: $i] : (v1 = v0 | ~ (rs(v3, v2) = v1) | ~ (rs(v3, v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.84/2.00 : (v1 = v0 | ~ (rinvS(v3, v2) = v1) | ~ (rinvS(v3, v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.84/2.00 : (v1 = v0 | ~ (rinvF1(v3, v2) = v1) | ~ (rinvF1(v3, v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.84/2.00 : (v1 = v0 | ~ (rinvF(v3, v2) = v1) | ~ (rinvF(v3, v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.84/2.00 : (v1 = v0 | ~ (rf1(v3, v2) = v1) | ~ (rf1(v3, v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.84/2.00 : (v1 = v0 | ~ (rf(v3, v2) = v1) | ~ (rf(v3, v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.84/2.00 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.84/2.00 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 8.84/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.84/2.00 ~ (cp(v2) = v1) | ~ (cp(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.84/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ % 8.84/2.00 (cowlThing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.84/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ % 8.84/2.00 (cowlNothing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.84/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | % 8.84/2.00 ~ (cUnsatisfiable(v2) = v0)) % 8.84/2.00 % 8.84/2.00 Further assumptions not needed in the proof: % 8.84/2.00 -------------------------------------------- % 8.84/2.01 axiom_0, axiom_1, axiom_5, axiom_7, axiom_8, cUnsatisfiable_substitution_1, % 8.84/2.01 cowlNothing_substitution_1, cowlThing_substitution_1, cp_substitution_1, % 8.84/2.01 rf1_substitution_1, rf1_substitution_2, rf_substitution_1, rf_substitution_2, % 8.84/2.01 rinvF1_substitution_1, rinvF1_substitution_2, rinvF_substitution_1, % 8.84/2.01 rinvF_substitution_2, rinvS_substitution_1, rinvS_substitution_2, % 8.84/2.01 rs_substitution_1, rs_substitution_2, xsd_integer_substitution_1, % 8.84/2.01 xsd_string_substitution_1 % 8.84/2.01 % 8.84/2.01 Those formulas are unsatisfiable: % 8.84/2.01 --------------------------------- % 8.84/2.01 % 8.84/2.01 Begin of proof % 8.84/2.01 | % 8.84/2.01 | ALPHA: (axiom_2) implies: % 8.84/2.01 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 8.84/2.01 | (rf(v0, v1) = 0 & cp(v1) = 0 & $i(v1))) % 8.84/2.01 | (2) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 8.84/2.01 | ? [v2: int] : ( ~ (v2 = 0) & rf1(v0, v1) = 0 & cp(v1) = v2 & $i(v1) & % 8.84/2.01 | ! [v3: $i] : ( ~ (rinvF1(v1, v3) = 0) | ~ $i(v3) | ? [v4: $i] : % 8.84/2.01 | (rs(v3, v4) = 0 & cowlThing(v4) = 0 & $i(v4))))) % 8.84/2.01 | % 8.84/2.01 | ALPHA: (axiom_6) implies: % 8.84/2.01 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (rf1(v1, v0) = 0) | ~ $i(v1) | ~ % 8.84/2.01 | $i(v0) | rinvF1(v0, v1) = 0) % 8.84/2.01 | % 8.84/2.01 | ALPHA: (axiom_9) implies: % 8.84/2.01 | (4) $i(i2003_11_14_17_19_06193) % 8.84/2.01 | (5) cUnsatisfiable(i2003_11_14_17_19_06193) = 0 % 8.84/2.01 | % 8.84/2.01 | ALPHA: (axiom_10) implies: % 8.84/2.01 | (6) ! [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~ % 8.84/2.01 | $i(v0) | rf1(v0, v1) = 0) % 8.84/2.01 | % 8.84/2.01 | ALPHA: (axiom_11) implies: % 8.84/2.01 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~ % 8.84/2.01 | $i(v0) | rf(v0, v1) = 0) % 8.84/2.01 | % 8.84/2.01 | ALPHA: (function-axioms) implies: % 8.84/2.01 | (8) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 8.84/2.01 | (v1 = v0 | ~ (cp(v2) = v1) | ~ (cp(v2) = v0)) % 8.84/2.01 | % 8.84/2.02 | GROUND_INST: instantiating (2) with i2003_11_14_17_19_06193, simplifying with % 8.84/2.02 | (4), (5) gives: % 8.84/2.02 | (9) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 8.84/2.02 | rf1(i2003_11_14_17_19_06193, v0) = 0 & cp(v0) = v1 & $i(v0) & ! [v2: % 8.84/2.02 | $i] : ( ~ (rinvF1(v0, v2) = 0) | ~ $i(v2) | ? [v3: $i] : (rs(v2, % 8.84/2.02 | v3) = 0 & cowlThing(v3) = 0 & $i(v3)))) % 8.84/2.02 | % 8.84/2.02 | GROUND_INST: instantiating (1) with i2003_11_14_17_19_06193, simplifying with % 8.84/2.02 | (4), (5) gives: % 9.28/2.02 | (10) ? [v0: $i] : (rf(i2003_11_14_17_19_06193, v0) = 0 & cp(v0) = 0 & % 9.28/2.02 | $i(v0)) % 9.28/2.02 | % 9.28/2.02 | DELTA: instantiating (10) with fresh symbol all_20_0 gives: % 9.28/2.02 | (11) rf(i2003_11_14_17_19_06193, all_20_0) = 0 & cp(all_20_0) = 0 & % 9.28/2.02 | $i(all_20_0) % 9.28/2.02 | % 9.28/2.02 | ALPHA: (11) implies: % 9.28/2.02 | (12) $i(all_20_0) % 9.28/2.02 | (13) cp(all_20_0) = 0 % 9.28/2.02 | (14) rf(i2003_11_14_17_19_06193, all_20_0) = 0 % 9.28/2.02 | % 9.28/2.02 | DELTA: instantiating (9) with fresh symbols all_22_0, all_22_1 gives: % 9.28/2.02 | (15) ~ (all_22_0 = 0) & rf1(i2003_11_14_17_19_06193, all_22_1) = 0 & % 9.28/2.02 | cp(all_22_1) = all_22_0 & $i(all_22_1) & ! [v0: $i] : ( ~ % 9.28/2.02 | (rinvF1(all_22_1, v0) = 0) | ~ $i(v0) | ? [v1: $i] : (rs(v0, v1) = % 9.28/2.02 | 0 & cowlThing(v1) = 0 & $i(v1))) % 9.28/2.02 | % 9.28/2.02 | ALPHA: (15) implies: % 9.28/2.02 | (16) ~ (all_22_0 = 0) % 9.28/2.02 | (17) $i(all_22_1) % 9.28/2.02 | (18) cp(all_22_1) = all_22_0 % 9.28/2.02 | (19) rf1(i2003_11_14_17_19_06193, all_22_1) = 0 % 9.28/2.02 | (20) ! [v0: $i] : ( ~ (rinvF1(all_22_1, v0) = 0) | ~ $i(v0) | ? [v1: $i] % 9.28/2.02 | : (rs(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1))) % 9.28/2.02 | % 9.28/2.02 | GROUND_INST: instantiating (3) with all_22_1, i2003_11_14_17_19_06193, % 9.28/2.02 | simplifying with (4), (17), (19) gives: % 9.28/2.02 | (21) rinvF1(all_22_1, i2003_11_14_17_19_06193) = 0 % 9.28/2.02 | % 9.28/2.02 | GROUND_INST: instantiating (20) with i2003_11_14_17_19_06193, simplifying with % 9.28/2.02 | (4), (21) gives: % 9.28/2.02 | (22) ? [v0: $i] : (rs(i2003_11_14_17_19_06193, v0) = 0 & cowlThing(v0) = 0 % 9.28/2.02 | & $i(v0)) % 9.28/2.02 | % 9.28/2.02 | DELTA: instantiating (22) with fresh symbol all_36_0 gives: % 9.28/2.02 | (23) rs(i2003_11_14_17_19_06193, all_36_0) = 0 & cowlThing(all_36_0) = 0 & % 9.28/2.02 | $i(all_36_0) % 9.28/2.02 | % 9.28/2.02 | ALPHA: (23) implies: % 9.28/2.02 | (24) $i(all_36_0) % 9.28/2.02 | (25) rs(i2003_11_14_17_19_06193, all_36_0) = 0 % 9.28/2.02 | % 9.28/2.02 | GROUND_INST: instantiating (6) with i2003_11_14_17_19_06193, all_36_0, % 9.28/2.02 | simplifying with (4), (24), (25) gives: % 9.28/2.02 | (26) rf1(i2003_11_14_17_19_06193, all_36_0) = 0 % 9.28/2.02 | % 9.28/2.03 | GROUND_INST: instantiating (7) with i2003_11_14_17_19_06193, all_36_0, % 9.28/2.03 | simplifying with (4), (24), (25) gives: % 9.28/2.03 | (27) rf(i2003_11_14_17_19_06193, all_36_0) = 0 % 9.28/2.03 | % 9.28/2.03 | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_19_06193, all_20_0, % 9.28/2.03 | all_36_0, simplifying with (4), (12), (14), (24), (27) gives: % 9.28/2.03 | (28) all_36_0 = all_20_0 % 9.28/2.03 | % 9.28/2.03 | GROUND_INST: instantiating (axiom_4) with i2003_11_14_17_19_06193, all_22_1, % 9.28/2.03 | all_36_0, simplifying with (4), (17), (19), (24), (26) gives: % 9.28/2.03 | (29) all_36_0 = all_22_1 % 9.28/2.03 | % 9.28/2.03 | COMBINE_EQS: (28), (29) imply: % 9.28/2.03 | (30) all_22_1 = all_20_0 % 9.28/2.03 | % 9.28/2.03 | REDUCE: (18), (30) imply: % 9.28/2.03 | (31) cp(all_20_0) = all_22_0 % 9.28/2.03 | % 9.28/2.03 | GROUND_INST: instantiating (8) with 0, all_22_0, all_20_0, simplifying with % 9.28/2.03 | (13), (31) gives: % 9.28/2.03 | (32) all_22_0 = 0 % 9.28/2.03 | % 9.28/2.03 | REDUCE: (16), (32) imply: % 9.28/2.03 | (33) $false % 9.28/2.03 | % 9.28/2.03 | CLOSE: (33) is inconsistent. % 9.28/2.03 | % 9.28/2.03 End of proof % 9.28/2.03 % SZS output end Proof for theBenchmark % 9.28/2.03 % 9.28/2.03 1410ms %------------------------------------------------------------------------------